C# 클래스 Lucene.Net.Util.OpenBitSet

상속: Lucene.Net.Search.DocIdSet, System.ICloneable

파일 보기 프로젝트 열기: synhershko/lucene.net 1 사용 예제들

보호된 프로퍼티들

프로퍼티	타입	설명
internalbits	long[]
wlen	int

Private Properties

프로퍼티	타입	설명

공개 메소드들

메소드	설명
And ( OpenBitSet other ) : void
AndNot ( OpenBitSet other ) : void
AndNotCount ( OpenBitSet a, OpenBitSet b ) : long	Returns the popcount or cardinality of "a and not b" or "intersection(a, not(b))". Neither set is modified.
Bits2words ( long numBits ) : int	returns the number of 64 bit words it would take to hold numBits
Capacity ( ) : long	Returns the current capacity in bits (1 greater than the index of the last bit)
Cardinality ( ) : long
Clear ( int startIndex, int endIndex ) : void	Clears a range of bits. Clearing past the end does not change the size of the set.
Clear ( long index ) : void	clears a bit, allowing access beyond the current set size without changing the size.
Clear ( long startIndex, long endIndex ) : void	Clears a range of bits. Clearing past the end does not change the size of the set.
Clone ( ) : Object
EnsureCapacity ( long numBits ) : void	Ensure that the long[] is big enough to hold numBits, expanding it if necessary. getNumWords() is unchanged by this call.
EnsureCapacityWords ( int numWords ) : void	Expand the long[] with the size given as a number of words (64 bit longs). getNumWords() is unchanged by this call.
Equals ( System o ) : bool	returns true if both sets have the same bits set
FastClear ( int index ) : void	clears a bit. The index should be less than the OpenBitSet size.
FastClear ( long index ) : void	clears a bit. The index should be less than the OpenBitSet size.
FastFlip ( int index ) : void	flips a bit. The index should be less than the OpenBitSet size.
FastFlip ( long index ) : void	flips a bit. The index should be less than the OpenBitSet size.
FastGet ( int index ) : bool	Returns true or false for the specified bit index. The index should be less than the OpenBitSet size
FastGet ( long index ) : bool	Returns true or false for the specified bit index. The index should be less than the OpenBitSet size.
FastSet ( int index ) : void	Sets the bit at the specified index. The index should be less than the OpenBitSet size.
FastSet ( long index ) : void	Sets the bit at the specified index. The index should be less than the OpenBitSet size.
Flip ( long index ) : void	flips a bit, expanding the set size if necessary
Flip ( long startIndex, long endIndex ) : void	Flips a range of bits, expanding the set size if necessary
FlipAndGet ( int index ) : bool	flips a bit and returns the resulting bit value. The index should be less than the OpenBitSet size.
FlipAndGet ( long index ) : bool	flips a bit and returns the resulting bit value. The index should be less than the OpenBitSet size.
Get ( int index ) : bool	Returns true or false for the specified bit index.
Get ( long index ) : bool	Returns true or false for the specified bit index
GetAndSet ( int index ) : bool	Sets a bit and returns the previous value. The index should be less than the OpenBitSet size.
GetAndSet ( long index ) : bool	Sets a bit and returns the previous value. The index should be less than the OpenBitSet size.
GetBit ( int index ) : int	returns 1 if the bit is set, 0 if not. The index should be less than the OpenBitSet size
GetHashCode ( ) : int
Intersect ( OpenBitSet other ) : void	this = this AND other
IntersectionCount ( OpenBitSet a, OpenBitSet b ) : long	Returns the popcount or cardinality of the intersection of the two sets. Neither set is modified.
Intersects ( OpenBitSet other ) : bool	returns true if the sets have any elements in common
IsEmpty ( ) : bool	Returns true if there are no set bits
Iterator ( ) : Lucene.Net.Search.DocIdSetIterator
NextSetBit ( int index ) : int	Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
NextSetBit ( long index ) : long	Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
OpenBitSet ( ) : System
OpenBitSet ( long numBits ) : System	Constructs an OpenBitSet large enough to hold numBits.
OpenBitSet ( long bits, int numWords ) : System	Constructs an OpenBitSet from an existing long[]. The first 64 bits are in long[0], with bit index 0 at the least significant bit, and bit index 63 at the most significant. Given a bit index, the word containing it is long[index/64], and it is at bit number index%64 within that word. numWords are the number of elements in the array that contain set bits (non-zero longs). numWords should be <= bits.length, and any existing words in the array at position >= numWords should be zero.
Or ( OpenBitSet other ) : void
Remove ( OpenBitSet other ) : void	Remove all elements set in other. this = this AND_NOT other
Set ( long index ) : void	sets a bit, expanding the set size if necessary
Set ( long startIndex, long endIndex ) : void	Sets a range of bits, expanding the set size if necessary
Size ( ) : long	Returns the current capacity of this set. Included for compatibility. This is not equal to Cardinality
TrimTrailingZeros ( ) : void	Lowers numWords, the number of words in use, by checking for trailing zero words.
Union ( OpenBitSet other ) : void	this = this OR other
UnionCount ( OpenBitSet a, OpenBitSet b ) : long	Returns the popcount or cardinality of the union of the two sets. Neither set is modified.
Xor ( OpenBitSet other ) : void	this = this XOR other
XorCount ( OpenBitSet a, OpenBitSet b ) : long	Returns the popcount or cardinality of the exclusive-or of the two sets. Neither set is modified.

