Simon Cruanes
|
79942515cd
|
added a functional Queue implementation
|
2013-03-09 20:35:45 +01:00 |
|
Simon Cruanes
|
a04e252d2c
|
a bugfix in Sequence.product;
changed default block size of MList
|
2013-03-08 16:04:16 +01:00 |
|
Simon Cruanes
|
732cc90ea6
|
updated sequence files
|
2013-03-08 15:44:43 +01:00 |
|
Simon Cruanes
|
d00144375b
|
do not assume too much on initial size
|
2013-03-07 19:10:57 +01:00 |
|
Simon Cruanes
|
7d96c9092a
|
deletion for FHashtbl.Tree implemented
|
2013-03-07 18:22:42 +01:00 |
|
Simon Cruanes
|
f561e7af7c
|
changed interface of Cache.S.with_cache_rec
|
2013-03-07 18:12:35 +01:00 |
|
Simon Cruanes
|
14ca51db92
|
bugfix: Graph.is_dag must explore every vertex
|
2013-03-07 16:55:50 +01:00 |
|
Simon Cruanes
|
246f2949ea
|
tests and benchmark for the functional hashtables
|
2013-03-07 16:19:22 +01:00 |
|
Simon Cruanes
|
b5a9ae03e7
|
fixed stupid bug in FHashble.Flat
|
2013-03-07 16:12:53 +01:00 |
|
Simon Cruanes
|
0320630b2d
|
flat implementation of the persistent hashtable
|
2013-03-07 16:07:01 +01:00 |
|
Simon Cruanes
|
6b314e4b37
|
added FHashtbl to benchmarks
|
2013-03-07 15:01:10 +01:00 |
|
Simon Cruanes
|
bba6da0bde
|
more tests for FHashtbl
|
2013-03-07 14:50:20 +01:00 |
|
Simon Cruanes
|
40dcbd5224
|
more elaborate insertion in FHashtbl (increase size of deeper hashtables);
fixed a stupid bug in the insertion;
FHashtbl.mem function
|
2013-03-07 14:50:10 +01:00 |
|
Simon Cruanes
|
5c6d9d94f2
|
more tests for FHashtbl
|
2013-03-07 13:51:36 +01:00 |
|
Simon Cruanes
|
7bde68ae75
|
some tests for functional hashtables
|
2013-03-07 12:41:45 +01:00 |
|
Simon Cruanes
|
6532906f1b
|
draft of functional hashtable
|
2013-03-07 12:41:23 +01:00 |
|
Simon Cruanes
|
14a5210bc2
|
added FlatHashtbl to the benchmarks
|
2013-03-07 10:18:13 +01:00 |
|
Simon Cruanes
|
c192d5558a
|
fixed bug in FlatHashtbl.remove
|
2013-03-07 10:12:47 +01:00 |
|
Simon Cruanes
|
88ceeb5430
|
update .merlin
|
2013-03-07 10:09:21 +01:00 |
|
Simon Cruanes
|
d460628695
|
added tests for FlatHashtbl
|
2013-03-07 10:07:25 +01:00 |
|
Simon Cruanes
|
a53a26541a
|
updated the implementation of flatHashtbl:
removed ugly Obj, conversion between table and sequence, copy operation
|
2013-03-07 10:07:13 +01:00 |
|
Simon Cruanes
|
fb52aad014
|
include the sequence module in here, to reduce dependencies.
|
2013-03-07 10:00:50 +01:00 |
|
Simon Cruanes
|
ec8145448d
|
gitignore
|
2013-03-07 09:59:04 +01:00 |
|
Simon Cruanes
|
001e28ad5f
|
LRU cache implemented
|
2013-03-06 15:43:54 +01:00 |
|
Simon Cruanes
|
694b4929b0
|
Cache.S2 can cache pair of heterogeneous arguments;
Cache.Dummy and Cache.Dummy2 (no caching);
benchmarking Cache
|
2013-03-06 15:14:48 +01:00 |
|
Simon Cruanes
|
22e948e374
|
big changes in the Cache module, with clean signatures and several
functors that implement distinct policies
|
2013-03-06 12:28:09 +01:00 |
|
Simon Cruanes
|
56d8de46a3
|
tests for the Universal type
|
2013-03-06 11:00:52 +01:00 |
|
Simon Cruanes
|
d4565d7a1f
|
Universal type embedding
|
2013-03-06 11:00:36 +01:00 |
|
Simon Cruanes
|
588e7bece9
|
update of benchmark
|
2013-03-05 18:54:02 +01:00 |
|
Simon Cruanes
|
8da095f76b
|
fix in Graph.pp
|
2013-03-05 12:06:43 +01:00 |
|
Simon Cruanes
|
9ce511156e
|
update of README
|
2013-03-05 11:48:49 +01:00 |
|
Simon Cruanes
|
151156fb43
|
more graph tests
|
2013-03-05 11:39:34 +01:00 |
|
Simon Cruanes
|
33d8ac6253
|
test file for Graph
|
2013-03-05 11:25:08 +01:00 |
|
Simon Cruanes
|
009afc575b
|
graph now uses Heap rather than Leftistheap
|
2013-03-05 11:08:26 +01:00 |
|
Simon Cruanes
|
2e19b5eb1a
|
updated tests , with tests on heaps
|
2013-03-05 11:05:34 +01:00 |
|
Simon Cruanes
|
fc590bfb27
|
add new containers to containers.mllib
|
2013-03-05 11:05:23 +01:00 |
|
Simon Cruanes
|
51afd6d74d
|
imperative heaps on top of splay trees
|
2013-03-05 11:05:12 +01:00 |
|
Simon Cruanes
|
9e18a807ce
|
splay heaps are implemented
|
2013-03-05 11:05:00 +01:00 |
|
Simon Cruanes
|
daed6a3277
|
small test change
|
2013-03-05 09:55:38 +01:00 |
|
Simon Cruanes
|
f7d0d88882
|
also benchmark IHashtbl (functor);
use Bench.bench_n, which is much better
|
2013-03-05 01:10:21 +01:00 |
|
Simon Cruanes
|
f3074584ff
|
updated benchmark
|
2013-03-05 00:55:24 +01:00 |
|
Simon Cruanes
|
deab8c8f62
|
robin hood hashing for PHashtbl
|
2013-03-05 00:49:02 +01:00 |
|
Simon Cruanes
|
7a01248c06
|
stub of SplayTree structure
|
2013-03-04 19:10:20 +01:00 |
|
Simon Cruanes
|
d101d913a2
|
bound size of hashtable with Sys.max_rray_length
|
2013-03-04 19:10:06 +01:00 |
|
Simon Cruanes
|
484653fb08
|
add .replace operation in benchs
|
2013-03-04 18:21:26 +01:00 |
|
Simon Cruanes
|
d19abf889c
|
updated Graph to remove the functor; it is now
imperative, backed by PHashtbl, and offers a simplified Dot-printing interface.
|
2013-03-04 17:35:22 +01:00 |
|
Simon Cruanes
|
25a7d33985
|
added PHashtbl.get_eq/get_hash, to access the functions;
added a function to create a PHashtbl from a module;
added PHashtbl.map
|
2013-03-04 17:31:37 +01:00 |
|
Simon Cruanes
|
01e008256c
|
hashset.union/inter take an optional argument for the resulting set
|
2013-03-04 17:30:34 +01:00 |
|
Simon Cruanes
|
d52441018c
|
Hashset based on PHashtbl
|
2013-03-04 16:04:37 +01:00 |
|
Simon Cruanes
|
f363399fda
|
PHashtbl.filter
|
2013-03-04 16:01:37 +01:00 |
|