summaryrefslogtreecommitdiff
AgeCommit message (Expand)AuthorFilesLines
2011-01-02Release version 0.15.version_0_15Lars Wirzenius3-1/+18
2011-01-02Update debian/changelog.Lars Wirzenius1-0/+7
2011-01-02Bump version number.Lars Wirzenius1-1/+1
2011-01-02Update NEWS for release.Lars Wirzenius1-0/+10
2010-12-30Replace bsearch with bisect.Lars Wirzenius17-417/+305
2010-12-30Remove now-unused exclude= option from Node.keys().Lars Wirzenius2-8/+2
2010-12-30Further code reduction in the name of speed.Lars Wirzenius1-5/+5
2010-12-30Remove useless test for non-Noneness.Lars Wirzenius1-1/+1
2010-12-30Change LeafNode.find_pairs into find_keys_in_range.Lars Wirzenius3-22/+19
2010-12-30Change NodeCodex.leaf_size and index_size to take separate keys and values li...Lars Wirzenius4-14/+13
2010-12-30Change BTree.new_leaf, new_index, new_root to take keys and values as separat...Lars Wirzenius4-37/+35
2010-12-30Get rid of Node.pairs() method.Lars Wirzenius8-72/+81
2010-12-30Change Nodes to get keys and values as separate lists.Lars Wirzenius9-78/+97
2010-12-30Use values() method, not pairs().Lars Wirzenius1-1/+1
2010-12-30Use keys and values lists internally in Node.Lars Wirzenius1-27/+36
2010-12-30Remove bsearch.Lars Wirzenius4-138/+0
2010-12-30Rewrite IndexNode.find_children_in_range using Node.find_potential_range.Lars Wirzenius1-15/+3
2010-12-30Rewrite IndexNode.find_key_for_child_containing using bisect.Lars Wirzenius2-7/+24
2010-12-30Rewrite LeafNode.find_pairs using bisect.Lars Wirzenius1-10/+5
2010-12-30Rewrite Node.remove using bisect.Lars Wirzenius1-6/+4
2010-12-30Rewrite Node.add using bisect.Lars Wirzenius1-9/+5
2010-12-30Remove useless "else: pass".Lars Wirzenius1-2/+0
2010-12-30Refactor find_potential_range to remove duplicated code.Lars Wirzenius1-31/+20
2010-12-30Rewrite find_potential_range using bisect.Lars Wirzenius1-17/+34
2010-12-30Replace bsearch with bisect in _add_or_merge.Lars Wirzenius1-5/+8
2010-12-29Prepare release 0.14.version_0_14Lars Wirzenius4-4/+82
2010-12-29Remove now-useless bug triggering script.Lars Wirzenius1-112/+0
2010-12-29Update README.Lars Wirzenius1-19/+38
2010-12-28Fix remove_range (but make it slow).Lars Wirzenius5-87/+196
2010-12-28Go back to a simplistic remove_range implementation.Lars Wirzenius2-60/+3
2010-12-28Add logging to range removal.Lars Wirzenius1-1/+23
2010-12-28Use same RNG seed on every run.Lars Wirzenius1-0/+2
2010-12-28Move find_pairs to LeafNode.Lars Wirzenius1-20/+17
2010-12-28Simplify _remove_range_from_index by using find_potential_range.Lars Wirzenius1-36/+4
2010-12-28Add Node.find_potential_range method.Lars Wirzenius2-0/+74
2010-12-28Simplify _remove_range_from_leaf by using Node.find_pairs.Lars Wirzenius1-9/+2
2010-12-28Further simplify trigger-bugLars Wirzenius1-15/+1
2010-12-28merge from trunkLars Wirzenius5-20/+31
2010-12-28Simplify trigger-bug further.Lars Wirzenius1-6/+2
2010-12-28Simplified version of speed-test, to trigger bug faster.Lars Wirzenius1-0/+128
2010-12-27Fix remove_tree so it removes tree nodes.Lars Wirzenius2-0/+9
2010-12-27Remove nodes for a tree.Lars Wirzenius1-0/+1
2010-12-27Write test to verify remove_tree removes nodes for a tree as well.Lars Wirzenius1-0/+8
2010-12-27Turn lookup_range into a generator.Lars Wirzenius3-20/+22
2010-12-27Implement lookup iteratively.Lars Wirzenius2-10/+13
2010-12-27Rewrite lookup iteratively.Lars Wirzenius2-10/+13
2010-12-27Implement range_is_empty.Lars Wirzenius2-0/+108
2010-12-27Implement range_is_empty.Lars Wirzenius2-29/+17
2010-12-27Write tests for new range_is_empty method.Lars Wirzenius2-0/+120
2010-12-27Rewrite UploadQueue in terms of LRUCache.Lars Wirzenius3-44/+20
generated by cgit v1.2.1 (git 2.18.0) at 2024-05-15 19:04:02 +0000