tu-darmstadt-informatik/AuD18
1
0
Fork 0
mirror of https://github.com/tu-darmstadt-informatik/AuD18.git synced 2025-12-13 09:55:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add comments

Browse Source
This commit is contained in:
rec0de 2018-05-26 22:09:24 +02:00
parent e98234331b
commit 2c8a08074e
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
BTree/src/lab/B_TreeNode.java
View File

@ -328,6 +328,11 @@ public class B_TreeNode {
// These getter / setter methods try to enforce reasonable constraints to make debugging easier // These getter / setter methods try to enforce reasonable constraints to make debugging easier
/**
* Returns the entry at position i of the node
* @param i Index of the entry to get
* @return Entry at position i
*/
public Entry getEntry(int i) { public Entry getEntry(int i) {
if(i > this.currentLoad - 1) if(i > this.currentLoad - 1)
throw new RuntimeException("Trying to get non-existent entry"); throw new RuntimeException("Trying to get non-existent entry");
@ -337,9 +342,15 @@ public class B_TreeNode {
return res; return res;
} }
/**
* Sets the i-th entry of the node
* @param i Index of the entry to set
* @param value Entry to set
*/
public void setEntry(int i, Entry value) { public void setEntry(int i, Entry value) {
if(i > this.currentLoad- 1) if(i > this.currentLoad- 1)
throw new RuntimeException("Trying to set non-existent entry"); throw new RuntimeException("Trying to set non-existent entry");
// keys.set might fail if the node capacity has been expanded, use add in that case
if(this.keys.size() <= i) if(this.keys.size() <= i)
keys.add(value); keys.add(value);
else else