John Benediktsson
|
6a2b05b7f6
|
math.factorials: adding double-factorial.
|
2013-04-08 21:13:46 -07:00 |
|
John Benediktsson
|
16031eb9e0
|
math.factorials: cleanup using.
|
2013-04-08 15:23:39 -07:00 |
|
John Benediktsson
|
e909f05924
|
math.factorials: include 1.
|
2013-04-08 15:15:49 -07:00 |
|
John Benediktsson
|
e19c98da91
|
math.factorials: handle more inputs in factorial/.
|
2013-04-08 15:08:53 -07:00 |
|
John Benediktsson
|
c7c980ca25
|
math.factorials: various factorial words.
|
2013-04-08 15:03:15 -07:00 |
|
John Benediktsson
|
8e394361b6
|
benchmark.sum-file: simpler, more idiomatic, faster.
|
2013-04-08 07:17:37 -07:00 |
|
John Benediktsson
|
d41013ee4a
|
benchmark.pidigits: simplify handling of arrays.
|
2013-04-07 15:33:54 -07:00 |
|
John Benediktsson
|
664eaaa13c
|
benchmark.reverse-complement: more idiomatic, faster.
|
2013-04-07 15:19:58 -07:00 |
|
John Benediktsson
|
b334c46f06
|
hash-sets: use map-into in members.
|
2013-04-07 13:09:20 -07:00 |
|
John Benediktsson
|
0a49cf7dac
|
biassocs: implement keys/values.
|
2013-04-07 12:55:29 -07:00 |
|
John Benediktsson
|
059b87bbfa
|
mirrors: implement keys/values.
|
2013-04-07 12:51:35 -07:00 |
|
John Benediktsson
|
1f81b9d0ce
|
hashtables.wrapped: faster >alist, keys, values.
|
2013-04-07 12:45:38 -07:00 |
|
John Benediktsson
|
0d566c9a88
|
assocs: faster keys/values for enums.
|
2013-04-07 12:44:09 -07:00 |
|
John Benediktsson
|
ffac24c5a0
|
persistent.hashtables: fix missing keys/values, not sure why these aren't assocs.
|
2013-04-07 09:45:10 -07:00 |
|
John Benediktsson
|
95915d569d
|
hashtables: cleanup duplicate code.
|
2013-04-06 21:36:39 -07:00 |
|
John Benediktsson
|
0d3c292dc3
|
hashtables: faster keys and values on hashtables.
|
2013-04-06 21:20:07 -07:00 |
|
John Benediktsson
|
5c28fc4027
|
assocs: making keys and values generic.
|
2013-04-06 21:19:56 -07:00 |
|
John Benediktsson
|
25444ac7d8
|
Minor fix to make sure strings are produced.
|
2013-04-06 18:50:26 -07:00 |
|
John Benediktsson
|
9bdde31783
|
use concat instead of join.
|
2013-04-06 17:02:22 -07:00 |
|
John Benediktsson
|
ee775d51c6
|
stack-checker.dependencies: use short-circuit better.
|
2013-04-06 16:44:50 -07:00 |
|
John Benediktsson
|
f750dd035a
|
tools.crossref: switch to using identity hash-sets.
|
2013-04-06 14:53:54 -07:00 |
|
John Benediktsson
|
07a099fa60
|
math.combinatorics: remove duplicate nths-unsafe.
|
2013-04-06 14:29:47 -07:00 |
|
John Benediktsson
|
206d42c930
|
random: use nths-unsafe in sample.
|
2013-04-06 14:29:47 -07:00 |
|
John Benediktsson
|
775fc57d30
|
sequences: adding nths-unsafe.
|
2013-04-06 14:29:47 -07:00 |
Doug Coleman
|
ec807fdb48
|
editors.sublime: Add support for Sublime Editor 2 for MacOSX. Need to add support for Windows.
|
2013-04-06 14:24:03 -07:00 |
|
John Benediktsson
|
049611ad44
|
hash-sets.sequences: adding sequence hashsets.
|
2013-04-06 14:14:01 -07:00 |
|
John Benediktsson
|
1c31ceaeba
|
hash-sets.identity: adding identity hashsets.
|
2013-04-06 14:14:00 -07:00 |
|
John Benediktsson
|
98f165fd96
|
hash-sets.wrapped: support for "wrapped" hash-sets.
|
2013-04-06 14:14:00 -07:00 |
|
John Benediktsson
|
3a006226cf
|
hashtables.identity: minor cleanup.
|
2013-04-06 14:14:00 -07:00 |
|
John Benediktsson
|
a5a50be00b
|
hashtables.sequences: minor cleanup.
|
2013-04-06 14:14:00 -07:00 |
|
Doug Coleman
|
62134b5c8a
|
heaps: Add >min-heap, >max-heap.
|
2013-04-06 13:50:16 -07:00 |
|
John Benediktsson
|
49b353956c
|
help: make sure error-classes are displayed in error index.
|
2013-04-06 13:35:37 -07:00 |
|
John Benediktsson
|
b79646f572
|
math.combinatorics: make permutations-quot to reduce code duplication.
|
2013-04-06 13:12:57 -07:00 |
|
John Benediktsson
|
86b0708203
|
math.combinatorics: produce type of sequence in selections.
|
2013-04-06 13:06:23 -07:00 |
|
John Benediktsson
|
ec0b40d67b
|
prettyprint: speed up unparse by not making the manifest sometimes.
|
2013-04-06 12:45:15 -07:00 |
|
John Benediktsson
|
3640e92521
|
math.combinatorics: use nth-unsafe more.
|
2013-04-06 12:43:02 -07:00 |
|
John Benediktsson
|
8458e93c3d
|
math.combinatorics: faster nCk (use integer division).
|
2013-04-06 11:43:20 -07:00 |
|
John Benediktsson
|
a92a0ca285
|
math.combinatorics: faster permutation (using slices).
|
2013-04-05 07:28:22 -07:00 |
|
John Benediktsson
|
1e8c4881ce
|
bit-arrays: use integer>fixnum, cleanup resize.
|
2013-04-04 18:12:20 -07:00 |
|
John Benediktsson
|
c4b5026a64
|
bloom-filters: fix docs.
|
2013-04-04 16:06:01 -07:00 |
|
John Benediktsson
|
9512b2e303
|
infix: removing alternate syntax due to use of multiline strings...
|
2013-04-04 15:17:50 -07:00 |
|
Doug Coleman
|
142d920326
|
help.tutorial: Use scaffold-work in palindrome tutorial.
|
2013-04-04 15:06:33 -07:00 |
|
John Benediktsson
|
8c2419d115
|
infix: adding alternate syntax.
|
2013-04-04 15:05:49 -07:00 |
|
John Benediktsson
|
abc68117af
|
infix: adding pow().
|
2013-04-04 15:04:14 -07:00 |
|
John Benediktsson
|
672dd0e2a7
|
boids: fix typo.
|
2013-04-04 13:33:26 -07:00 |
|
John Benediktsson
|
0e1e56417d
|
bloom-filters: cleanup interface a little bit.
|
2013-04-04 13:26:24 -07:00 |
|
John Benediktsson
|
af4dd22fe9
|
base85: fix handling of pad characters.
|
2013-04-04 11:43:17 -07:00 |
|
John Benediktsson
|
6e37886e19
|
base85: adding a base85 encoder/decoder.
|
2013-04-04 10:39:43 -07:00 |
|
John Benediktsson
|
e642b4203f
|
benchmark.bloom-filters: more iterations now bloom-filters are faster.
|
2013-04-04 07:10:30 -07:00 |
|
John Benediktsson
|
1900e480fe
|
bloom-filters: tons of speed.
|
2013-04-04 07:10:13 -07:00 |