C# Класс clojure.lang.PersistentTreeSet

Наследование: APersistentSet, IObj, Reversible, Sorted
Показать файл Открыть проект Примеры использования класса

Открытые свойства

Свойство Тип Описание
EMPTY PersistentTreeSet

Открытые методы

Метод Описание
comparator ( ) : System.Collections.IComparer

Returns the comparer used to sort the elements in the collection.

Would be called Comparer except we need to match the JVM name.

cons ( object o ) : IPersistentCollection

Returns a new collection that has the given element cons'd on front of the existing collection.

create ( ) : PersistentTreeSet

Create a PersistentTreeSet from arbitrary arguments.

create ( IList init ) : PersistentTreeSet

Create a PersistentTreeSet initialized from an IList.

create ( ISeq init ) : PersistentTreeSet

Create a PersistentTreeSet initialized from an ISeq.

disjoin ( object key ) : IPersistentSet

Get a set with the given item removed.

empty ( ) : IPersistentCollection

Gets an empty collection of the same type.

entryKey ( object entry ) : object

Returns the key to be passed to the comparator to sort the element.

rseq ( ) : ISeq

Gets an ISeq to travers the sequence in reverse.

seq ( bool ascending ) : ISeq

Returns an ISeq to iterate through the collection in the designated direction.

seqFrom ( object key, bool ascending ) : ISeq

Returns an ISeq to iterate through the collection in the designated direction starting from a particular key.

The key need not be in the collection. If not present, the iteration will start with the first element with a key greater than (if asscending) or less than (if descending) the given key.

withMeta ( IPersistentMap meta ) : IObj

Create a copy with new metadata.

Приватные методы

Метод Описание
PersistentTreeSet ( IPersistentMap meta, IPersistentMap impl ) : System

Initialize a PersistentTreeSet using given metadata and underlying implementation map.

Описание методов

comparator() публичный Метод

Returns the comparer used to sort the elements in the collection.
Would be called Comparer except we need to match the JVM name.
public comparator ( ) : System.Collections.IComparer
Результат System.Collections.IComparer

cons() публичный Метод

Returns a new collection that has the given element cons'd on front of the existing collection.
public cons ( object o ) : IPersistentCollection
o object An item to put at the front of the collection.
Результат IPersistentCollection

create() публичный статический Метод

Create a PersistentTreeSet from arbitrary arguments.
public static create ( ) : PersistentTreeSet
Результат PersistentTreeSet

create() публичный статический Метод

Create a PersistentTreeSet initialized from an IList.
public static create ( IList init ) : PersistentTreeSet
init IList A list of elements
Результат PersistentTreeSet

create() публичный статический Метод

Create a PersistentTreeSet initialized from an ISeq.
public static create ( ISeq init ) : PersistentTreeSet
init ISeq A sequence of elements.
Результат PersistentTreeSet

disjoin() публичный Метод

Get a set with the given item removed.
public disjoin ( object key ) : IPersistentSet
key object The item to remove.
Результат IPersistentSet

empty() публичный Метод

Gets an empty collection of the same type.
public empty ( ) : IPersistentCollection
Результат IPersistentCollection

entryKey() публичный Метод

Returns the key to be passed to the comparator to sort the element.
public entryKey ( object entry ) : object
entry object An element in the collection.
Результат object

rseq() публичный Метод

Gets an ISeq to travers the sequence in reverse.
public rseq ( ) : ISeq
Результат ISeq

seq() публичный Метод

Returns an ISeq to iterate through the collection in the designated direction.
public seq ( bool ascending ) : ISeq
ascending bool A flag indicating if the iteration is ascending or descending.
Результат ISeq

seqFrom() публичный Метод

Returns an ISeq to iterate through the collection in the designated direction starting from a particular key.
The key need not be in the collection. If not present, the iteration will start with the first element with a key greater than (if asscending) or less than (if descending) the given key.
public seqFrom ( object key, bool ascending ) : ISeq
key object The key at which to start the iteration.
ascending bool A flag indicating if the iteration is ascending or descending.
Результат ISeq

withMeta() публичный Метод

Create a copy with new metadata.
public withMeta ( IPersistentMap meta ) : IObj
meta IPersistentMap The new metadata.
Результат IObj

Описание свойств

EMPTY публичное статическое свойство

An empty PersistentTreeSet.
public static PersistentTreeSet,clojure.lang EMPTY
Результат PersistentTreeSet