simon/ocaml-containers
1
0
Fork 0
mirror of https://github.com/c-cube/ocaml-containers.git synced 2025-12-14 06:46:07 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Commit graph

  • 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
  • 0694064ef5 mutable structure to build LazyGraph on top Simon Cruanes 2013-03-21 13:53:51 +01:00
  • c248c9b677 added some benchs of Sequence vs Enum Simon Cruanes 2013-03-21 12:35:22 +01:00
  • 1c1d602ca7 improvements in Enum (should be more efficient) Simon Cruanes 2013-03-21 12:25:14 +01:00
  • 9cd07d3395 examples graphs; small program that computes the collatz suite Simon Cruanes 2013-03-21 12:25:03 +01:00
  • e0b6b8be5b LazyGraph is now fully polymorphic (plan to implement LazyGraph.product, which cannot be expressed with functors), with optional eq/hash functions Simon Cruanes 2013-03-21 11:22:41 +01:00
  • e6eb9a79eb expose an optional Pool argument in most Future\'s combinators; handlers of a future are scheduled in pool rather than sequentially (to avoid possible deadlocks among them) Simon Cruanes 2013-03-21 10:15:35 +01:00
  • 08d33095f6 Future.sleep should take a float Simon Cruanes 2013-03-20 18:06:50 +01:00
  • 170c1031a9 some basic tests for Future Simon Cruanes 2013-03-20 18:04:04 +01:00
  • 174f10e4f2 update of the thread pool. It is growable, up to a certain limit, and threads are cached; idle threads are killed after some (soft) time limit; Simon Cruanes 2013-03-20 17:53:49 +01:00
  • 43f926dcb3 copied Heap into Enum for implementing merge_sorted; test merge_sorted Simon Cruanes 2013-03-20 16:09:55 +01:00
  • c1ad18407f fix in ocamlinit Simon Cruanes 2013-03-20 16:09:12 +01:00
  • 02481a9352 leaner Heap Simon Cruanes 2013-03-20 15:54:45 +01:00
  • 35aa6cb03a copied code of SplayTree into Heap, to reduce dependencies Simon Cruanes 2013-03-20 15:49:52 +01:00
  • 772e6e6844 renamed Futures into Future Simon Cruanes 2013-03-20 15:27:17 +01:00
  • fac35bf61c renamed some operations in Enum Simon Cruanes 2013-03-20 13:58:50 +01:00
  • fb75b7299b some functions of Enum are also available for Enum.Gen Simon Cruanes 2013-03-20 11:55:53 +01:00
  • 1d2e514d45 parametrize Futures.Pool with lifetime of transient threads; also give them time to process jobs by increasing max_load temporarily Simon Cruanes 2013-03-20 10:54:26 +01:00
  • e35f3c61dd circular list in examples/mem_size Simon Cruanes 2013-03-20 10:53:07 +01:00
  • 4839dd82ba example file, that uses LazyGraph to represent memory layout of values (and compute their size) Simon Cruanes 2013-03-20 10:32:11 +01:00
  • b9ddea21bd fix error in Makefile Simon Cruanes 2013-03-20 09:41:59 +01:00
  • 1445104e2b comprehensive BFS; implemented LazyGraph.Dot.pp (and pp_enum to have more control); LazyGraph.map and filter implemented too Simon Cruanes 2013-03-20 01:12:52 +01:00
  • 64a50fbedf pretty printing of an Enum Simon Cruanes 2013-03-20 01:10:36 +01:00
  • bd99d044f7 simpler and better interface for LazyGraph.Dot; LazyGraph.Full traversals start from an enum of vertices and not just one vertex Simon Cruanes 2013-03-20 00:16:53 +01:00
  • 5b4e205591 Enum.dup combinator Simon Cruanes 2013-03-19 23:59:07 +01:00
  • 025985b1df implementation of DFS Simon Cruanes 2013-03-19 23:29:07 +01:00
  • c72cc692a7 IntGraph provided as facility; BFS properly handles the optional start id Simon Cruanes 2013-03-19 21:45:05 +01:00
  • 5454f2dd32 BFS implemented Simon Cruanes 2013-03-19 21:32:49 +01:00
  • 9a66e90a02 bugfix in the scheduler Simon Cruanes 2013-03-19 18:09:56 +01:00
  • 81e7ee2c04 Futures.choose implemented Simon Cruanes 2013-03-19 17:18:16 +01:00
  • c8b7b7dfed added Futures.sleep function; Futures.MVar implemented; Futures.sequence implemented (quite subtle) Simon Cruanes 2013-03-19 17:12:26 +01:00
  • a4c8e3e408 close input of subprocess once stdin has been sent to it Simon Cruanes 2013-03-19 16:21:23 +01:00
  • 9708c4b01c Futures.MVar module (not implemented) for sharing values; handlers to attach on a future to react upon failure/success/termination; Futures.map implemented using handlers, flatMap also uses handlers (more lightweight); growable thread pool (transient threads are added when the number of waiting jobs is too high) Simon Cruanes 2013-03-19 16:11:38 +01:00
  • 23029332df added Futures.is_done function; .ocamlinit file to import stuff in the toplevel Simon Cruanes 2013-03-19 15:10:41 +01:00
  • 579746810e modified build system and other data for threading support Simon Cruanes 2013-03-19 15:04:42 +01:00
  • 41274c309e implementation of Futures Simon Cruanes 2013-03-19 15:04:18 +01:00
  • 205d47e81d interface for preemptive threading Futures Simon Cruanes 2013-03-19 14:35:19 +01:00
  • 21f499a5f5 fixed absurd comment; better product implementation (in case outer is big and outer is empty) Simon Cruanes 2013-03-19 13:43:02 +01:00
  • db302adab2 one more signature to be implemented later Simon Cruanes 2013-03-19 12:13:46 +01:00
  • e83298ef24 moved generator functions into Enum.Gen Simon Cruanes 2013-03-19 11:44:48 +01:00
  • 4d293209a5 more tests for Enum Simon Cruanes 2013-03-19 11:35:48 +01:00
  • 96d3c7e8b7 added a bunch of combinators for Enum, some of them quite advanced. A few are not yet implemented. Simon Cruanes 2013-03-19 11:25:26 +01:00
  • ca5336dfb0 more tests for Enum Simon Cruanes 2013-03-19 00:48:11 +01:00
  • 101fc8a01e potential bugfix for Enum.to_rev_list Simon Cruanes 2013-03-19 00:35:54 +01:00
  • a3c7b70e53 stubs for LazyGraph functions; added LazyGraph to containers.mllib Simon Cruanes 2013-03-19 00:32:37 +01:00
  • f3206ca019 |> combinator for Enum Simon Cruanes 2013-03-19 00:24:12 +01:00
  • 135989d55f Enum.take and Enum.drop Simon Cruanes 2013-03-19 00:22:41 +01:00
  • a3182f131b start testing of Enum Simon Cruanes 2013-03-18 23:59:52 +01:00
  • 81e30d76bf Enum.Infix with some basic infix operators; fixed bugs in Enum Simon Cruanes 2013-03-18 23:59:30 +01:00
  • a378af8a8e append, flatMap and flatten in Enum Simon Cruanes 2013-03-18 23:42:29 +01:00
  • 5d289098b0 basic functions in Enum Simon Cruanes 2013-03-18 23:23:13 +01:00
  • 3da9444cd8 signature for a Lazy Graph Simon Cruanes 2013-03-18 23:13:17 +01:00
  • 8efc421650 draft of Enum type (restartable generator a la Batteries) Simon Cruanes 2013-03-18 23:12:57 +01:00
  • 7360834241 force Vector's initial size to be >= 3 Simon Cruanes 2013-03-17 18:45:53 +01:00
  • 3b6722d1c4 small updates of Vector; removed the capacity field in Vector Simon Cruanes 2013-03-17 18:43:46 +01:00
  • ef08010c6f renamed tests/tests.ml into tests/run_tests.ml; added some tests for Vector; added Sequence functions to Vector Simon Cruanes 2013-03-17 18:36:51 +01:00
  • 9d556cb106 update of README and .mllib 0.1.1 Simon Cruanes 2013-03-14 14:45:33 +01:00
  • 707d29210f cleanrer interface for Univ Simon Cruanes 2013-03-14 14:43:08 +01:00
  • bf777e3d28 tags Simon Cruanes 2013-03-14 14:42:53 +01:00
  • 924fc1b970 rewrote Deque to be safe (no Obj anymore); more functions in Deque, especially w.r.t. Sequence; unit tests for Deque Simon Cruanes 2013-03-14 14:14:13 +01:00
  • 68dfbea2a0 add hashset to containers Simon Cruanes 2013-03-14 14:13:45 +01:00
  • dabc9df46e added a is_empty function for FHashtbl; more tests for FHashtbl Simon Cruanes 2013-03-10 15:04:38 +01:00
  • a688d5dbc0 forgot fHashtbl in containers.mllib Simon Cruanes 2013-03-10 15:04:16 +01:00
  • 79942515cd added a functional Queue implementation Simon Cruanes 2013-03-09 20:35:45 +01:00
  • a04e252d2c a bugfix in Sequence.product; changed default block size of MList Simon Cruanes 2013-03-08 16:04:16 +01:00
  • 732cc90ea6 updated sequence files Simon Cruanes 2013-03-08 14:18:54 +01:00
  • d00144375b do not assume too much on initial size Simon Cruanes 2013-03-07 19:10:57 +01:00
  • 7d96c9092a deletion for FHashtbl.Tree implemented Simon Cruanes 2013-03-07 18:22:42 +01:00
  • f561e7af7c changed interface of Cache.S.with_cache_rec Simon Cruanes 2013-03-07 18:12:35 +01:00
  • 14ca51db92 bugfix: Graph.is_dag must explore every vertex Simon Cruanes 2013-03-07 16:55:50 +01:00
  • 246f2949ea tests and benchmark for the functional hashtables Simon Cruanes 2013-03-07 16:19:22 +01:00
  • b5a9ae03e7 fixed stupid bug in FHashble.Flat Simon Cruanes 2013-03-07 16:12:53 +01:00
  • 0320630b2d flat implementation of the persistent hashtable Simon Cruanes 2013-03-07 16:07:01 +01:00
  • 6b314e4b37 added FHashtbl to benchmarks Simon Cruanes 2013-03-07 15:01:10 +01:00
  • bba6da0bde more tests for FHashtbl Simon Cruanes 2013-03-07 14:50:20 +01:00
  • 40dcbd5224 more elaborate insertion in FHashtbl (increase size of deeper hashtables); fixed a stupid bug in the insertion; FHashtbl.mem function Simon Cruanes 2013-03-07 14:50:10 +01:00
  • 5c6d9d94f2 more tests for FHashtbl Simon Cruanes 2013-03-07 13:51:36 +01:00