@@ -34,7 +34,7 @@ func randBytes(numBytes int) []byte {
34
34
35
35
// make a tree with data from above and save it
36
36
func newAlohaTree (t * testing.T , db dbm.DB ) (* iavl.MutableTree , types.CommitID ) {
37
- tree , err := iavl .NewMutableTree (db , cacheSize )
37
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
38
38
require .NoError (t , err )
39
39
40
40
for k , v := range treeData {
@@ -100,17 +100,17 @@ func TestLoadStore(t *testing.T) {
100
100
require .Equal (t , string (hcStore .Get ([]byte ("hello" ))), "ciao" )
101
101
102
102
// Querying a new store at some previous non-pruned height H
103
- newHStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDH , false , DefaultIAVLCacheSize )
103
+ newHStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDH , false , DefaultIAVLCacheSize , false )
104
104
require .NoError (t , err )
105
105
require .Equal (t , string (newHStore .Get ([]byte ("hello" ))), "hallo" )
106
106
107
107
// Querying a new store at some previous pruned height Hp
108
- newHpStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDHp , false , DefaultIAVLCacheSize )
108
+ newHpStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDHp , false , DefaultIAVLCacheSize , false )
109
109
require .NoError (t , err )
110
110
require .Equal (t , string (newHpStore .Get ([]byte ("hello" ))), "hola" )
111
111
112
112
// Querying a new store at current height H
113
- newHcStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDHc , false , DefaultIAVLCacheSize )
113
+ newHcStore , err := LoadStore (db , log .NewNopLogger (), types .NewKVStoreKey ("test" ), cIDHc , false , DefaultIAVLCacheSize , false )
114
114
require .NoError (t , err )
115
115
require .Equal (t , string (newHcStore .Get ([]byte ("hello" ))), "ciao" )
116
116
}
@@ -281,7 +281,7 @@ func TestIAVLIterator(t *testing.T) {
281
281
func TestIAVLReverseIterator (t * testing.T ) {
282
282
db := dbm .NewMemDB ()
283
283
284
- tree , err := iavl .NewMutableTree (db , cacheSize )
284
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
285
285
require .NoError (t , err )
286
286
287
287
iavlStore := UnsafeNewStore (tree )
@@ -314,7 +314,7 @@ func TestIAVLReverseIterator(t *testing.T) {
314
314
315
315
func TestIAVLPrefixIterator (t * testing.T ) {
316
316
db := dbm .NewMemDB ()
317
- tree , err := iavl .NewMutableTree (db , cacheSize )
317
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
318
318
require .NoError (t , err )
319
319
320
320
iavlStore := UnsafeNewStore (tree )
@@ -378,7 +378,7 @@ func TestIAVLPrefixIterator(t *testing.T) {
378
378
379
379
func TestIAVLReversePrefixIterator (t * testing.T ) {
380
380
db := dbm .NewMemDB ()
381
- tree , err := iavl .NewMutableTree (db , cacheSize )
381
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
382
382
require .NoError (t , err )
383
383
384
384
iavlStore := UnsafeNewStore (tree )
@@ -446,7 +446,7 @@ func nextVersion(iavl *Store) {
446
446
447
447
func TestIAVLNoPrune (t * testing.T ) {
448
448
db := dbm .NewMemDB ()
449
- tree , err := iavl .NewMutableTree (db , cacheSize )
449
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
450
450
require .NoError (t , err )
451
451
452
452
iavlStore := UnsafeNewStore (tree )
@@ -465,7 +465,7 @@ func TestIAVLNoPrune(t *testing.T) {
465
465
466
466
func TestIAVLStoreQuery (t * testing.T ) {
467
467
db := dbm .NewMemDB ()
468
- tree , err := iavl .NewMutableTree (db , cacheSize )
468
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
469
469
require .NoError (t , err )
470
470
471
471
iavlStore := UnsafeNewStore (tree )
@@ -569,7 +569,7 @@ func BenchmarkIAVLIteratorNext(b *testing.B) {
569
569
b .ReportAllocs ()
570
570
db := dbm .NewMemDB ()
571
571
treeSize := 1000
572
- tree , err := iavl .NewMutableTree (db , cacheSize )
572
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
573
573
require .NoError (b , err )
574
574
575
575
for i := 0 ; i < treeSize ; i ++ {
@@ -603,7 +603,7 @@ func TestSetInitialVersion(t *testing.T) {
603
603
{
604
604
"works with a mutable tree" ,
605
605
func (db * dbm.MemDB ) * Store {
606
- tree , err := iavl .NewMutableTree (db , cacheSize )
606
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
607
607
require .NoError (t , err )
608
608
store := UnsafeNewStore (tree )
609
609
@@ -613,7 +613,7 @@ func TestSetInitialVersion(t *testing.T) {
613
613
{
614
614
"throws error on immutable tree" ,
615
615
func (db * dbm.MemDB ) * Store {
616
- tree , err := iavl .NewMutableTree (db , cacheSize )
616
+ tree , err := iavl .NewMutableTree (db , cacheSize , false )
617
617
require .NoError (t , err )
618
618
store := UnsafeNewStore (tree )
619
619
_ , version , err := store .tree .SaveVersion ()
0 commit comments