Ohloh by Black Duck

 Follow @ Meta   Join Now

 Settings |  Report Duplicate
Activity Not Available
0

News

  Analyzed 8 months ago based on code collected 8 months ago.
 
Clean up uses of mowgli_dictionary inside Mowgli.
Posted over 2 years ago by William Pitcock
Clean up uses of mowgli_dictionary inside Mowgli.
Deprecation notice for mowgli_dictionary.
Posted over 2 years ago by William Pitcock
Deprecation notice for mowgli_dictionary.
Add an extra test program for mowgli_patricia.
Posted over 2 years ago by Jilles Tjoelker
Add an extra test program for mowgli_patricia.

This test program adds 10000 random strings, removes 5000,
tries to add them again, then removes all. Heavy consistency
checking is performed during all of this.
mowgli.heap: memset the data back to zero when we return it to the heap.
Posted over 2 years ago by William Pitcock
mowgli.heap: memset the data back to zero when we return it to the heap.
Fix corruption in mowgli_patricia after deleting nodes.
Posted over 2 years ago by Jilles Tjoelker
Fix corruption in mowgli_patricia after deleting nodes.

mowgli_heap_alloc() does not memset reused storage and
mowgli_patricia failed to take this into account.
Fix this by setting all the storage to defined values
in mowgli_patricia.
Add MSVC versions.
Posted over 2 years ago by William Pitcock
Add MSVC versions.
Add mowgli_soft_assert_log().
Posted over 2 years ago by William Pitcock
Add mowgli_soft_assert_log().
Rewrite mowgli_patricia to reduce cache misses.
Posted almost 3 years ago by Jilles Tjoelker
Rewrite mowgli_patricia to reduce cache misses.

Keys are now analyzed per group of 4 bits instead of
per bit, so each node access (possible cache miss)
processes up to 4 bits of key instead of just one.
Because the differing bits ... [More] may not be adjacent, the
branching factor may be less than 16, but it will be
at least 2. The worst case for the depth of the tree
is one fourth of that of the old code.

As a side effect, the upward links of the old version
are no longer possible and have been removed. There
are now distinct nodes and leaves, and there may be
many more leaves than nodes. This should make the code
easier to understand.

A parent pointer in each node and leaf has replaced the
linked list of all elements. This provides similar
functionality with one less pointer and better
integration with the tree.

As a side effect, the iterators now return the elements
in order.

The new code is believed to be ABI and API compatible
with the old code. In fact, mowgli_patricia.h has not
changed at all. [Less]
Make patriciatest more useful.
Posted almost 3 years ago by Jilles Tjoelker
Make patriciatest more useful.
Added tag libmowgli-0.7.1 for changeset 4deb7f2c9407
Posted almost 3 years ago by Jilles Tjoelker
Added tag libmowgli-0.7.1 for changeset 4deb7f2c9407
 

 
 

Project Summary

Code Data

SCM Data

Community Data

 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.