From 6b9ec7c6e961cd7857faf47eaf0cc6f952393819 Mon Sep 17 00:00:00 2001 From: Pete Saia Date: Tue, 17 Mar 2020 12:12:55 -0400 Subject: [PATCH 1/5] Update readme.md --- readme.md | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/readme.md b/readme.md index 5855079..9a80b18 100644 --- a/readme.md +++ b/readme.md @@ -1,15 +1,17 @@ # kcomb -kcomb implements a variation of [n choose k](https://en.wikipedia.org/wiki/Binomial_coefficient) in order -to compute every possible distinct combination of values within a streamable series of columns. +Compute (and stream/generate) every possible combination within N sets of data using an implementation of [n choose k](https://en.wikipedia.org/wiki/Binomial_coefficient). This could be useful when doing something like generating every possible template string given a set of values for each variable in the template. +When working with larger sets, this can easily result in millions of results. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. + +See [tests](kcomb_test.go) and the [demo](demo/main.go) for usage and benchmarking. + + ``` go get -u github.com/psaia/kcomb ``` -See [tests](kcomb_test.go) and the [demo](demo/main.go) for usage and benchmarking. - ![data stream](demo/fruit.gif) From c2675be281b1be163e0f3ae8912a772b6afc158b Mon Sep 17 00:00:00 2001 From: Pete Saia Date: Tue, 17 Mar 2020 12:14:28 -0400 Subject: [PATCH 2/5] Update readme.md --- readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/readme.md b/readme.md index 9a80b18..0802363 100644 --- a/readme.md +++ b/readme.md @@ -3,7 +3,7 @@ Compute (and stream/generate) every possible combination within N sets of data using an implementation of [n choose k](https://en.wikipedia.org/wiki/Binomial_coefficient). This could be useful when doing something like generating every possible template string given a set of -values for each variable in the template. +values for each variable in the template. This works even when the number of variables per template is unknown. When working with larger sets, this can easily result in millions of results. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. From 2fd36736d6cb092ede1da94906a571c7b62cad8a Mon Sep 17 00:00:00 2001 From: Pete Saia Date: Tue, 17 Mar 2020 12:15:27 -0400 Subject: [PATCH 3/5] Update readme.md --- readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/readme.md b/readme.md index 0802363..7497436 100644 --- a/readme.md +++ b/readme.md @@ -5,7 +5,7 @@ Compute (and stream/generate) every possible combination within N sets of data u This could be useful when doing something like generating every possible template string given a set of values for each variable in the template. This works even when the number of variables per template is unknown. -When working with larger sets, this can easily result in millions of results. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. +When working with larger sets, this can be CPU intensive as results will be in the millions. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. See [tests](kcomb_test.go) and the [demo](demo/main.go) for usage and benchmarking. From 3118ea2db0623bd4cdf8bda6912a43aec9572302 Mon Sep 17 00:00:00 2001 From: Pete Saia Date: Tue, 17 Mar 2020 12:15:49 -0400 Subject: [PATCH 4/5] Update readme.md --- readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/readme.md b/readme.md index 7497436..56167ee 100644 --- a/readme.md +++ b/readme.md @@ -5,7 +5,7 @@ Compute (and stream/generate) every possible combination within N sets of data u This could be useful when doing something like generating every possible template string given a set of values for each variable in the template. This works even when the number of variables per template is unknown. -When working with larger sets, this can be CPU intensive as results will be in the millions. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. +When working with larger sets, this can be resource intensive as results will be in the millions. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. See [tests](kcomb_test.go) and the [demo](demo/main.go) for usage and benchmarking. From 3cbe03f2112b72876d7d805021e69d8ca29d0468 Mon Sep 17 00:00:00 2001 From: Pete Saia Date: Tue, 17 Mar 2020 12:16:18 -0400 Subject: [PATCH 5/5] Update readme.md --- readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/readme.md b/readme.md index 56167ee..2c14d3c 100644 --- a/readme.md +++ b/readme.md @@ -5,7 +5,7 @@ Compute (and stream/generate) every possible combination within N sets of data u This could be useful when doing something like generating every possible template string given a set of values for each variable in the template. This works even when the number of variables per template is unknown. -When working with larger sets, this can be resource intensive as results will be in the millions. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. +When working with larger sets, this can be resource intensive as results could be in the millions+. The `CombineGenerator` func will allow you to create a pipeline and efficently iterate without eating much CPU or memory. See [tests](kcomb_test.go) and the [demo](demo/main.go) for usage and benchmarking.