Commits

Branch selector

 master

User selector

All users

All time

Commit History

Commits on Nov 21, 2013

• Add test to verify that insert() returns whether the key is a new key or not

  smvv

  committed
  d408ff7

  Copy full SHA for d408ff7

• Reset keys list when the btree is cleared

  smvv

  committed
  145f75a

  Copy full SHA for 145f75a

• Build btree binary for testing purposes and ignore btree_bench in git

  smvv

  committed
  431d5ee

  Copy full SHA for 431d5ee

• Make btree compatible with Rust version 0.9pre

  smvv

  committed
  df51515

  Copy full SHA for df51515

Commits on Nov 18, 2013

• Add link name and 'docs' Make target

  smvv

  committed
  5ec18c9

  Copy full SHA for 5ec18c9

Commits on Nov 17, 2013

• Make btree compatible with rustc version 0.9pre

  smvv

  committed
  f72588a

  Copy full SHA for f72588a

Commits on Jul 27, 2013

• Add a random-insertion benchmark

  smvv

  committed
  39e2597

  Copy full SHA for 39e2597

Commits on Jul 25, 2013

• Use iterative instead of recursive tree traversal

  smvv

  committed
  1a34f1b

  Copy full SHA for 1a34f1b

• Use stem of a library. Otherwise, Rust will use 'liblibXXX' as library name

  smvv

  committed
  2c2d53e

  Copy full SHA for 2c2d53e

Commits on Jul 23, 2013

• Add some code comments and code cleanup

  smvv

  committed
  eecbc10

  Copy full SHA for eecbc10

• Add disabled code for finding node positions with binary search on keys

  smvv

  committed
  2482bdf

  Copy full SHA for 2482bdf

• Remove commented debug statements

  smvv

  committed
  bde8d2c

  Copy full SHA for bde8d2c

• Remove unused ToStr trait from trait parameter K

  smvv

  committed
  7e0cabb

  Copy full SHA for 7e0cabb

Commits on Jul 22, 2013

• B-tree insertion succeeds for 100,000 random uints (but fails for duplicated ones!)

  smvv

  committed
  c99a13e

  Copy full SHA for c99a13e

Commits on Jul 14, 2013

• TODO: When a node splits into two distinct nodes, the two nodes have to be inserted into the parent

  smvv

  committed
  9b114a0

  Copy full SHA for 9b114a0

Commits on Jul 12, 2013

• Use tree.capacity() instead of constant

  smvv

  committed
  c982c95

  Copy full SHA for c982c95

• Use tree.capacity() instead of constant

  smvv

  committed
  6e9d4e2

  Copy full SHA for 6e9d4e2

• Re-order implementations: move less important things to the bottom

  smvv

  committed
  8ad3b2f

  Copy full SHA for 8ad3b2f

• Separate keys from values in the b-tree nodes (splitting does not work yet)

  smvv

  committed
  1a3adf5

  Copy full SHA for 1a3adf5

• Add basic node splitting, but oes not properly rebalance the tree (WIP)

  smvv

  committed
  bfc4a87

  Copy full SHA for bfc4a87

• Remove redundant traits, add to_str() and simplify clear()

  smvv

  committed
  be56709

  Copy full SHA for be56709

• Remove unused reference to `key'

  smvv

  committed
  4dbe92a

  Copy full SHA for 4dbe92a

• Remove redundant key comparisons

  smvv

  committed
  85fb374

  Copy full SHA for 85fb374

• Re-implement method `find' using iterators

  smvv

  committed
  c0c8046

  Copy full SHA for c0c8046

• Only move the used instead of all items on position to the right

  smvv

  committed
  551a7a1

  Copy full SHA for 551a7a1

Commits on Jul 11, 2013

• Rewrote `insert' using iterators for simplification.

  smvv

  committed
  39880ad

  Copy full SHA for 39880ad

Commits on Jul 10, 2013

• Add test to make sure that find() after clear() returns None

  smvv

  committed
  cc7d8f1

  Copy full SHA for cc7d8f1

• Beginning of the b-tree implementation (work-in-progress)

  smvv

  committed
  3fc7f53

  Copy full SHA for 3fc7f53