20 for (
int i = 0; i < files_.size(); i++) {
25 void Add(
const char* smallest,
const char* largest,
29 f->
number = files_.size() + 1;
35 int Find(
const char* key) {
41 bool Overlaps(
const char* smallest,
const char* largest) {
43 Slice s(smallest != NULL ? smallest :
"");
44 Slice l(largest != NULL ? largest :
"");
46 (smallest != NULL ? &s : NULL),
47 (largest != NULL ? &l : NULL));
149 Add(
"200",
"200", 5000, 3000);
160 disjoint_sorted_files_ =
false;
177 int main(
int argc,
char** argv) {
void Add(const char *smallest, const char *largest, SequenceNumber smallest_seq=100, SequenceNumber largest_seq=100)
bool Overlaps(const char *smallest, const char *largest)
bool SomeFileOverlapsRange(const InternalKeyComparator &icmp, bool disjoint_sorted_files, const std::vector< FileMetaData * > &files, const Slice *smallest_user_key, const Slice *largest_user_key)
std::vector< FileMetaData * > files_
TEST(CorruptionTest, Recovery)
const Comparator * BytewiseComparator()
int Find(const char *key)
int main(int argc, char **argv)
int FindFile(const InternalKeyComparator &icmp, const std::vector< FileMetaData * > &files, const Slice &key)
bool disjoint_sorted_files_