보호된 메소드들

메소드	설명
ExpandingWordNum ( long index ) : int

메소드 상세

And() 공개 메소드

public And ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

AndNot() 공개 메소드

public AndNot ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

AndNotCount() 공개 정적인 메소드

Returns the popcount or cardinality of "a and not b" or "intersection(a, not(b))". Neither set is modified.

public static AndNotCount ( OpenBitSet a, OpenBitSet b ) : long
a	OpenBitSet
b	OpenBitSet
리턴	long

Bits2words() 공개 정적인 메소드

returns the number of 64 bit words it would take to hold numBits

public static Bits2words ( long numBits ) : int
numBits	long
리턴	int

Capacity() 공개 메소드

Returns the current capacity in bits (1 greater than the index of the last bit)

public Capacity ( ) : long
리턴	long

Cardinality() 공개 메소드

public Cardinality ( ) : long
리턴	long

Clear() 공개 메소드

Clears a range of bits. Clearing past the end does not change the size of the set.

public Clear ( int startIndex, int endIndex ) : void
startIndex	int	lower index ///
endIndex	int	one-past the last bit to clear ///
리턴	void

Clear() 공개 메소드

clears a bit, allowing access beyond the current set size without changing the size.

public Clear ( long index ) : void
index	long
리턴	void

Clear() 공개 메소드

Clears a range of bits. Clearing past the end does not change the size of the set.

public Clear ( long startIndex, long endIndex ) : void
startIndex	long	lower index ///
endIndex	long	one-past the last bit to clear ///
리턴	void

Clone() 공개 메소드

public Clone ( ) : Object
리턴	System.Object

EnsureCapacity() 공개 메소드

Ensure that the long[] is big enough to hold numBits, expanding it if necessary. getNumWords() is unchanged by this call.

public EnsureCapacity ( long numBits ) : void
numBits	long
리턴	void

EnsureCapacityWords() 공개 메소드

Expand the long[] with the size given as a number of words (64 bit longs). getNumWords() is unchanged by this call.

public EnsureCapacityWords ( int numWords ) : void
numWords	int
리턴	void

Equals() 공개 메소드

returns true if both sets have the same bits set

public Equals ( System o ) : bool
o	System
리턴	bool

ExpandingWordNum() 보호된 메소드

protected ExpandingWordNum ( long index ) : int
index	long
리턴	int

FastClear() 공개 메소드

clears a bit. The index should be less than the OpenBitSet size.

public FastClear ( int index ) : void
index	int
리턴	void

FastClear() 공개 메소드

clears a bit. The index should be less than the OpenBitSet size.

public FastClear ( long index ) : void
index	long
리턴	void

FastFlip() 공개 메소드

flips a bit. The index should be less than the OpenBitSet size.

public FastFlip ( int index ) : void
index	int
리턴	void

FastFlip() 공개 메소드

flips a bit. The index should be less than the OpenBitSet size.

public FastFlip ( long index ) : void
index	long
리턴	void

FastGet() 공개 메소드

Returns true or false for the specified bit index. The index should be less than the OpenBitSet size

public FastGet ( int index ) : bool
index	int
리턴	bool

FastGet() 공개 메소드

Returns true or false for the specified bit index. The index should be less than the OpenBitSet size.

public FastGet ( long index ) : bool
index	long
리턴	bool

FastSet() 공개 메소드

Sets the bit at the specified index. The index should be less than the OpenBitSet size.

public FastSet ( int index ) : void
index	int
리턴	void

FastSet() 공개 메소드

Sets the bit at the specified index. The index should be less than the OpenBitSet size.

public FastSet ( long index ) : void
index	long
리턴	void

Flip() 공개 메소드

flips a bit, expanding the set size if necessary

public Flip ( long index ) : void
index	long
리턴	void

Flip() 공개 메소드

Flips a range of bits, expanding the set size if necessary

public Flip ( long startIndex, long endIndex ) : void
startIndex	long	lower index ///
endIndex	long	one-past the last bit to flip ///
리턴	void

FlipAndGet() 공개 메소드

flips a bit and returns the resulting bit value. The index should be less than the OpenBitSet size.

