C# NeoDatis.GetNbKeys方法代码示例

		public static void ValidateNode(NeoDatis.Btree.IBTreeNode node)
		{
			if (!on)
			{
				return;
			}
			int nbKeys = node.GetNbKeys();
			if (node.HasParent() && nbKeys < node.GetDegree() - 1)
			{
				throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Node with less than "
					 + (node.GetDegree() - 1) + " keys");
			}
			int maxNbKeys = node.GetDegree() * 2 - 1;
			int nbChildren = node.GetNbChildren();
			int maxNbChildren = node.GetDegree() * 2;
			if (nbChildren != 0 && nbKeys == 0)
			{
				throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Node with no key but with children : "
					 + node);
			}
			for (int i = 0; i < nbKeys; i++)
			{
				if (node.GetKeyAndValueAt(i) == null)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Null key at " + 
						i + " on node " + node.ToString());
				}
				CheckValuesOfChild(node.GetKeyAndValueAt(i), node.GetChildAt(i, false));
			}
			for (int i = nbKeys; i < maxNbKeys; i++)
			{
				if (node.GetKeyAndValueAt(i) != null)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Not Null key at "
						 + i + " on node " + node.ToString());
				}
			}
			NeoDatis.Btree.IBTreeNode previousNode = null;
			for (int i = 0; i < nbChildren; i++)
			{
				if (node.GetChildAt(i, false) == null)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Null child at index "
						 + i + " on node " + node.ToString());
				}
				if (previousNode != null && previousNode == node.GetChildAt(i, false))
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Two equals children at index "
						 + i + " : " + previousNode.ToString());
				}
				previousNode = node.GetChildAt(i, false);
			}
			for (int i = nbChildren; i < maxNbChildren; i++)
			{
				if (node.GetChildAt(i, false) != null)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Not Null child at "
						 + i + " on node " + node.ToString());
				}
			}
		}

		public static bool SearchKey(System.IComparable key, NeoDatis.Btree.IBTreeNodeOneValuePerKey
			 node)
		{
			if (!on)
			{
				return false;
			}
			for (int i = 0; i < node.GetNbKeys(); i++)
			{
				if (node.GetKeyAndValueAt(i).GetKey().CompareTo(key) == 0)
				{
					return true;
				}
			}
			return false;
		}

		private static void CheckValuesOfChild(NeoDatis.Btree.IKeyAndValue key, NeoDatis.Btree.IBTreeNode
			 node)
		{
			if (!on)
			{
				return;
			}
			if (node == null)
			{
				return;
			}
			for (int i = 0; i < node.GetNbKeys(); i++)
			{
				if (node.GetKeyAndValueAt(i).GetKey().CompareTo(key.GetKey()) >= 0)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Left child with values bigger than pivot "
						 + key + " : " + node.ToString());
				}
			}
		}

		private void BuildDisplay(NeoDatis.Btree.IBTreeNode node, int currentHeight, int 
			childIndex, object parentId, bool withIds)
		{
			if (currentHeight > lines.Length - 1)
			{
				return;
			}
			// get string buffer of this line
			System.Text.StringBuilder line = lines[currentHeight];
			if (withIds)
			{
				line.Append(node.GetId()).Append(":[");
			}
			else
			{
				line.Append("[");
			}
			for (int i = 0; i < node.GetNbKeys(); i++)
			{
				if (i > 0)
				{
					line.Append(" , ");
				}
				NeoDatis.Btree.IKeyAndValue kav = node.GetKeyAndValueAt(i);
				line.Append(kav.GetKey());
			}
			if (withIds)
			{
				line.Append("]:").Append(node.GetParentId()).Append("/").Append(parentId).Append(
					"    ");
			}
			else
			{
				line.Append("]  ");
			}
			for (int i = 0; i < node.GetNbChildren(); i++)
			{
				NeoDatis.Btree.IBTreeNode child = node.GetChildAt(i, false);
				if (child != null)
				{
					BuildDisplay(child, currentHeight + 1, i, node.GetId(), withIds);
				}
				else
				{
					lines[currentHeight + 1].Append("[Child " + (i + 1) + " null!] ");
				}
			}
		}

		private void CheckIfCanMergeWith(NeoDatis.Btree.IBTreeNode node)
		{
			if (nbKeys + node.GetNbKeys() > maxNbKeys)
			{
				throw new NeoDatis.Btree.Exception.BTreeException("Trying to merge two nodes with too many keys "
					 + nbKeys + " + " + node.GetNbKeys() + " > " + maxNbKeys);
			}
			if (nbKeys > 0)
			{
				System.IComparable greatestOfThis = keys[nbKeys - 1];
				System.IComparable smallestOfOther = node.GetKeyAt(0);
				if (greatestOfThis.CompareTo(smallestOfOther) >= 0)
				{
					throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Trying to merge two nodes that have intersections :  "
						 + ToString() + " / " + node);
				}
			}
			if (nbKeys < nbChildren)
			{
				throw new NeoDatis.Btree.Exception.BTreeNodeValidationException("Trying to merge two nodes where the first one has more children than keys"
					);
			}
		}

		/// <summary>
		/// Can only merge node without intersection =&gt; the greater key of this must
		/// be smaller than the smallest key of the node
		/// </summary>
		public virtual void MergeWith(NeoDatis.Btree.IBTreeNode node)
		{
			NeoDatis.Btree.Tool.BTreeValidator.ValidateNode(this);
			NeoDatis.Btree.Tool.BTreeValidator.ValidateNode(node);
			CheckIfCanMergeWith(node);
			int j = nbKeys;
			for (int i = 0; i < node.GetNbKeys(); i++)
			{
				SetKeyAndValueAt(node.GetKeyAt(i), node.GetValueAsObjectAt(i), j, false, false);
				SetChildAt(node, i, j, false);
				j++;
			}
			// in this, we have to take the last child
			if (node.GetNbChildren() > node.GetNbKeys())
			{
				SetChildAt(node, node.GetNbChildren() - 1, j, true);
			}
			nbKeys += node.GetNbKeys();
			nbChildren += node.GetNbChildren();
			NeoDatis.Btree.Tool.BTreeValidator.ValidateNode(this);
		}