bitcoinleveldb-test 0.1.16-alpha.0

compaction and corruption tests to be run on a leveldb instance
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106

/*!
  | Test for issue 178: a manual compaction
  | causes deleted data to reappear.
  |
  */

crate::ix!();



//-------------------------------------------[.cpp/bitcoin/src/leveldb/issues/issue178_test.cc]

const NUM_KEYS: i32 = 1100000;

fn key1(i: i32) -> String {
    
    todo!();
        /*
            char buf[100];
      snprintf(buf, sizeof(buf), "my_key_%d", i);
      return buf;
        */
}

fn key2(i: i32) -> String {
    
    todo!();
        /*
            return Key1(i) + "_xxx";
        */
}

struct Issue178 {}

#[test] fn issue178_test() {
    todo!();
    /*
    
      // Get rid of any state from an old run.
      std::string dbpath = leveldb::test::TmpDir() + "/leveldb_cbug_test";
      DestroyDB(dbpath, leveldb::Options());

      // Open database.  Disable compression since it affects the creation
      // of layers and the code below is trying to test against a very
      // specific scenario.
      leveldb::DB* db;
      leveldb::Options db_options;
      db_options.create_if_missing = true;
      db_options.compression = leveldb::kNoCompression;
      ASSERT_OK(leveldb::DB::Open(db_options, dbpath, &db));

      // create first key range
      leveldb::WriteBatch batch;
      for (size_t i = 0; i < kNumKeys; i++) {
        batch.Put(Key1(i), "value for range 1 key");
      }
      ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));

      // create second key range
      batch.Clear();
      for (size_t i = 0; i < kNumKeys; i++) {
        batch.Put(Key2(i), "value for range 2 key");
      }
      ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));

      // delete second key range
      batch.Clear();
      for (size_t i = 0; i < kNumKeys; i++) {
        batch.Delete(Key2(i));
      }
      ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));

      // compact database
      std::string start_key = Key1(0);
      std::string end_key = Key1(kNumKeys - 1);
      leveldb::Slice least(start_key.data(), start_key.size());
      leveldb::Slice greatest(end_key.data(), end_key.size());

      // commenting out the line below causes the example to work correctly
      db->CompactRange(&least, &greatest);

      // count the keys
      leveldb::Iterator* iter = db->NewIterator(leveldb::ReadOptions());
      size_t num_keys = 0;
      for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
        num_keys++;
      }
      delete iter;
      ASSERT_EQ(kNumKeys, num_keys) << "Bad number of keys";

      // close database
      delete db;
      DestroyDB(dbpath, leveldb::Options());

    */
}

fn issuesissue178_test_main (
        argc: i32,
        argv: *mut *mut u8) -> i32 {
    
    todo!();
        /*
            return leveldb::test::RunAllTests();
        */
}