| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | lib/pure/a-c - Dropped 'T' from types | pdw | 2015-06-04 | 1 | -36/+36 |
| | | |||||
| * | Add contains proc for tables to allow usage of `in` | Jonathan | 2015-05-05 | 1 | -0/+24 |
| | | |||||
| * | fixes #2625 | Araq | 2015-05-03 | 1 | -4/+7 |
| | | |||||
| * | Merge pull request #2411 from reactormonk/merge-counttables | Andreas Rumpf | 2015-04-21 | 1 | -0/+61 |
| |\ | | | | | merge for CountTable, see #1680 | ||||
| | * | doc comments for merge | Simon Hafner | 2015-03-26 | 1 | -0/+3 |
| | | | |||||
| | * | merge for CountTable, see #1680 | Simon Hafner | 2015-03-26 | 1 | -0/+58 |
| | | | |||||
| * | | Use more Natural and Positive numbers in proc parameters | def | 2015-04-06 | 1 | -1/+1 |
| |/ | | | | | - Didn't go through all modules, only the main ones I thought of - Building the compiler and tests still work | ||||
| * | prepare for upcoming parsing change of unary operators | Araq | 2015-03-22 | 1 | -10/+10 |
| | | |||||
| * | Making tuples anonymous (so far... not finished). | Hans Raaf | 2015-03-17 | 1 | -23/+22 |
| | | |||||
| * | Fixed table getter not compiling when table value type had not '$' proc ↵ | krolik | 2015-03-05 | 1 | -1/+5 |
| | | | | | overriden | ||||
| * | Fix unknown symbol in tables mpairs iterator. | Hans Raaf | 2015-02-21 | 1 | -1/+1 |
| | | | | | Fixes an error with mpairs iterator which was introduced with 5fbcf93860. This is used by nimforum thats why I found it. I also added a testcase for the mpairs iterator. | ||||
| * | Merge ../Nim into devel | Charles Blake | 2015-02-16 | 1 | -1/+1 |
| |\ | |||||
| | * | Fix typos | Federico Ceratto | 2015-02-15 | 1 | -1/+1 |
| | | | |||||
| * | | Add comments explaining odd looking i<0..data[i]. | Charles Blake | 2015-02-16 | 1 | -3/+3 |
| | | | |||||
| * | | Just do wide interface of hasKeyOrPut & mgetOrPut. | Charles Blake | 2015-02-16 | 1 | -36/+55 |
| | | | | | | | | | | | | | | | Extract maybe re-hash/re-search and insert logic into a new template. Use this new template to do impl templates for all three put forms (which required renaming a couple 'value' arguments to 'val'). Added OrderedTable and OrderedTableRef versions of both as well. | ||||
| * | | Add TableRef version of mgetOrPut. | Charles Blake | 2015-02-16 | 1 | -0/+5 |
| | | | |||||
| * | | Add mgetOrPut to support just one probe chase for the common | Charles Blake | 2015-02-15 | 1 | -0/+14 |
| |/ | | | | pattern of either updating or initializing table entries. | ||||
| * | assignment -> shallowCopy for efficiency. | Charles Blake | 2015-02-13 | 1 | -1/+1 |
| | | |||||
| * | Merge ../Nim into devel; track ttables.nim delete. | Charles Blake | 2015-02-13 | 1 | -1/+1 |
| |\ | |||||
| | * | fixed minor bugs; cleaned up tests | Araq | 2015-02-12 | 1 | -1/+1 |
| | | | |||||
| * | | Update doc comments to mention rightSize. | Charles Blake | 2015-02-13 | 1 | -4/+4 |
| | | | |||||
| * | | Oops - missed updates to a few later rawGet()s. | Charles Blake | 2015-02-12 | 1 | -4/+8 |
| | | | |||||
| * | | Add hcode,rightSize,rawGetKnownHC. Fix inf loop. | Charles Blake | 2015-02-12 | 1 | -60/+140 |
| |/ | | | | | | | | | | | | | | | | | | | | | | Make similar changes to those made in sets.nim, including hcode, rightSize rawGet/rawGetKnownHC result protocol, nextTry probe sequence to be the cache friendlier h=h+1 which in turn allows supporting changing deletion to fix the infinite loop bug with local rehashing which in turn has desirable properties of graceful table aging when deletes do happen and also making insert-only usage patterns no longer pay any time/space cost to check deleted status. Unlike collections.sets, this module has add() for duplicate key inserts and a 3rd type of table, CountTable. The first wrinkle is handled by introducing a rawGetDeep for unconditionally adding entries along collision chains. This point of CountTable seems to be space efficiency at 2 items per slot. These changes retain that by keeping the val==0 => EMPTY rule and not caching hash codes. putImpl is expanded in-place for CountTable since the new putImpl() is too different. { Depending on table size relative to caches & key expense, regular Table[A,B] may become faster than CountTable, especially if the basic count update could be something like inc(mGetOrPut(t, key, 0)). } Unit tests pass, but in this module those are much more of just a demo than probing for bugs. Should exercise/test this a little more before merging. | ||||
| * | documented new C++ support | Araq | 2015-01-28 | 1 | -1/+2 |
| | | |||||
| * | Happy new year! | Guillaume Gelin | 2015-01-06 | 1 | -1/+1 |
| | | |||||
| * | better CSS; better docs for teh tables module | Araq | 2014-12-21 | 1 | -9/+18 |
| | | |||||
| * | big rename | Araq | 2014-08-28 | 1 | -108/+108 |
| | | |||||
| * | big rename | Araq | 2014-08-28 | 1 | -2/+2 |
| | | |||||
| * | big rename | Araq | 2014-08-27 | 1 | -19/+25 |
| | | |||||
| * | renamefest | Araq | 2014-08-23 | 1 | -3/+3 |
| | | |||||
| * | Added stylistic consistancy. | Clay Sweetser | 2014-07-24 | 1 | -1/+1 |
| | | |||||
| * | Fixed `==` for PTables, added test. | Felix Krause | 2014-06-27 | 1 | -2/+5 |
| | | |||||
| * | Merge pull request #1251 from gradha/pr_misc_docs | Andreas Rumpf | 2014-06-12 | 1 | -2/+4 |
| |\ | | | | | Misc docs suggestions | ||||
| | * | Revert "Adds to tables module example of reference type vs value type." | Grzegorz Adam Hankiewicz | 2014-06-10 | 1 | -32/+2 |
| | | | | | | | | | This reverts commit bde9d1ac0753e46c726dc63930539bb82d09f19d. | ||||
| | * | Adds to tables module example of reference type vs value type. | Grzegorz Adam Hankiewicz | 2014-06-06 | 1 | -2/+32 |
| | | | |||||
| | * | Avoids temporal string in tables hashing example. | Grzegorz Adam Hankiewicz | 2014-06-06 | 1 | -2/+4 |
| | | | |||||
| * | | added allValues iterator | Araq | 2014-06-12 | 1 | -2/+9 |
| |/ | |||||
| * | Added support for ref type hash tables. | Reimer Behrends | 2014-05-04 | 1 | -1/+266 |
| | | | | | | | This reuses the hash table implementation for objects (and the associated tests). For efficiency reasons, iterator implementations are currently adapted rather than calling the TTable code. | ||||
| * | Adds example of custom object types used as table key. | Grzegorz Adam Hankiewicz | 2014-04-22 | 1 | -0/+68 |
| | | |||||
| * | Fixes collections/ttables. | Dominik Picheta | 2014-04-18 | 1 | -1/+1 |
| | | |||||
| * | fixes '==' for TTTable | Andreas Rumpf | 2014-04-13 | 1 | -1/+1 |
| | | |||||
| * | fixes '==' for TTTable | Andreas Rumpf | 2014-04-13 | 1 | -1/+7 |
| | | |||||
| * | indexBy, which indexes a collection into a hashtable | Simon Hafner | 2014-02-06 | 1 | -0/+10 |
| | | |||||
| * | better html generator for the tester; fixes some VM bugs | Araq | 2014-01-17 | 1 | -1/+1 |
| | | |||||
| * | case consistency part 4 | Araq | 2013-12-27 | 1 | -3/+3 |
| | | |||||
| * | case consistency part 1 | Araq | 2013-12-27 | 1 | -36/+36 |
| | | |||||
| * | Mentions nextPowerOfTwo proc for table initialization. | Grzegorz Adam Hankiewicz | 2013-03-17 | 1 | -6/+15 |
| | | |||||
| * | Removes executable bit for text files. | Grzegorz Adam Hankiewicz | 2013-03-16 | 1 | -0/+0 |
| | | |||||
| * | 'sort' for ordered tables | Araq | 2013-01-12 | 1 | -1/+47 |
| | | |||||
| * | 'importcpp' for the JS target to generate an infix call | Araq | 2013-01-11 | 1 | -1/+1 |
| | | |||||