@@ -130,28 +130,28 @@ describe('SBTree', function () {
130
130
}
131
131
checkNil ( ) ;
132
132
var expectedArray = [ ] ;
133
- for ( var i = 0 ; i < 10000 ; ++ i ) {
134
- var isAdded = sTree . size === 0 ;
135
- if ( ! isAdded ) {
136
- isAdded = getRandomIntInclusive ( 0 , 3 ) < 3 ;
137
- }
138
- if ( isAdded ) {
139
- var newPos = getRandomIntInclusive ( 0 , sTree . size ) ;
140
- sTree . insert ( newPos , i ) ;
141
- expectedArray . splice ( newPos , 0 , i ) ;
142
- } else {
143
- var removedPos = getRandomInt ( 0 , sTree . size ) ;
144
- // sTree.remove(removedPos);
145
- //expectedArray.splice(removedPos, 1);
146
- }
133
+ for ( var i = 0 ; i < 100000 ; ++ i ) {
134
+ var newPos = getRandomIntInclusive ( 0 , sTree . size ) ;
135
+ sTree . insert ( newPos , i ) ;
136
+ expectedArray . splice ( newPos , 0 , i ) ;
147
137
}
148
138
expect ( sTree . size ) . toBe ( expectedArray . length ) ;
149
139
maxHeight = 0 ;
150
140
for ( var i = 0 ; i < sTree . size ; ++ i ) {
151
141
var node = sTree . get ( i ) ;
152
142
maxHeight = Math . max ( maxHeight , node . height ) ;
153
143
expect ( node . value ) . toBe ( expectedArray [ i ] ) ;
154
- //console.log(node.value, expectedArray[i]);
144
+ }
145
+ console . log ( maxHeight ) ;
146
+ for ( var i = 0 ; i < 50000 ; ++ i ) {
147
+ var removedPos = getRandomInt ( 0 , sTree . size ) ;
148
+ sTree . remove ( removedPos ) ;
149
+ expectedArray . splice ( removedPos , 1 ) ;
150
+ }
151
+ for ( var i = 0 ; i < sTree . size ; ++ i ) {
152
+ var node = sTree . get ( i ) ;
153
+ maxHeight = Math . max ( maxHeight , node . height ) ;
154
+ expect ( node . value ) . toBe ( expectedArray [ i ] ) ;
155
155
}
156
156
console . log ( maxHeight ) ;
157
157
checkNil ( ) ;