Joe Thornber cf903cfea6 [btree] lower bound search should return an empty optional if every entry in the node is higher. ...

Patch from Ming-Hung Tsai

2015-05-26 14:09:29 +01:00

..

array_block.h

start removing block_manager<>::block

2014-07-25 14:46:51 +01:00

array.h

Merge branch 'master' into space-map-checking

2015-04-07 12:18:23 +01:00

bitset.cc

[bitset] When reopening a bitset some bits could be lost at the far end.

2014-09-01 14:17:44 +01:00

bitset.h

[everything] Fix circular shared pointer references.

2014-08-26 11:14:49 +01:00

bloom_filter.cc

Fix this error:

2015-01-16 10:15:01 +00:00

bloom_filter.h

[everything] Fix circular shared pointer references.

2014-08-26 11:14:49 +01:00

btree_counter.h

put space map checking back in

2014-02-19 16:08:05 +00:00

btree_damage_visitor.cc

Forgot to commit btree_damage_checker.cc

2013-05-21 11:45:10 +01:00

btree_damage_visitor.h

[damage_tracker] Reset the tracker in the end() method so we can reuse it.

2015-05-26 12:49:27 +01:00

btree.cc

[btree] use a block_ref_counter for internal nodes

2013-06-20 14:29:48 +01:00

btree.h

[btree_damage_visitor] Check the value_size agrees.

2015-05-26 12:06:34 +01:00

btree.tcc

[btree] lower bound search should return an empty optional if every entry in the node is higher.

2015-05-26 14:09:29 +01:00

ref_counter.h

superblock_checker.* -> superblock.*, remove metadata_disk_structures.* and rearrange namespaces a bit.

2013-05-21 12:46:07 +01:00

simple_traits.h

era_check, era_dump

2014-01-23 00:46:03 +00:00