aboutsummaryrefslogtreecommitdiff
path: root/math/p5-Set-Partition
diff options
context:
space:
mode:
authorDmitry Marakasov <amdmi3@FreeBSD.org>2016-05-19 10:44:11 +0000
committerDmitry Marakasov <amdmi3@FreeBSD.org>2016-05-19 10:44:11 +0000
commit4e942b64191e2ef98dce2c5af31047a8640db768 (patch)
tree8c3238b7f0cbec2e9210d52f562960bb22323a7d /math/p5-Set-Partition
parent1d1f878054efdd1171a8cb006e59ad0727610293 (diff)
Notes
Diffstat (limited to 'math/p5-Set-Partition')
-rw-r--r--math/p5-Set-Partition/pkg-descr12
1 files changed, 6 insertions, 6 deletions
diff --git a/math/p5-Set-Partition/pkg-descr b/math/p5-Set-Partition/pkg-descr
index 6e1988f89208..721c5bf90068 100644
--- a/math/p5-Set-Partition/pkg-descr
+++ b/math/p5-Set-Partition/pkg-descr
@@ -1,11 +1,11 @@
-Set::Partition takes a list or hash of elements and a list numbers that
-represent the sizes of the partitions into which the list of elements
+Set::Partition takes a list or hash of elements and a list numbers that
+represent the sizes of the partitions into which the list of elements
should be arranged.
-The resulting object can then be used as an iterator which returns a
-reference to an array of lists, that represents the original list arranged
-according to the given partitioning. All possible arrangements are
-returned, and the object returns undef when the entire combination space
+The resulting object can then be used as an iterator which returns a
+reference to an array of lists, that represents the original list arranged
+according to the given partitioning. All possible arrangements are
+returned, and the object returns undef when the entire combination space
has been exhausted.
WWW: http://search.cpan.org/dist/Set-Partition/