本文整理汇总了C#中Db4objects.Db4o.Internal.Btree.BTreeNode.GetID方法的典型用法代码示例。如果您正苦于以下问题：C# BTreeNode.GetID方法的具体用法？C# BTreeNode.GetID怎么用？C# BTreeNode.GetID使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Db4objects.Db4o.Internal.Btree.BTreeNode的用法示例。
在下文中一共展示了BTreeNode.GetID方法的7个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: CacheEntry
internal virtual BTreeNodeCacheEntry CacheEntry(BTreeNode node)
{
return ((BTreeNodeCacheEntry)_nodeCache.Produce(node.GetID(), new _IFunction4_605
(node), new _IProcedure4_609(this)));
}示例2: EvictedFromCache
public virtual void EvictedFromCache(BTreeNode node)
{
_evictedFromCache = ((TreeIntObject)Tree.Add(_evictedFromCache, new TreeIntObject
(node.GetID(), node)));
}示例3: RemoveNode
internal virtual void RemoveNode(BTreeNode node)
{
_nodes = (TreeIntObject)((TreeInt)_nodes.RemoveLike(new TreeInt(node.GetID())));
}示例4: AddNode
internal virtual void AddNode(BTreeNode node)
{
_nodes = (TreeIntObject)((TreeIntObject)Tree.Add(_nodes, new TreeIntObject(node.GetID
(), node)));
AddToProcessing(node);
}示例5: Split
private Db4objects.Db4o.Internal.Btree.BTreeNode Split(Transaction trans)
{
Db4objects.Db4o.Internal.Btree.BTreeNode res = new Db4objects.Db4o.Internal.Btree.BTreeNode
(_btree, _btree._halfNodeSize, _isLeaf, _parentID, GetID(), _nextID);
System.Array.Copy(_keys, _btree._halfNodeSize, res._keys, 0, _btree._halfNodeSize
);
for (int i = _btree._halfNodeSize; i < _keys.Length; i++)
{
_keys[i] = null;
}
if (_children != null)
{
res._children = new object[_btree.NodeSize()];
System.Array.Copy(_children, _btree._halfNodeSize, res._children, 0, _btree._halfNodeSize
);
for (int i = _btree._halfNodeSize; i < _children.Length; i++)
{
_children[i] = null;
}
}
_count = _btree._halfNodeSize;
res.Write(trans.SystemTransaction());
_btree.AddNode(res);
int splitID = res.GetID();
PointNextTo(trans, splitID);
SetNextID(trans, splitID);
if (_children != null)
{
for (int i = 0; i < _btree._halfNodeSize; i++)
{
if (res._children[i] == null)
{
break;
}
res.Child(i).SetParentID(trans, splitID);
}
}
_btree.NotifySplit(trans, this, res);
return res;
}示例6: KeyChanged
private void KeyChanged(Transaction trans, BTreeNode
child)
{
PrepareWrite(trans);
SetStateDirty();
var id = child.GetID();
for (var i = 0; i < _count; i++)
{
if (ChildID(i) == id)
{
_keys[i] = child._keys[0];
_children[i] = child;
KeyChanged(trans, i);
return;
}
}
throw new InvalidOperationException("child not found");
}示例7: RemoveChild
private void RemoveChild(Transaction trans, BTreeNode
child)
{
PrepareWrite(trans);
SetStateDirty();
var id = child.GetID();
for (var i = 0; i < _count; i++)
{
if (ChildID(i) == id)
{
if (FreeIfEmpty(trans, _count - 1))
{
return;
}
Remove(i);
if (i < 1)
{
TellParentAboutChangedKey(trans);
}
if (_count == 0)
{
// root node empty case only, have to turn it into a leaf
_isLeaf = true;
}
return;
}
}
throw new InvalidOperationException("child not found");
}