ocaml-containers

simon/ocaml-containers

Fork 0

mirror of https://github.com/c-cube/ocaml-containers.git synced 2026-05-05 17:04:25 -04:00

Commit graph

197f7eb786 more functions in B-encode, to compute the size of an expression in bytes, and write it into an already-existing string Simon Cruanes 2013-08-29 14:30:42 +02:00
7e82adf973 more doc Simon Cruanes 2013-08-29 14:11:04 +02:00
37be810bbf updated version of Sequence Simon Cruanes 2013-08-28 15:03:05 +02:00
2c3af875b9 new container, AbsSet, that presents an abstract view of sets and relational operators Simon Cruanes 2013-08-20 23:33:14 +02:00
32a59b7982 added filter to leftistheap Simon Cruanes 2013-08-20 12:15:35 +02:00
1d39fd1d5b update of readme and build files Simon Cruanes 2013-08-20 11:31:30 +02:00
1d476e3000 imperative UnionFind structure Simon Cruanes 2013-08-20 11:30:08 +02:00
a9462cf06b small set implementation, relying on a sorted list Simon Cruanes 2013-08-20 11:10:31 +02:00
07480c6a82 is_empty in Multiset Simon Cruanes 2013-07-07 00:19:47 +02:00
f93c5865a4 Merge pull request #1 from nbraud/multiset Simon Cruanes 2013-07-06 15:17:58 -07:00
028368d42f Merge 97caff7ec1 into ab087334e1 Nicolas Braud-Santoni 2013-07-06 15:15:37 -07:00
97caff7ec1 multiSet: Add contains function Nicolas Braud-Santoni 2013-07-07 00:14:22 +02:00
ab087334e1 more operations in MultiSet Simon Cruanes 2013-07-06 13:06:19 +02:00
ec94ca1864 MultiSet on top of Map Simon Cruanes 2013-07-06 12:58:36 +02:00
4f08badd84 updated README Simon Cruanes 2013-07-02 10:17:26 +02:00
fa559395a6 added Random-Access list implementation Simon Cruanes 2013-07-01 14:22:09 +02:00
e7e1d1bb6a cosmetic changes in Bencode Simon Cruanes 2013-06-27 16:13:10 +02:00
171f12a322 Sexp module, for parsing and printing S-expressions incrementally Simon Cruanes 2013-06-25 16:22:34 +02:00
b0dd49afc1 in Sequence, adaptators for Map and Set now keep type t (instead of map/set) Simon Cruanes 2013-06-13 15:59:19 +02:00
a636c73f6d renamed Graph to PersistentGraph, not to collide with OCamlGraph Simon Cruanes 2013-06-13 15:17:52 +02:00
97451b48a9 function Bencode.reset to clear a decoder's state Simon Cruanes 2013-06-13 13:33:26 +02:00
4dd3c63ba5 aesthetic in Bencode Simon Cruanes 2013-06-12 19:35:48 +02:00
b70c94377e fixed .odocl and minor stuff Simon Cruanes 2013-06-12 17:36:59 +02:00
689908f9b9 Bencode module, for the eponym encoding format Simon Cruanes 2013-06-12 17:36:45 +02:00
d9c8007548 Behavior is now based on Lwt rather than React, using futures. Updated tests, doc, etc. Simon Cruanes 2013-06-05 11:06:16 +02:00
de7246b75c small changes Simon Cruanes 2013-05-31 12:29:59 +02:00
a45fccca98 a few more combinators for Behavior Simon Cruanes 2013-05-31 12:20:13 +02:00
fa40412216 changed the implementation of Behavior.Fut Simon Cruanes 2013-05-31 12:08:01 +02:00
59fb4a0d47 terser interface for Behavior (removed mk_ prefixes) Simon Cruanes 2013-05-31 12:01:37 +02:00
7eaf28490e some tests for Behavior; also a new constructor Simon Cruanes 2013-05-31 11:56:01 +02:00
b1d222c3f1 more modular build system, for thread-dependent or React-dependent modules Simon Cruanes 2013-05-31 11:41:43 +02:00
ebe6f63a2c Reactive Behavior tree implementation (for React) Simon Cruanes 2013-05-31 11:41:19 +02:00
73073bdd0c simpler Univ.unpack implementation Simon Cruanes 2013-05-24 13:44:44 +02:00
93eb787082 better Sequence.pp_seq, with trailing separator Simon Cruanes 2013-05-24 13:44:23 +02:00
79dbf5e843 some tests for PiCalculus Simon Cruanes 2013-05-20 21:44:17 +02:00
3d199eeffb PiCalculus module, to emulate the Pi-calculus concurrency model; it uses only one thread on one machine though Simon Cruanes 2013-05-20 19:17:20 +02:00
c6975eaf8a export Bij.t as a private type Simon Cruanes 2013-05-20 17:31:43 +02:00
ec41b0397d added a few helpers to Bij Simon Cruanes 2013-05-20 12:36:55 +02:00
44bd29766c in bij, EOF -> DecodingError Simon Cruanes 2013-05-15 18:09:24 +02:00
5c11f945b9 update of Bij.version Simon Cruanes 2013-05-15 17:59:19 +02:00
a893e6c0eb 4-ary and 5-ary tuples in Bij Simon Cruanes 2013-05-15 16:41:32 +02:00
9d1843ecf8 Bij.{guard,fix} helpers Simon Cruanes 2013-05-15 15:11:54 +02:00
9774added9 small update of the makefile Simon Cruanes 2013-05-15 13:42:20 +02:00
1fa268138e another test, using more Bij features Simon Cruanes 2013-05-15 12:29:45 +02:00
5701df09ad more tests for Bij, using random structures Simon Cruanes 2013-05-15 12:22:19 +02:00
98ce2aa394 removed the useless argument of Bij.BranchTo Simon Cruanes 2013-05-15 12:09:29 +02:00
fb04d0e1c5 better, although more complicated, system for switch Simon Cruanes 2013-05-15 12:05:02 +02:00
1e72332ac6 easier to use interface for Bij.Sexpr Simon Cruanes 2013-05-15 11:23:32 +02:00
a570a34951 modules everywhere for sources, sinks, encoders, decoders...; more primitives in Sink; direct access to eof/cur/junk in Source Simon Cruanes 2013-05-15 11:12:53 +02:00
a41baa1174 Bij.decode starts to work; more thorough tests (for big int lists) Simon Cruanes 2013-05-15 10:31:12 +02:00
7628ed9954 build lib when tests are built Simon Cruanes 2013-05-15 10:27:21 +02:00
20097ddae3 Bij module, a try at the serialization problem using GADT Simon Cruanes 2013-05-14 18:32:23 +02:00
d7b3f45f3c functorial version of SplayMap Simon Cruanes 2013-05-01 17:21:09 +02:00
6118e61edc update of containers.mllib to include SplayMap; update of README; SplayMap.iter/fold now traverse in ascending order Simon Cruanes 2013-04-24 10:04:47 +02:00
6c1f7fb950 functional SplayTree as Maps Simon Cruanes 2013-04-24 00:32:04 +02:00
d0bb88e365 minor update of Leftistheap Simon Cruanes 2013-04-24 00:31:47 +02:00
b6212bea7c leftistheap Simon Cruanes 2013-04-23 20:27:33 +02:00
32985129e0 update of Vector, with more functions (length, rev, append_seq...) and better performance (using unsafe_set/unsafe_get in Array) Simon Cruanes 2013-04-22 18:32:23 +02:00
7a0605d96f added CC (congruence closure with curryfied terms); added Puf (persistent Union-Find, used in CC); added their unit tests Simon Cruanes 2013-04-17 15:43:19 +02:00
dd434c9ef7 forgot the case for strings Simon Cruanes 2013-04-12 18:19:55 +02:00
5ddff35b8d basic json parser/printer using Genlex Simon Cruanes 2013-04-12 18:12:33 +02:00
62248928b2 small changes Simon Cruanes 2013-04-05 17:34:06 +02:00
66f5a97f92 added arrays to benchs; updated README Simon Cruanes 2013-04-05 17:19:47 +02:00
e924d0639a changed the benchmarks for hashtables Simon Cruanes 2013-04-05 16:58:29 +02:00
1e35fc7ecb doc for infix functions of Gen Simon Cruanes 2013-04-03 00:14:48 +02:00
92a04ac727 more doc for Gen Simon Cruanes 2013-04-03 00:12:37 +02:00
85b3ca233b target for documentation of some modules Simon Cruanes 2013-04-03 00:01:52 +02:00
0a58a380d8 added Gen.compare and Gen.eq functions Simon Cruanes 2013-04-02 23:48:51 +02:00
41fc94afe6 example updated Simon Cruanes 2013-03-31 22:46:14 +02:00
1644640075 LazyGraph.limit_depth implemented Simon Cruanes 2013-03-31 22:23:26 +02:00
ffbe617c86 LazyGraph.is_dag_full, with several starting vertices Simon Cruanes 2013-03-31 21:28:40 +02:00
856eacb8fc flatMap for LazyGraph.t! hey, why not? Simon Cruanes 2013-03-31 21:14:01 +02:00
3c572559b7 play with the crawler! Simon Cruanes 2013-03-30 15:04:20 +01:00
c582e18cfa more robust crawler Simon Cruanes 2013-03-30 14:53:13 +01:00
a5d9a39afd example using LazyGraph and Futures to search a path between two urls Simon Cruanes 2013-03-30 14:41:07 +01:00
69d75de295 additional handler for LazyGraph algorithms that search for paths Simon Cruanes 2013-03-30 14:40:44 +01:00
ddd3175185 LazyGraph: - Dijkstra and A* algorithms implemented, for minimal path search; - is_dag predicate for finite graphs; - simple "heap_graph" example (i -> 2*i,2*i+1) Simon Cruanes 2013-03-30 13:21:01 +01:00
fe0b4d653f removed some non implemented functions from LazyGraph Simon Cruanes 2013-03-29 23:19:10 +01:00
974df85321 cleanup of LazyGraph Simon Cruanes 2013-03-29 23:16:17 +01:00
5553ed4699 updated benchs with persistentHashtbl Simon Cruanes 2013-03-27 21:47:24 +01:00
a82ebf7d59 added PersistentHashtbl, adapted from persistent arrays of J-C Filliatre Simon Cruanes 2013-03-26 17:23:19 +01:00
f992f279bc Gen.lexico for lexicographic comparison Simon Cruanes 2013-03-25 14:37:27 +01:00
bc38851de6 added a test for Future.Timer Simon Cruanes 2013-03-24 20:27:27 +01:00
8be147c50b added a timer in Future Simon Cruanes 2013-03-24 19:21:43 +01:00
d74808efe0 small api change in future Simon Cruanes 2013-03-24 17:57:02 +01:00
b4e07e07d2 benchmark SkipList with hashtables Simon Cruanes 2013-03-23 01:45:54 +01:00
9788d108e3 faster SkipList.find Simon Cruanes 2013-03-23 01:45:46 +01:00
6f455c7cb1 skipList module Simon Cruanes 2013-03-23 01:00:02 +01:00
3da4f75487 correct comments for ocamldoc Simon Cruanes 2013-03-22 17:42:09 +01:00
a9cdce9424 Gen.intersection, to intersect 2 sorted generators Simon Cruanes 2013-03-22 09:53:54 +01:00
09817b236a update of Bench Simon Cruanes 2013-03-21 18:55:12 +01:00
0af36e124e added repeatedly, rand_int, of_array and to_array to Gen Simon Cruanes 2013-03-21 18:06:00 +01:00
6ba411d7f5 lower level pp function Simon Cruanes 2013-03-21 17:51:44 +01:00
7ed1bced9d forgot to update examples/ Simon Cruanes 2013-03-21 17:35:23 +01:00
2033f07aff renamed Enum into Gen (for "generator"), and updated code and test to reflect so Simon Cruanes 2013-03-21 17:25:02 +01:00
dfbce71324 Enum.reduce Simon Cruanes 2013-03-21 17:19:50 +01:00
ebbf4a9138 more explanations about merge Simon Cruanes 2013-03-21 17:14:15 +01:00
6a918a95dc binary sorted_merge Simon Cruanes 2013-03-21 17:11:04 +01:00
a49b37dbdb added infix operators in the module Simon Cruanes 2013-03-21 17:03:14 +01:00
13fd7da142 added a lot of operations on Enum, including sort, uniq, for_all, exists, mem, min, max, group, unzip, unfold, scan Simon Cruanes 2013-03-21 16:48:46 +01:00