 	}
 	
 	/**
-	:name:	countOf
-	:description:	Conforms to ProbabilityType protocol.
+		:name:	countOf
+		:description:	Conforms to ProbabilityType protocol.
 	*/
 	public override func countOf(keys: Key...) -> Int {
 		return tree.countOf(keys)
 	}
 	
 	/**
-	:name:	countOf
-	:description:	Conforms to ProbabilityType protocol.
+		:name:	countOf
+		:description:	Conforms to ProbabilityType protocol.
 	*/
 	public override func countOf(keys: Array<Key>) -> Int {
 		return tree.countOf(keys)
 	}
 	
 	/**
-	:name:	insert
-	:description:	Inserts a list of (Key, Value?) pairs.
-	:param:	elements	(Key, Value?)...	Elements to insert.
+		:name:	insert
+		:description:	Inserts a list of (Key, Value?) pairs.
+		:param:	elements	(Key, Value?)...	Elements to insert.
 	*/
 	public func insert(elements: (Key, Value?)...) {
 		insert(elements)
 	}
 	
 	/**
-	:name:	insert
-	:description:	Inserts an array of (Key, Value?) pairs.
-	:param:	elements	Array<(Key, Value?)>	Elements to insert.
+		:name:	insert
+		:description:	Inserts an array of (Key, Value?) pairs.
+		:param:	elements	Array<(Key, Value?)>	Elements to insert.
 	*/
 	public func insert(elements: Array<(Key, Value?)>) {
 		for x in elements {

	}
	
	/**
	:name:	removeValueForKey
	:description:	Removes a node from the tree based on the key value given.
	If the tree allows non-unique keys, then all keys matching
	the given key value will be removed.
	:returns:	Value?
	*/
	public func removeValueForKey(key: Key) -> Value? {
		var x: Value? = tree.removeValueForKey(key)

	}
	
	/**
		:name:	subtree
		:description:	Traverses the Tree and looking for a key value.
		This is used for internal search.
	*/
	internal func subtree(key: Key, node: RedBlackNode<Key, Value>, inout dict: OrderedDictionary<Key, Value>) {
		if tree.sentinel !== node {
