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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144

crate::ix!();

//-------------------------------------------[.cpp/bitcoin/src/leveldb/util/testutil.h]
//-------------------------------------------[.cpp/bitcoin/src/leveldb/util/testutil.cc]

/**
  | A wrapper that allows injection of errors.
  |
  */
pub struct ErrorEnv {
    base:                     EnvWrapper,
    writable_file_error:      bool,
    num_writable_file_errors: i32,
}

impl Default for ErrorEnv {
    
    fn default() -> Self {
        todo!();
        /*


            : EnvWrapper(NewMemEnv(Env::Default())),
            writable_file_error_(false),
            num_writable_file_errors_(0)
        */
    }
}

impl Drop for ErrorEnv {
    fn drop(&mut self) {
        todo!();
        /*
            delete target();
        */
    }
}

impl ErrorEnv {

    pub fn new_writable_file(&mut self, 
        fname:  &String,
        result: *mut *mut dyn WritableFile) -> crate::Status {
        
        todo!();
        /*
            if (writable_file_error_) {
          ++num_writable_file_errors_;
          *result = nullptr;
          return crate::Status::IOError(fname, "fake error");
        }
        return target()->NewWritableFile(fname, result);
        */
    }
    
    pub fn new_appendable_file(&mut self, 
        fname:  &String,
        result: *mut *mut dyn WritableFile) -> crate::Status {
        
        todo!();
        /*
            if (writable_file_error_) {
          ++num_writable_file_errors_;
          *result = nullptr;
          return crate::Status::IOError(fname, "fake error");
        }
        return target()->NewAppendableFile(fname, result);
        */
    }
}

/**
  | Store in *dst a random string of length
  | "len" and return a Slice that references
  | the generated data.
  |
  */
pub fn random_string(
        rnd: *mut Random,
        len: i32,
        dst: *mut String) -> Slice {
    
    todo!();
        /*
            dst->resize(len);
      for (int i = 0; i < len; i++) {
        (*dst)[i] = static_cast<char>(' ' + rnd->Uniform(95));  // ' ' .. '~'
      }
      return Slice(*dst);
        */
}

/**
  | Return a random key with the specified
  | length that may contain interesting
  | characters (e.g. \x00, \xff, etc.).
  |
  */
pub fn random_key(
        rnd: *mut Random,
        len: i32) -> String {
    
    todo!();
        /*
            // Make sure to generate a wide variety of characters so we
      // test the boundary conditions for short-key optimizations.
      static const char kTestChars[] = {'\0', '\1', 'a',    'b',    'c',
                                        'd',  'e',  '\xfd', '\xfe', '\xff'};
      std::string result;
      for (int i = 0; i < len; i++) {
        result += kTestChars[rnd->Uniform(sizeof(kTestChars))];
      }
      return result;
        */
}

/**
  | Store in *dst a string of length "len" that
  | will compress to "N*compressed_fraction" bytes
  | and return a Slice that references the
  | generated data.
  */
pub fn compressible_string(
        rnd:                 *mut Random,
        compressed_fraction: f64,
        len:                 usize,
        dst:                 *mut String) -> Slice {
    
    todo!();
        /*
            int raw = static_cast<int>(len * compressed_fraction);
      if (raw < 1) raw = 1;
      std::string raw_data;
      RandomString(rnd, raw, &raw_data);

      // Duplicate the random data until we have filled "len" bytes
      dst->clear();
      while (dst->size() < len) {
        dst->append(raw_data);
      }
      dst->resize(len);
      return Slice(*dst);
        */
}