/// <summary> /// Indicates whether an entry belongs to the tree. /// </summary> /// <param name="value">The entry.</param> /// <returns> /// <c>true</c> if tree contains the specified entry; otherwise, <c>false</c>. /// </returns> public bool Contains(TreeTableWithCounterEntry value) { if (value == null) { return(false); } return(base.Contains(value)); }
/// <summary> /// Returns the next entry in the collection for which CountVisible counter is not empty. /// </summary> /// <param name="current">The current.</param> /// <returns></returns> public TreeTableWithCounterEntry GetNextVisibleEntry(TreeTableWithCounterEntry current) { return((TreeTableWithCounterEntry)GetNextNotEmptyCounterEntry((ITreeTableEntry)current, TreeTableCounterCookies.CountVisible)); }
/// <summary> /// Appends an object. /// </summary> /// <param name="value">The value.</param> /// <returns></returns> public int Add(TreeTableWithCounterEntry value) { return(base.Add(value)); }
/// <summary> /// Returns the position of an object in the tree. /// </summary> /// <param name="value">The value.</param> /// <returns></returns> public int IndexOf(TreeTableWithCounterEntry value) { return(base.IndexOf(value)); }
/// <summary> /// Removes an object from the tree. /// </summary> /// <param name="value">The value.</param> public bool Remove(TreeTableWithCounterEntry value) { return(base.Remove(value)); }
/// <summary> /// Inserts a <see cref="TreeTableWithCounterEntry"/> object at the specified index. /// </summary> /// <param name="index">The index.</param> /// <param name="value">The value.</param> public void Insert(int index, TreeTableWithCounterEntry value) { base.Insert(index, value); }