|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Package it.unimi.dsi.webgraph.algo |
---|
Class it.unimi.dsi.webgraph.algo.HyperApproximateNeighbourhoodFunction extends IntHyperLogLogCounterArray implements Serializable |
---|
serialVersionUID: 1L
Serialization Methods |
---|
private void writeObject(ObjectOutputStream oos) throws IOException
NotSerializableException
, as this class implements Serializable
because it extends IntHyperLogLogCounterArray
, but it's not really.
IOException
Serialized Fields |
---|
boolean gotTranpose
boolean systolic
boolean preLocal
HyperApproximateNeighbourhoodFunction.systolic
and less than 1% nodes were modified).
boolean local
long[][] bits
boolean doSumOfDistances
HyperApproximateNeighbourhoodFunction.sumOfDistances
is null
.
boolean doHarmonicCentrality
HyperApproximateNeighbourhoodFunction.harmonicCentrality
is null
.
float[] sumOfDistances
float[] harmonicCentrality
boolean longwordAligned
long counterResidualMask
IntHyperLogLogCounterArray.counterSize
%
Long.SIZE
lowest bits).
int numNodes
long numArcs
double squareNumNodes
HyperApproximateNeighbourhoodFunction.numNodes
, cached.
int numberOfThreads
int bufferSize
int granularity
Long.SIZE
.
int adaptiveGranularity
HyperApproximateNeighbourhoodFunction.granularity
to the current ratio of modified nodes). Must be a multiple of Long.SIZE
.
double last
HyperApproximateNeighbourhoodFunction.iterate()
.
int iteration
File updateFile
HyperApproximateNeighbourhoodFunction.external
is true, the name of the temporary file that will be used to write the update list.
FileChannel fileChannel
HyperApproximateNeighbourhoodFunction.external
is true, a file channel used to write to the update list.
RandomAccessFile randomAccessFile
HyperApproximateNeighbourhoodFunction.external
is true, the random-access file underlying HyperApproximateNeighbourhoodFunction.fileChannel
.
ByteBuffer byteBuffer
ProgressLogger pl
null
.
ReentrantLock lock
Condition allWaiting
Condition start
long[] msbMask
registerSize * (i + 1) - 1
).
long[] lsbMask
registerSize * i
).
int phase
boolean closed
it.unimi.dsi.webgraph.algo.HyperApproximateNeighbourhoodFunction.IterationThread[] thread
AtomicInteger nodes
AtomicLong arcs
double[] result
int aliveThreads
boolean completed
long numberOfWrites
HyperApproximateNeighbourhoodFunction.fileChannel
.
long totalIoMillis
HyperApproximateNeighbourhoodFunction.fileChannel
.
AtomicLong nextNode
AtomicInteger modified
HyperApproximateNeighbourhoodFunction.iterate()
.
AtomicInteger unwritten
HyperApproximateNeighbourhoodFunction.external
is true, or
the number of counters that did not change their value.
int counterLongwords
Long.SIZE
registers per counter).
double[] lastBlockSum
boolean external
long[][] resultBits
HyperApproximateNeighbourhoodFunction.external
is false, the arrays where results are stored.
LongArrayBitVector[] resultBitVector
HyperApproximateNeighbourhoodFunction.external
is false, bit vectors wrapping HyperApproximateNeighbourhoodFunction.resultBits
.
LongBigList[] resultRegisters
HyperApproximateNeighbourhoodFunction.external
is false, a IntHyperLogLogCounterArray.registerSize
-bit views of HyperApproximateNeighbourhoodFunction.resultBits
.
boolean[] modifiedCounter
LongArrayBitVector
) just for access speed.
boolean[] modifiedResultCounter
HyperApproximateNeighbourhoodFunction.modifiedCounter
will be updated with the content of this bit vector by the end of the iteration.
boolean[] nextMustBeChecked
LongArrayBitVector
) just for access speed.
boolean[] mustBeChecked
HyperApproximateNeighbourhoodFunction.modifiedCounter
will be updated with the content of this bit vector by the end of the iteration.
int[] localCheckList
HyperApproximateNeighbourhoodFunction.local
is true, the list of nodes that should be scanned.
IntSet localNextMustBeChecked
HyperApproximateNeighbourhoodFunction.local
is true, the list of nodes that should be scanned on the next iteration. Note that this set is synchronized.
Throwable threadThrowable
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |