1 write to records
System.Data (1)
fx\src\data\System\Data\Selection.cs (1)
694
records
= new IndexTree(this);
48 references to records
System.Data (48)
fx\src\data\System\Data\Selection.cs (48)
189
return
records
[recordIndex];
194
return
records
.HasDuplicates;
262
Debug.Assert(null !=
records
, "null records");
417
int record =
records
.DeleteByIndex(recordIndex);
434
return new IndexTree.RBTreeEnumerator(
records
, startIndex);
443
int index =
records
.GetIndexByKey(record);
471
index =
records
.GetIndexByKey(record);
498
GetUniqueKeyValues(list,
records
.root);
506
int nodeId =
records
.Search(record);
508
return
records
.GetIndexByNode(nodeId); //always returns the First record index
516
return
records
.GetIndexByNode(nodeId);
524
return
records
.GetIndexByNode(nodeId);
535
x =
records
.root;
540
x =
records
.root;
543
c = column.CompareValueTo(
records
.Key(x), key);
545
if (c < 0) { x =
records
.Left(x); } // < for decsending
546
else { x =
records
.Right(x); }
551
c = column.CompareValueTo(
records
.Key(x), key);
553
if (c > 0) { x =
records
.Left(x); } // > for ascending
554
else { x =
records
.Right(x); }
568
x =
records
.root;
576
x =
records
.root;
578
c = CompareRecordToKey(
records
.Key(x), key);
580
if (c > 0) { x =
records
.Left(x); }
581
else { x =
records
.Right(x); }
589
x =
records
.root;
591
x =
records
.root;
593
c = CompareRecords(
records
.Key(x), record);
595
if (c > 0) { x =
records
.Left(x); }
596
else { x =
records
.Right(x); }
608
int x =
records
.root;
611
int c = comparison(key, (TRow)table.recordManager[
records
.Key(x)]);
613
if (c < 0) { x =
records
.Left(x); }
614
else { x =
records
.Right(x); }
627
int recordIndex =
records
.GetIndexByNode(nodeId);
629
if (
records
.Next (nodeId) == IndexTree.NIL)
632
int span =
records
.SubTreeSize(
records
.Next(nodeId));
728
records
.InsertAt(-1, record, append);
759
int nodeId =
records
.InsertAt(-1, record, append);
767
OnListChanged(ListChangedType.ItemAdded,
records
.GetIndexByNode(nodeId));
772
return
records
.GetIndexByNode(nodeId);
897
records
.UpdateNodeKey(oldRecord, newRecord); //change in place, as Both records have same key value
905
records
.DeleteByIndex(oldRecordIndex); // DeleteByIndex doesn't require searching by key
909
records
.Insert(newRecord);
943
GetUniqueKeyValues(list,
records
.Left(curNodeId));
945
int record =
records
.Key(curNodeId);
952
GetUniqueKeyValues(list,
records
.Right(curNodeId));