public FlipAndGet ( int index ) : bool
index	int
리턴	bool

FlipAndGet() 공개 메소드

flips a bit and returns the resulting bit value. The index should be less than the OpenBitSet size.

public FlipAndGet ( long index ) : bool
index	long
리턴	bool

Get() 공개 메소드

Returns true or false for the specified bit index.

public Get ( int index ) : bool
index	int
리턴	bool

Get() 공개 메소드

Returns true or false for the specified bit index

public Get ( long index ) : bool
index	long
리턴	bool

GetAndSet() 공개 메소드

Sets a bit and returns the previous value. The index should be less than the OpenBitSet size.

public GetAndSet ( int index ) : bool
index	int
리턴	bool

GetAndSet() 공개 메소드

Sets a bit and returns the previous value. The index should be less than the OpenBitSet size.

public GetAndSet ( long index ) : bool
index	long
리턴	bool

GetBit() 공개 메소드

returns 1 if the bit is set, 0 if not. The index should be less than the OpenBitSet size

public GetBit ( int index ) : int
index	int
리턴	int

GetHashCode() 공개 메소드

public GetHashCode ( ) : int
리턴	int

Intersect() 공개 메소드

this = this AND other

public Intersect ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

IntersectionCount() 공개 정적인 메소드

Returns the popcount or cardinality of the intersection of the two sets. Neither set is modified.

public static IntersectionCount ( OpenBitSet a, OpenBitSet b ) : long
a	OpenBitSet
b	OpenBitSet
리턴	long

Intersects() 공개 메소드

returns true if the sets have any elements in common

public Intersects ( OpenBitSet other ) : bool
other	OpenBitSet
리턴	bool

IsEmpty() 공개 메소드

Returns true if there are no set bits

public IsEmpty ( ) : bool
리턴	bool

Iterator() 공개 메소드

public Iterator ( ) : Lucene.Net.Search.DocIdSetIterator
리턴	Lucene.Net.Search.DocIdSetIterator

NextSetBit() 공개 메소드

Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.

public NextSetBit ( int index ) : int
index	int
리턴	int

NextSetBit() 공개 메소드

Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.

public NextSetBit ( long index ) : long
index	long
리턴	long

OpenBitSet() 공개 메소드

public OpenBitSet ( ) : System
리턴	System

OpenBitSet() 공개 메소드

Constructs an OpenBitSet large enough to hold numBits.

public OpenBitSet ( long numBits ) : System
numBits	long	///
리턴	System

OpenBitSet() 공개 메소드

Constructs an OpenBitSet from an existing long[].
The first 64 bits are in long[0], with bit index 0 at the least significant bit, and bit index 63 at the most significant. Given a bit index, the word containing it is long[index/64], and it is at bit number index%64 within that word.

numWords are the number of elements in the array that contain set bits (non-zero longs). numWords should be <= bits.length, and any existing words in the array at position >= numWords should be zero.

public OpenBitSet ( long bits, int numWords ) : System
bits	long
numWords	int
리턴	System

Or() 공개 메소드

public Or ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

Remove() 공개 메소드

Remove all elements set in other. this = this AND_NOT other

public Remove ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

Set() 공개 메소드

sets a bit, expanding the set size if necessary

public Set ( long index ) : void
index	long
리턴	void

Set() 공개 메소드

Sets a range of bits, expanding the set size if necessary

public Set ( long startIndex, long endIndex ) : void
startIndex	long	lower index ///
endIndex	long	one-past the last bit to set ///
리턴	void

Size() 공개 메소드

Returns the current capacity of this set. Included for compatibility. This is *not* equal to Cardinality

public Size ( ) : long
리턴	long

TrimTrailingZeros() 공개 메소드

Lowers numWords, the number of words in use, by checking for trailing zero words.

public TrimTrailingZeros ( ) : void
리턴	void

Union() 공개 메소드

this = this OR other

public Union ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

UnionCount() 공개 정적인 메소드

Returns the popcount or cardinality of the union of the two sets. Neither set is modified.

public static UnionCount ( OpenBitSet a, OpenBitSet b ) : long
a	OpenBitSet
b	OpenBitSet
리턴	long

Xor() 공개 메소드

this = this XOR other

public Xor ( OpenBitSet other ) : void
other	OpenBitSet
리턴	void

XorCount() 공개 정적인 메소드

Returns the popcount or cardinality of the exclusive-or of the two sets. Neither set is modified.

public static XorCount ( OpenBitSet a, OpenBitSet b ) : long
a	OpenBitSet
b	OpenBitSet
리턴	long

프로퍼티 상세

internalbits 보호되어 있는 프로퍼티

protected long[] internalbits
리턴	long[]

wlen 보호되어 있는 프로퍼티

protected int wlen
리턴	int