Example #1
0
 public void NextRow(object keyValue, IHierarchyObj owner)
 {
     try
     {
         BTreeNodeValue value      = default(BTreeNodeValue);
         int            num        = default(int);
         int            childIndex = default(int);
         if (!this.m_root.SearchAndInsert(keyValue, this.m_nodes, owner, out value, out num, out childIndex))
         {
             int count = this.m_nodes.Count;
             this.m_nodes.Add(this.m_root);
             this.m_root = new BTreeNode(owner);
             this.m_root.SetFirstChild(this.m_nodes, count);
             this.m_root.Tuples.Add(new BTreeNodeTuple(value, childIndex), this.m_nodes);
         }
     }
     catch (ReportProcessingException_SpatialTypeComparisonError)
     {
         throw new ReportProcessingException(owner.RegisterComparisonError("SortExpression"));
     }
     catch (ReportProcessingException_ComparisonError)
     {
         throw new ReportProcessingException(owner.RegisterComparisonError("SortExpression"));
     }
 }
Example #2
0
 internal void NextRow(object keyValue, IHierarchyObj owner)
 {
     try
     {
         if (!m_root.SearchAndInsert(keyValue, m_nodes, owner, out BTreeNodeValue newSiblingValue, out int _, out int globalNewSiblingIndex))
         {
             int count = m_nodes.Count;
             m_nodes.Add(m_root);
             m_root = new BTreeNode(owner);
             m_root.SetFirstChild(m_nodes, count);
             m_root.Tuples.Add(new BTreeNodeTuple(newSiblingValue, globalNewSiblingIndex), m_nodes);
         }
     }
     catch (ReportProcessingException_SpatialTypeComparisonError)
     {
         throw new ReportProcessingException(owner.RegisterComparisonError("SortExpression"));
     }
     catch (ReportProcessingException_ComparisonError)
     {
         throw new ReportProcessingException(owner.RegisterComparisonError("SortExpression"));
     }
 }