Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 | import Node from './BPlusTreeNodeWebAd';
export default class BPlustreeWebAD {
root;
order;
constructor(ord) {
this.root = undefined;
this.order = ord;
}
addSimple(val) {
const origVal = val;
let index = 0;
var i = 0;
let cc = 1;
let nVal = true;
const dOrd = this.order * 2;
if (this.root == undefined) { // wenn noch keine Wurzel existiert
const root = new Node();
root.keys[0] = val;
this.root = root;
} else { // Wenn schon eine Wurzel existiert, passendes Blatt finden
let actNode = this.root; // Bei der Wurzel beginnen
while (!actNode.isLeaf) {
index = 0;
if (val >= actNode.keys[0]) {
for (i = 0; i < actNode.keys.length; i++) {
if (val >= actNode.keys[i] && (actNode.keys[i + 1] == undefined || val < actNode.keys[i + 1])) {
index = i + 1;
break;
}
}
}
actNode = actNode.pointers[index];
}
for (i = 0; i < actNode.keys.length; i++) { // Man befindet sich bereits in einem Blatt
if (actNode.keys[i] == val) { nVal = false; }
}
if (nVal) {
if (actNode.keys.length < dOrd) { // im Blatt ist Platz
actNode.keys.push(val); // Wert in das Array "keys" einfuegen
actNode.keys.sort((a, b) => a - b); // Werte im Blatt sortieren
} else if (actNode.keys.length == dOrd && actNode == this.root) { // Baum besteht nur aus Wurzel, Wurzel ist voll
var rightSibling = new Node(); // rechtes Kind
var values = actNode.keys;
values.push(val); // Array "values" enthaelt jetzt die alten und den neuen Wert
values.sort((a, b) => a - b); // alte Werte und neuen Wert sortieren
var valuesLeftSibling = [];
for (i = 0; i <= this.order; i++) { valuesLeftSibling.push(values[i]); } // Werte fuer das linke Kind
actNode.keys = valuesLeftSibling; // Wurzel erhaelt die Werte fuer den linken Knoten
var valuesRightSibling = [];
for (i = this.order + 1; i <= dOrd; i++) { valuesRightSibling.push(values[i]); }
rightSibling.keys = valuesRightSibling;
var newRoot = new Node(); // neue Wurzel
newRoot.isLeaf = false;
newRoot.keys.push(values[this.order + 1]);
newRoot.pointers[0] = actNode;
actNode.parent = newRoot;
newRoot.pointers[1] = rightSibling;
rightSibling.parent = newRoot;
this.root = newRoot;
} else if (actNode.keys.length == dOrd && actNode.parent != undefined && actNode.parent.keys.length < dOrd) {
// Blatt ist voll, Elternknoten hat noch Platz (nur Blatt spalten, Elternknoten nicht)
var rightSibling = new Node();
var values = actNode.keys;
values.push(val); // Array "values" enthaelt jetzt die alten und den neuen Wert
values.sort((a, b) => a - b);
var valuesLeftSibling = [];
for (i = 0; i <= this.order; i++) { valuesLeftSibling.push(values[i]); }
actNode.keys = valuesLeftSibling;
var valuesRightSibling = [];
for (i = this.order + 1; i <= dOrd; i++) { valuesRightSibling.push(values[i]); }
rightSibling.keys = valuesRightSibling;
index = 0;
for (i = 0; i < actNode.parent.keys.length; i++) {
if (values[this.order + 1] < actNode.parent.keys[i]) {
index = i;
break;
} else if (i + 1 == actNode.parent.keys.length) { index = i + 1; }
}
actNode.parent.keys.push(values[this.order + 1]);
actNode.parent.keys.sort((a, b) => a - b);
actNode.parent.pointers.splice(index + 1, 0, rightSibling);
rightSibling.parent = actNode.parent;
} else if (actNode.keys.length == dOrd && actNode.parent != undefined && actNode.parent.keys.length == dOrd) {
let oldLeft; let oldRight; var rightSibling = undefined; let finished = false; var left = false; var
i = 0;
let helpValues = []; let
helpValuesActNode = [];
while (!finished) {
helpValues = [];
helpValuesActNode = [];
helpValues = actNode.keys;
helpValues.push(val);
helpValues.sort((a, b) => a - b);
rightSibling = new Node();
for (i = this.order + 1; i < helpValues.length; i++) { rightSibling.keys.push(helpValues[i]); }
if (!actNode.isLeaf) {
for (i = 0; i < this.order; i++) { helpValuesActNode.push(helpValues[i]); }
val = helpValues[this.order];
rightSibling.isLeaf = false;
} else {
for (i = 0; i <= this.order; i++) { helpValuesActNode.push(helpValues[i]); }
val = rightSibling.keys[0];
}
actNode.keys = helpValuesActNode;
if (oldLeft != undefined) {
helpValues = actNode.pointers;
helpValuesActNode = [];
if (actNode.pointers[this.order] == oldLeft) {
rightSibling.pointers.push(oldRight);
for (i = this.order + 1; i < actNode.pointers.length; i++) {
rightSibling.pointers.push(actNode.pointers[i]);
actNode.pointers[i].parent = rightSibling;
}
for (i = 0; i <= this.order; i++) { helpValuesActNode.push(helpValues[i]); }
actNode.pointers = helpValuesActNode;
oldRight.parent = rightSibling;
} else {
var left = false;
for (i = 0; i < this.order; i++) {
if (actNode.pointers[i] == oldLeft) { left = true; }
}
if (left) { // neues Blatt links einhaengen
for (i = this.order; i < actNode.pointers.length; i++) {
rightSibling.pointers.push(actNode.pointers[i]);
actNode.pointers[i].parent = rightSibling;
}
for (i = 0; i < this.order; i++) { helpValuesActNode.push(helpValues[i]); }
actNode.pointers = helpValuesActNode;
index = 0;
for (i = 0; i < actNode.pointers.length; i++) {
if (actNode.pointers[i] == oldLeft) {
index = i; // Position des gespaltenen Blattes
break;
}
}
actNode.pointers.splice(index + 1, 0, oldRight); // neues Blatt links einfuegen
oldRight.parent = actNode;
} else {
for (i = this.order + 1; i < actNode.pointers.length; i++) {
rightSibling.pointers.push(actNode.pointers[i]);
actNode.pointers[i].parent = rightSibling;
}
for (i = 0; i <= this.order; i++) { helpValuesActNode.push(helpValues[i]); }
actNode.pointers = helpValuesActNode;
index = 0;
for (i = 0; i < rightSibling.pointers.length; i++) {
if (rightSibling.pointers[i] == oldLeft) {
index = i;
break;
}
}
rightSibling.pointers.splice(index + 1, 0, oldRight);
oldRight.parent = rightSibling;
}
}
}
if (actNode == this.root) { // Wurzel spalten
var newRoot = new Node(); // neue Wurzel
newRoot.isLeaf = false;
newRoot.keys.push(val);
newRoot.pointers.push(actNode);
newRoot.pointers.push(rightSibling);
actNode.parent = newRoot;
rightSibling.parent = newRoot;
this.root = newRoot;
finished = true;
} else if (actNode.parent != undefined && actNode.parent.keys.length < dOrd) {
actNode.parent.keys.push(val);
actNode.parent.keys.sort((a, b) => a - b);
index = 0;
for (i = 0; i < actNode.parent.pointers.length; i++) {
if (actNode.parent.pointers[i] == actNode || i == actNode.parent.pointers.length - 1) {
index = i + 1;
break;
}
}
actNode.parent.pointers.splice(index, 0, rightSibling);
rightSibling.parent = actNode.parent;
finished = true;
} else {
oldLeft = actNode;
oldRight = rightSibling;
actNode = actNode.parent;
}
}
}
} else { cc = 4; }
}
}
removeSimple(val) {
let i = 0; const j = 0; let
helpNode;
if (this.root == undefined) {
return false;
}
let parentNode; let actNode = this.root; let leftSibling; let
rightSibling;
let index = 0; let indexVal = 0; let
borVal;
while (!actNode.isLeaf) { // zustaendigen Knoten finden
index = 0;
if (val >= actNode.keys[0]) {
for (i = 0; i < actNode.keys.length; i++) {
if (val >= actNode.keys[i] && (actNode.keys[i + 1] == undefined || val < actNode.keys[i + 1])) {
index = i + 1;
break;
}
}
}
actNode = actNode.pointers[index];
}
let found = false;
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) { found = true; }
}
if (found) {
if (actNode == this.root) { // Wenn der Baum nur aus der Wurzel besteht
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) {
actNode.keys.splice(i, 1);
break;
}
}
if (actNode.keys.length == 0) { this.root = undefined; } // Wenn die Wurzel jetzt leer ist, wird der Baum geloescht
} else if (actNode.keys.length > this.order) { // Knoten wird nicht unterlaufen
parentNode = actNode.parent;
if (actNode.keys[0] == val) { // wenn der zu loeschende Wert in einem Indexknoten steht
if (actNode != parentNode.pointers[0]) {
index = 1;
for (i = 1; i < parentNode.pointers.length; i++) {
if (parentNode.pointers[i] == actNode) {
index = i;
break;
}
}
actNode.keys.splice(0, 1);
parentNode.keys[index - 1] = actNode.keys[0];
} else {
actNode.keys.splice(0, 1);
helpNode = parentNode;
while (helpNode != undefined) {
for (i = 0; i < helpNode.keys.length; i++) {
if (helpNode.keys[i] == val) { helpNode.keys[i] = actNode.keys[0]; }
}
helpNode = helpNode.parent;
}
}
} else { // Wert steht nicht im Indexknoten
index = 0;
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) {
index = i;
break;
}
}
actNode.keys.splice(index, 1);
}
} else { // Knoten wird unterlaufen
index = 0;
parentNode = actNode.parent;
for (i = 0; i < parentNode.pointers.length; i++) {
if (parentNode.pointers[i] == actNode) {
index = i;
break;
}
}
if (index != 0) { leftSibling = parentNode.pointers[index - 1]; }
rightSibling = parentNode.pointers[index + 1];
if (index != 0 && leftSibling.keys.length > this.order) { // Links ausborgen
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) {
indexVal = i;
break;
}
}
borVal = leftSibling.keys[leftSibling.keys.length - 1];
actNode.keys.splice(indexVal, 1); // Wert entfernen
actNode.keys.unshift(borVal); // geborgten Wert vorne einfuegen
actNode.keys.join();
leftSibling.keys.splice(leftSibling.keys.length - 1, 1); // Geborgten Wert im linken Blatt loeschen
parentNode.keys[index - 1] = actNode.keys[0];
} else if (index != parentNode.pointers.length - 1 && rightSibling.keys.length > this.order) { // rechts ausborgen
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) {
indexVal = i;
break;
}
}
borVal = rightSibling.keys[0];
actNode.keys.splice(indexVal, 1);
actNode.keys.push(borVal);
rightSibling.keys.splice(0, 1);
parentNode.keys[index] = rightSibling.keys[0];
if (index != 0) {
parentNode.keys[index - 1] = actNode.keys[0];
} else {
helpNode = parentNode;
while (helpNode != undefined) {
for (i = 0; i < helpNode.keys.length; i++) {
if (helpNode.keys[i] == val) { helpNode.keys[i] = actNode.keys[0]; }
}
helpNode = helpNode.parent;
}
}
} else { // Wenn weder links noch rechts ausgeborgt werden kann
for (i = 0; i < actNode.keys.length; i++) {
if (actNode.keys[i] == val) {
indexVal = i;
break;
}
}
actNode.keys.splice(indexVal, 1); // Wert loeschen
if (actNode == parentNode.pointers[0]) { // aktuelles Blatt ist ganz links
for (i = 0; i < parentNode.pointers[1].keys.length; i++) { actNode.keys.push(parentNode.pointers[1].keys[i]); }
parentNode.keys.splice(0, 1); // Index im Elternknoten loeschen
parentNode.pointers.splice(1, 1); // Zeiger loeschen
if (indexVal == 0) {
helpNode = parentNode;
while (helpNode != undefined) {
for (i = 0; i < helpNode.keys.length; i++) {
if (helpNode.keys[i] == val) { helpNode.keys[i] = actNode.keys[0]; }
}
helpNode = helpNode.parent;
}
}
} else { // aktuelles Blatt nicht ganz links
index = 1;
for (i = 1; i < parentNode.pointers.length; i++) {
if (parentNode.pointers[i] == actNode) {
index = i;
break;
}
}
for (i = 0; i < actNode.keys.length; i++) { leftSibling.keys.push(actNode.keys[i]); } // Werte links hinzufuegen
parentNode.keys.splice(index - 1, 1); // Index des unterlaufenen Blattes loeschen
parentNode.pointers.splice(index, 1); // Zeiger loeschen
}
actNode = parentNode;
if (actNode == this.root && actNode.keys.length == 0) { // Wenn die Wurzel jetzt leer ist
this.root = actNode.pointers[0];
actNode = this.root;
actNode.parent = undefined;
}
while (actNode.keys.length < this.order && actNode != this.root) { // wenn der Indexknoten auch unterlaufen wurde
parentNode = actNode.parent;
index = 0;
for (i = 0; parentNode.pointers.length; i++) {
if (parentNode.pointers[i] == actNode) {
index = i;
break;
}
}
if (index != 0) { leftSibling = parentNode.pointers[index - 1]; }
rightSibling = parentNode.pointers[index + 1];
if (index != 0 && leftSibling.keys.length > this.order) { // links probieren
actNode.keys.unshift(parentNode.keys[index - 1]);
actNode.pointers.unshift(leftSibling.pointers[leftSibling.pointers.length - 1]);
parentNode.keys[index - 1] = leftSibling.keys[leftSibling.keys.length - 1];
leftSibling.keys.splice(leftSibling.keys.length - 1, 1); // Wert ganz rechts loeschen
leftSibling.pointers[leftSibling.pointers.length - 1].parent = actNode;
leftSibling.pointers.splice(leftSibling.pointers.length - 1, 1); // Pfeil ganz rechts loeschen
actNode = parentNode;
} else if (index != parentNode.pointers.length - 1 && rightSibling.keys.length > this.order) { // rechts probieren
actNode.keys.push(parentNode.keys[index]);
actNode.pointers.push(rightSibling.pointers[0]);
rightSibling.pointers[0].parent = actNode;
parentNode.keys[index] = rightSibling.keys[0];
rightSibling.keys.splice(0, 1);
rightSibling.pointers.splice(0, 1);
actNode = parentNode;
} else { // Wert kann weder links noch rechts ausgeborgt werden. Achtung: Wurzel kann jetzt leer werden
if (index == 0) {
actNode.keys.push(parentNode.keys[0]);
parentNode.keys.splice(0, 1);
for (i = 0; i < parentNode.pointers[1].pointers.length; i++) { parentNode.pointers[1].pointers[i].parent = actNode; }
actNode.keys = actNode.keys.concat(parentNode.pointers[1].keys);
actNode.pointers = actNode.pointers.concat(parentNode.pointers[1].pointers);
parentNode.pointers.splice(1, 1);
} else {
leftSibling.keys.push(parentNode.keys[index - 1]); // Wert vom Elternknoten holen
parentNode.keys.splice(index - 1, 1); // Wert im Elternknoten loeschen. Kann jetzt unterbesetzt sein
for (i = 0; i < actNode.pointers.length; i++) { actNode.pointers[i].parent = leftSibling; }
leftSibling.keys = leftSibling.keys.concat(actNode.keys);
leftSibling.pointers = leftSibling.pointers.concat(actNode.pointers);
parentNode.pointers.splice(index, 1);
}
actNode = parentNode; // Elternknoten wird aktueller Knoten
if (actNode == this.root && actNode.keys.length == 0) { // Wenn die Wurzel jetzt leer ist
this.root = actNode.pointers[0];
actNode = this.root;
actNode.parent = undefined;
}
}
}
}
}
}
}
/*
searchthis(mode) {
var mo = parseInt(mode), val, index = 0, i = 0, j = 0;
if (mo == -2) {
val = parseInt(prompt("Choose a value between 0 and 1000"));
if (isNaN(val) || val < 1 || val > 999)
return;
} else if (mo == -1) {
var tmpNodes = [], values = [];
tmpNodes.push(this.root);
while (tmpNodes[i] != undefined) {
helpNode = tmpNodes[i];
for (j = 0; j < helpNode.pointers.length; j++)
tmpNodes.push(helpNode.pointers[j]);
i++;
}
for (i = 0; i < tmpNodes.length; i++) {
if (tmpNodes[i].isLeaf) {
helpNode = tmpNodes[i];
for (j = 0; j < helpNode.keys.length; j++)
values.push(helpNode.keys[j]);
}
}
var limit = values.length;
val = values[Math.floor(Math.random() * limit)]; // Zufallszahl generieren
}
this.update();
this.opCount++;
var savedOpCount = this.opCount;
if (this.speed == 0) {
this.paused = true;
} else {
var pauseSymb = $("#p");
pauseSymb.addClass("p1");
this.paused = false;
}
if (this.root == undefined) {
alert("Create the this first!");
return;
} else {
var actNode = this.root; // Bei der Wurzel beginnen
while (!actNode.isLeaf) {
index = 0;
if (val >= actNode.keys[0]) {
for (i = 0; i < actNode.keys.length; i++) {
if (val >= actNode.keys[i] && (actNode.keys[i + 1] == undefined || val < actNode.keys[i + 1])) {
index = i + 1;
break;
}
}
}
actNode = actNode.pointers[index];
}
this.draw(actNode, val, 3); // Baum im alten Zustand zeichnen
var inval = setInterval(function () {
if (savedOpCount != this.opCount)
clearInterval(inval);
if (!this.paused && this.hasArrived) {
this.hasArrived = false;
if (savedOpCount == this.opCount)
this.draw(undefined, val, 3);
clearInterval(inval);
if (this.speed == 0)
this.paused = true;
}
}, 200);
}
}
*/
print(node = this.root, level = 0) {
if (!node.isLeaf) {
for (let i = 0; i < node.pointers.length; i++) {
this.print(node.pointers[i], level + 1);
}
}
}
}
|