本文整理汇总了C#中BitSet.IsLexicographicallySmaller方法的典型用法代码示例。如果您正苦于以下问题：C# BitSet.IsLexicographicallySmaller方法的具体用法？C# BitSet.IsLexicographicallySmaller怎么用？C# BitSet.IsLexicographicallySmaller使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BitSet的用法示例。
在下文中一共展示了BitSet.IsLexicographicallySmaller方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Update
/*************************/
// Basic operations
/*************************/
// When adding a new entry we check if the neighborhood is already contained in the set
// If true, then we might replace the previous representative that is not connected to this neighborhood if the new one is lexicographically smaller
public void Update(BitSet representative, BitSet neighborhood)
{
if (_map.ContainsValue(neighborhood))
{
BitSet previousRep = _map.Reverse[neighborhood];
if (representative.IsLexicographicallySmaller(previousRep))
{
_map.Remove(previousRep, neighborhood);
_map.Add(representative, neighborhood);
}
}
else
{
_map.Add(representative, neighborhood);
}
}