本文整理汇总了C#中System.Xml.Schema.BitSet.Clear方法的典型用法代码示例。如果您正苦于以下问题：C# BitSet.Clear方法的具体用法？C# BitSet.Clear怎么用？C# BitSet.Clear使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类System.Xml.Schema.BitSet的用法示例。
在下文中一共展示了BitSet.Clear方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: CalculateTotalFollowposForRangeNodes
private BitSet[] CalculateTotalFollowposForRangeNodes(BitSet firstpos, BitSet[] followpos, out BitSet posWithRangeTerminals) {
int positionsCount = positions.Count; //terminals
posWithRangeTerminals = new BitSet(positionsCount);
//Compute followpos for each range node
//For any range node that is surrounded by an outer range node, its follow positions will include those of the outer range node
BitSet[] minmaxFollowPos = new BitSet[minMaxNodesCount];
int localMinMaxNodesCount = 0;
for (int i = positionsCount - 1; i >= 0; i--) {
Position p = positions[i];
if (p.symbol == -2) { //P is a LeafRangeNode
LeafRangeNode lrNode = p.particle as LeafRangeNode;
Debug.Assert(lrNode != null);
BitSet tempFollowPos = new BitSet(positionsCount);
tempFollowPos.Clear();
tempFollowPos.Or(followpos[i]); //Add the followpos of the range node
if (lrNode.Min != lrNode.Max) { //If they are the same, then followpos cannot include the firstpos
tempFollowPos.Or(lrNode.NextIteration); //Add the nextIteration of the range node (this is the firstpos of its parent's leftChild)
}
//For each position in the bitset, if it is a outer range node (pos > i), then add its followpos as well to the current node's followpos
for (int pos = tempFollowPos.NextSet(-1); pos != -1; pos = tempFollowPos.NextSet(pos)) {
if (pos > i) {
Position p1 = positions[pos];
if (p1.symbol == -2) {
LeafRangeNode lrNode1 = p1.particle as LeafRangeNode;
Debug.Assert(lrNode1 != null);
tempFollowPos.Or(minmaxFollowPos[lrNode1.Pos]);
}
}
}
//set the followpos built to the index in the BitSet[]
minmaxFollowPos[localMinMaxNodesCount] = tempFollowPos;
lrNode.Pos = localMinMaxNodesCount++;
posWithRangeTerminals.Set(i);
}
}
return minmaxFollowPos;
}示例2: CalculateTotalFollowposForRangeNodes
private BitSet[] CalculateTotalFollowposForRangeNodes(BitSet firstpos, BitSet[] followpos, out BitSet posWithRangeTerminals)
{
int count = this.positions.Count;
posWithRangeTerminals = new BitSet(count);
BitSet[] setArray = new BitSet[this.minMaxNodesCount];
int index = 0;
for (int i = count - 1; i >= 0; i--)
{
Position position = this.positions[i];
if (position.symbol == -2)
{
LeafRangeNode particle = position.particle as LeafRangeNode;
BitSet set = new BitSet(count);
set.Clear();
set.Or(followpos[i]);
if (particle.Min != particle.Max)
{
set.Or(particle.NextIteration);
}
for (int j = set.NextSet(-1); j != -1; j = set.NextSet(j))
{
if (j > i)
{
Position position2 = this.positions[j];
if (position2.symbol == -2)
{
LeafRangeNode node2 = position2.particle as LeafRangeNode;
set.Or(setArray[node2.Pos]);
}
}
}
setArray[index] = set;
particle.Pos = index++;
posWithRangeTerminals.Set(i);
}
}
return setArray;
}