C# 클래스 clojure.lang.PersistentVector

상속: APersistentVector, IObj, IEditableCollection, IEnumerable, IReduce
파일 보기 프로젝트 열기: richhickey/clojure-clr 1 사용 예제들

공개 메소드들

메소드 설명
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

비공개 메소드들

메소드 설명
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

메소드 상세

PersistentVector() 공개 메소드

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
리턴 System

asTransient() 공개 메소드

public asTransient ( ) : ITransientCollection
리턴 ITransientCollection

assocN() 공개 메소드

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
리턴 IPersistentVector

length() 공개 메소드

Gets the number of items in the vector.
Not sure why you wouldn't use count() intead.
public length ( ) : int
리턴 int

meta() 공개 메소드

public meta ( ) : IPersistentMap
리턴 IPersistentMap

nth() 공개 메소드

public nth ( int i, Object notFound ) : Object
i int
notFound Object
리턴 Object

nth() 공개 메소드

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/
리턴 object

pop() 공개 메소드

Returns a new stack with the top element popped.
public pop ( ) : IPersistentStack
리턴 IPersistentStack

seq() 공개 메소드

public seq ( ) : ISeq
리턴 ISeq

withMeta() 공개 메소드

public withMeta ( IPersistentMap meta ) : IObj
meta IPersistentMap
리턴 IObj