C# Class clojure.lang.PersistentVector

Inheritance: APersistentVector, IObj, IEditableCollection, IEnumerable, IReduce

Public Methods

Method	Description
PersistentVector ( int cnt, int shift, Node root, object tail ) : System	Initialize a PersistentVector from basic components.
asTransient ( ) : ITransientCollection
assocN ( int i, Object val ) : IPersistentVector	Return a new vector with the i-th value set to `val`.
length ( ) : int	Gets the number of items in the vector. Not sure why you wouldn't use `count()` intead.
meta ( ) : IPersistentMap
nth ( int i, Object notFound ) : Object
nth ( int i ) : object	Get the i-th item in the vector. Throws an exception if the index `i` is not in the range of the vector's elements.
pop ( ) : IPersistentStack	Returns a new stack with the top element popped.
seq ( ) : ISeq
withMeta ( IPersistentMap meta ) : IObj

Method	Description
ArrayFor ( int i ) : object[]
PersistentVector ( IPersistentMap meta, int cnt, int shift, Node root, object tail ) : System	Initialize a PersistentVector from given metadata and basic components.
chunkedSeq ( ) : IChunkedSeq
cons ( object o ) : IPersistentVector
count ( ) : int
create ( ) : PersistentVector
create ( ISeq items ) : PersistentVector
create1 ( ICollection items ) : PersistentVector
doAssoc ( int level, Node node, int i, object val ) : Node
empty ( ) : IPersistentCollection
newPath ( AtomicReference edit, int level, Node node ) : Node
popTail ( int level, Node node ) : Node
pushTail ( int level, Node parent, Node tailnode ) : Node
tailoff ( ) : int

Initialize a PersistentVector from basic components.

public PersistentVector ( int cnt, int shift, Node root, object tail ) : System
cnt	int
shift	int
root	Node
tail	object
return	System

public asTransient ( ) : ITransientCollection
return	ITransientCollection

Return a new vector with the i-th value set to val.

public assocN ( int i, Object val ) : IPersistentVector
i	int	The index of the item to set.
val	Object	The new value
return	IPersistentVector

Gets the number of items in the vector.

Not sure why you wouldn't use count() intead.

public length ( ) : int
return	int

public meta ( ) : IPersistentMap
return	IPersistentMap

public nth ( int i, Object notFound ) : Object
i	int
notFound	Object
return	Object

Get the i-th item in the vector.

Throws an exception if the index i is not in the range of the vector's elements.

public nth ( int i ) : object
i	int	The index of the item to retrieve/
return	object

Returns a new stack with the top element popped.

public pop ( ) : IPersistentStack
return	IPersistentStack

public seq ( ) : ISeq
return	ISeq

public withMeta ( IPersistentMap meta ) : IObj
meta	IPersistentMap
return	IObj