diff --git a/src/BTree.py b/src/BTree.py index 6409544462bb8e8eaac34a8f3b9ac7b21ed38ec5..acc76b9e5974282c1a799a54bcac8e2198e5084b 100644 --- a/src/BTree.py +++ b/src/BTree.py @@ -1,5 +1,5 @@ #import Node as Bnode -from node import * +from Node import * class Btree() : diff --git a/src/BtreeTest.py b/src/BtreeTest.py new file mode 100644 index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 diff --git a/src/node.py b/src/Node.py similarity index 85% rename from src/node.py rename to src/Node.py index 090d1f7d600a40996fb1a10c0ddc82c2f295e05d..d0f2828fe9eb55f9d5b619f6f634a51839a44314 100644 --- a/src/node.py +++ b/src/Node.py @@ -8,12 +8,12 @@ class Node() : self.k = k def isLeaf(self): - """ - >>> Node([12, 42]).isLeaf() - True - >>> Node([12, 42], [Node([1]), Node([25]), Node([50])]).isLeaf() - False - """ +# """ +# >>> Node([12, 42]).isLeaf() +# True +# >>> Node([12, 42], [Node([1]), Node([25]), Node([50])]).isLeaf() +# False +# """ return (len(self.childs) == 0) def getSize(self) : @@ -41,12 +41,17 @@ class Node() : def insert(self, value): """ + Exemple(s): + >>> Node([5]).insert(20) + (True, None, None, None) >>> Node([5,15]).insert(12) (False, 12, Node([5]), Node([15])) - >>> Node([5]).insert(20) + >>> Node([12, 42], [Node([3]), Node([25]), Node([50])]).insert(52) (True, None, None, None) >>> Node([12, 42], [Node([2, 3]), Node([25]), Node([50])]).insert(1) - (True, None, None, None) + (False, 12, Node([2]), Node([42])) + >>> Node([12, 42], [Node([2, 4], [Node([0, 1]), Node([3]), Node([7, 8])]), Node([25]), Node([50])]).insert(6) + (False, 12, Node([4]), Node([42])) """ (found, index) = recherche_dichotomique(value, self.keys) if (not found) : diff --git a/src/NodeTest.py b/src/NodeTest.py new file mode 100644 index 0000000000000000000000000000000000000000..750aaf14f9d8a00e8008c95c6b8e444ed1421e56 --- /dev/null +++ b/src/NodeTest.py @@ -0,0 +1,7 @@ +import unittest + + + + +if __name__ == "__main__": + unittest.main() \ No newline at end of file