John Benediktsson
|
e9c6bf6b9a
|
math.combinatorics: faster combinations by inlining next-combination.
|
2013-10-14 15:44:19 -07:00 |
|
John Benediktsson
|
d76f8d151d
|
math.combinatorics: adding all-combinations? and all-permutations?.
|
2013-10-01 20:44:57 -07:00 |
|
John Benediktsson
|
6c6664b0b8
|
math.combinatorics: specialized version of nths-unsafe for performance.
|
2013-06-14 11:27:45 -07:00 |
|
John Benediktsson
|
917ae3e410
|
math.combinatorics: use cond in k-permutations.
|
2013-05-15 15:09:25 -07:00 |
|
John Benediktsson
|
c1e91316d2
|
math.combinatorics: adding a k-permutations virtual sequence.
|
2013-05-15 15:05:38 -07:00 |
|
John Benediktsson
|
0d806e0b69
|
Revert "math.statistics: change cum-mean to use v/."
This reverts commit 9df2235d8983da67d106a6d5fb297134e5e2a58e.
|
2013-05-06 09:08:11 -07:00 |
|
John Benediktsson
|
b01b14c0e2
|
math.statistics: change cum-mean to use v/.
|
2013-05-06 08:59:02 -07:00 |
|
John Benediktsson
|
c1ab4aab59
|
math.combinatorics: faster by using hints for the array common case.
|
2013-05-01 11:18:17 -07:00 |
|
John Benediktsson
|
3ca65a2b47
|
math.combinatorics: fix map>assoc-combinations (shouldn't have been locals).
|
2013-04-18 09:04:47 -07:00 |
|
John Benediktsson
|
02d652e6c0
|
math.combinatorics: minor fix to reduce-combinations stack effect.
|
2013-04-18 07:17:36 -07:00 |
|
John Benediktsson
|
77b3d509be
|
math.combinatorics: cleanup stack effects to be more descriptive.
|
2013-04-18 07:15:47 -07:00 |
|
John Benediktsson
|
81f733493d
|
math.combinatorics: much faster permutations, cleanup combinations code.
|
2013-04-18 07:04:17 -07:00 |
|
John Benediktsson
|
433adf8dd2
|
math.combinatorics: big speedup to combinations.
|
2013-04-17 20:57:48 -07:00 |
|
John Benediktsson
|
3862c4f9b5
|
math.combinatorics: remove duplicate nths-unsafe.
|
2013-04-06 14:29:47 -07:00 |
|
John Benediktsson
|
decd9ed1ee
|
math.combinatorics: make permutations-quot to reduce code duplication.
|
2013-04-06 13:12:57 -07:00 |
|
John Benediktsson
|
b646d1e1b8
|
math.combinatorics: produce type of sequence in selections.
|
2013-04-06 13:06:23 -07:00 |
|
John Benediktsson
|
64111e1342
|
math.combinatorics: use nth-unsafe more.
|
2013-04-06 12:43:02 -07:00 |
|
John Benediktsson
|
d15dbaebb4
|
math.combinatorics: faster nCk (use integer division).
|
2013-04-06 11:43:20 -07:00 |
|
John Benediktsson
|
a52ee59005
|
math.combinatorics: faster permutation (using slices).
|
2013-04-05 07:28:22 -07:00 |
|
John Benediktsson
|
c86b2d2161
|
math.combinatorics: factorial could be memoized...
|
2012-09-05 11:02:38 -07:00 |
|
John Benediktsson
|
55525a8ba4
|
math.combinatorics: 100%+ faster combinations.
|
2012-06-01 14:07:39 -07:00 |
|
John Benediktsson
|
817b45ee03
|
math.combinatorics: minor performance improvements.
|
2012-04-24 18:42:34 -07:00 |
|
John Benediktsson
|
f24e40800a
|
math.combinatorics: faster version of factorial.
|
2012-04-24 10:06:00 -07:00 |
|
John Benediktsson
|
b9bcfdab8e
|
math.combinatorics: adding <combinations> and <permutations> sequences.
|
2012-04-23 08:30:22 -07:00 |
|
John Benediktsson
|
c00ddde434
|
math.combinatorics: fix failed find combinations/permutations.
|
2012-04-21 20:11:47 -07:00 |
|
John Benediktsson
|
bada993f78
|
math.combinatorics: adding find-combination and find-permutation.
|
2012-04-20 23:31:40 -07:00 |
Doug Coleman
|
0322b4d028
|
math.combinators: Add filter-permutations/combinations. Minor cleanup.
|
2012-04-18 15:18:54 -07:00 |
|
Doug Coleman
|
229d0e0549
|
math.combinators: Add map-permutation
|
2012-04-18 15:18:54 -07:00 |
|
John Benediktsson
|
8d56193edd
|
math.combinatorics: implementing "next-permutation".
|
2012-03-02 09:54:35 -08:00 |
|
John Benediktsson
|
6f1c44b46d
|
Cleanup some lint warnings.
|
2011-10-15 19:19:44 -07:00 |
|
John Benediktsson
|
d58bc08aa0
|
Update code that did ">alist sort-" to just "sort-".
|
2011-04-07 09:01:21 -07:00 |
|
John Benediktsson
|
ae17190909
|
math.combinatorics: Fixing selections bug with nested sequences.
|
2010-08-13 14:34:14 -07:00 |
|
John Benediktsson
|
f1eb6a9d6e
|
math.combinatorics: improve all-subsets and selections words.
|
2010-07-26 08:12:36 -07:00 |
Joe Groff
|
37bddfba54
|
math.combinatorics: all-subsets and selections words (contributed by John Benediktsson)
|
2010-07-14 09:10:51 -07:00 |
Slava Pestov
|
220dd88a2c
|
Update documentation for new help lint check
|
2010-02-19 12:31:52 +13:00 |
|
Slava Pestov
|
ad6d8556e0
|
Change [0,b) usages to iota
|
2010-01-15 08:05:50 +13:00 |
|
Slava Pestov
|
df4fb4a3ee
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
Doug Coleman
|
313f70dbd6
|
Merge branch 'master' of git://factorcode.org/git/factor
|
2009-12-06 02:28:46 -06:00 |
|
Slava Pestov
|
0a5826c123
|
math.combinatorics: remove 'mirrors' from using list since its not needed
|
2009-12-05 18:21:32 -05:00 |
|
Doug Coleman
|
a1bb120498
|
clean up math.combinatorics and add another combinator
|
2009-11-27 22:50:06 -06:00 |
|
Joe Groff
|
61d579360d
|
remove non-primitive-related uses of tuck from basis
|
2009-11-05 17:03:24 -06:00 |
Aaron Schaefer
|
f465a013d7
|
Speed up best-hands a bit using reduce and add a test
|
2009-05-07 21:23:58 -04:00 |
|
Aaron Schaefer
|
78037d8d05
|
Use binary-search instead of find-last for combinations
|
2009-05-06 20:46:41 -04:00 |
|
Aaron Schaefer
|
678f603aa5
|
Clean up combinations a bit
|
2009-05-06 20:18:21 -04:00 |
|
Aaron Schaefer
|
eaeda30bb1
|
Combinations now map to input sequences directly
|
2009-05-06 01:17:35 -04:00 |
|
Aaron Schaefer
|
71022f9940
|
Add combination support to math.combinatorics
|
2009-05-05 22:43:07 -04:00 |
|
Slava Pestov
|
cd53c2bd37
|
produce and produce-as: don't need third quotation either
|
2009-02-28 15:31:34 -06:00 |
|
Doug Coleman
|
3c408342ef
|
renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail
|
2009-01-29 22:19:07 -06:00 |
|
Aaron Schaefer
|
5869a1aab4
|
Move math.combinatorics to basis
|
2008-11-18 10:20:44 -05:00 |