- i1Costs - Variable in class edu.ucla.sspace.clustering.criterion.HybridBaseFunction
-
The cost computed for each cluster.
- I1Function - Class in edu.ucla.sspace.clustering.criterion
-
This
CriterionFunction measures the amount of internal similarity for
each computed centroid.
- I1Function() - Constructor for class edu.ucla.sspace.clustering.criterion.I1Function
-
- I2Function - Class in edu.ucla.sspace.clustering.criterion
-
This
CriterionFunction measures the amount of internal similarity for
each computed centroid.
- I2Function() - Constructor for class edu.ucla.sspace.clustering.criterion.I2Function
-
- immutable(DoubleVector) - Static method in class edu.ucla.sspace.vector.Vectors
-
Returns an immutable view of the given DoubleVector.
- immutable(SparseDoubleVector) - Static method in class edu.ucla.sspace.vector.Vectors
-
Returns an immutable view of the given SparseDoubleVector.
- immutable(IntegerVector) - Static method in class edu.ucla.sspace.vector.Vectors
-
Returns an immutable view of the given IntegerVector.
- immutable(SparseIntegerVector) - Static method in class edu.ucla.sspace.vector.Vectors
-
Returns an immutable view of the given SparseIntegerVector.
- immutable(Vector) - Static method in class edu.ucla.sspace.vector.Vectors
-
Returns an immutable view of the given Vector.
- IMPACT_RATE_PROPERTY - Static variable in class edu.ucla.sspace.isa.IncrementalSemanticAnalysis
-
The property to specify the impact rate of word co-occurrence.
- in_grouping(char[], int, int) - Method in class org.tartarus.snowball.SnowballProgram
-
- in_grouping_b(char[], int, int) - Method in class org.tartarus.snowball.SnowballProgram
-
- in_range(int, int) - Method in class org.tartarus.snowball.SnowballProgram
-
- in_range_b(int, int) - Method in class org.tartarus.snowball.SnowballProgram
-
- incoming() - Method in class edu.ucla.sspace.graph.SparseDirectedTypedEdgeSet
-
Returns the set of edges that point to the vertex associated with this
edge set.
- incoming() - Method in class edu.ucla.sspace.graph.SparseWeightedDirectedTypedEdgeSet
-
- IncrementalSemanticAnalysis - Class in edu.ucla.sspace.isa
-
An implementation of Incremental Semantic Analysis (ISA).
- IncrementalSemanticAnalysis() - Constructor for class edu.ucla.sspace.isa.IncrementalSemanticAnalysis
-
Creates a new IncrementalSemanticAnalysis instance using the
current System properties for configuration.
- IncrementalSemanticAnalysis(Properties) - Constructor for class edu.ucla.sspace.isa.IncrementalSemanticAnalysis
-
Creates a new IncrementalSemanticAnalysis instance using the
provided properties for configuration.
- inDegree(int) - Method in interface edu.ucla.sspace.graph.DirectedGraph
-
Returns the number of directed edges where vertex is the head of
the edge, i.e.
- inDegree(int) - Method in class edu.ucla.sspace.graph.DirectedMultigraph
-
Returns the number of directed edges where vertex is the head of
the edge, i.e.
- inDegree(int) - Method in class edu.ucla.sspace.graph.SparseDirectedGraph
-
Returns the number of directed edges where vertex is the head of
the edge, i.e.
- inDegree(int) - Method in class edu.ucla.sspace.graph.WeightedDirectedMultigraph
-
Returns the number of directed edges where vertex is the head of
the edge, i.e.
- index - Variable in class edu.ucla.sspace.clustering.BaseSpectralCut.Index
-
- index() - Method in interface edu.ucla.sspace.dependency.DependencyTreeNode
-
- index() - Method in class edu.ucla.sspace.dependency.SimpleDependencyTreeNode
-
- index(G) - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphIndexer
-
Adds the item and creates an index for it, returning that index.
- index() - Method in interface edu.ucla.sspace.util.DoubleEntry
-
Returns the index position of this entry.
- index(T) - Method in class edu.ucla.sspace.util.HashIndexer
-
Adds the item and creates an index for it, returning that index.
- index(T) - Method in interface edu.ucla.sspace.util.Indexer
-
Adds the item and creates an index for it, returning that index.
- index() - Method in interface edu.ucla.sspace.util.IntegerEntry
-
Returns the index position of this entry.
- index() - Method in interface edu.ucla.sspace.util.ObjectEntry
-
Returns the index position of this entry.
- index(T) - Method in class edu.ucla.sspace.util.ObjectIndexer
-
Adds the item and creates an index for it, returning that index.
- INDEX_VECTOR_VARIANCE_PROPERTY - Static variable in class edu.ucla.sspace.index.RandomIndexVectorGenerator
-
The property to specify the variance in the number of values to set in an
TernaryVector.
- indexAll(Collection<G>) - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphIndexer
-
Adds an index for each item in the collection if it did not already
exist, returning true if at least one new index was added.
- indexAll(Collection<T>) - Method in class edu.ucla.sspace.util.HashIndexer
-
Adds an index for each item in the collection if it did not already
exist, returning true if at least one new index was added.
- indexAll(Collection<T>) - Method in interface edu.ucla.sspace.util.Indexer
-
Adds an index for each item in the collection if it did not already
exist, returning true if at least one new index was added.
- indexAll(Collection<T>) - Method in class edu.ucla.sspace.util.ObjectIndexer
-
Adds an index for each item in the collection if it did not already
exist, returning true if at least one new index was added.
- IndexedCounter<T> - Class in edu.ucla.sspace.util
-
A utility for counting unique instance of an object.
- IndexedCounter(Indexer<T>) - Constructor for class edu.ucla.sspace.util.IndexedCounter
-
Creates an empty Counter that uses the provided indexer to map
countable values to corresponding indices.
- IndexedCounter(Indexer<T>, boolean) - Constructor for class edu.ucla.sspace.util.IndexedCounter
-
Creates an empty Counter that uses the provided indexer to map
countable values to corresponding indices.
- Indexer<T> - Interface in edu.ucla.sspace.util
-
A utility class for mapping a set of objects to unique indices.
- IndexVectorUtil - Class in edu.ucla.sspace.ri
-
A utility class for loading and saving word-to-
TernaryVector
mappings.
- inEdges(int) - Method in interface edu.ucla.sspace.graph.DirectedGraph
-
Returns the set of directed edges where vertex is the head of the
edge
- inEdges(int) - Method in class edu.ucla.sspace.graph.DirectedMultigraph
-
Returns the set of directed edges where vertex is the head of the
edge
- inEdges() - Method in class edu.ucla.sspace.graph.SparseDirectedEdgeSet
-
Returns the set of
DirectedEdge instances that point to the root
vertex.
- inEdges(int) - Method in class edu.ucla.sspace.graph.SparseDirectedGraph
-
Returns the set of directed edges where vertex is the head of the
edge
- inEdges(int) - Method in class edu.ucla.sspace.graph.WeightedDirectedMultigraph
-
Returns the set of directed edges where vertex is the head of the
edge
- info(Logger, String, Object...) - Static method in class edu.ucla.sspace.util.LoggerUtil
-
- initialize(Matrix) - Static method in class edu.ucla.sspace.matrix.factorization.NonNegativeMatrixFactorizationMultiplicative
-
Initializes every value in m to be a random value between 0 and
1, inclusive.
- initialize(Matrix) - Static method in class edu.ucla.sspace.matrix.factorization.NonNegativeMatrixFactorizationOPL
-
Initializes every value in m to be a random value between 0 and
1, inclusive.
- initialize(Reader) - Method in class edu.ucla.sspace.text.DirectoryCorpusReader
-
Unsupported.
- INNER_ITERATIONS - Static variable in class edu.ucla.sspace.matrix.factorization.NonNegativeMatrixFactorizationMultiplicative
-
The System Property used to define the number inner multiplicative
iterations to use when decomposing a matrix.
- insert(int, int, String) - Method in class org.tartarus.snowball.SnowballProgram
-
- insert(int, int, CharSequence) - Method in class org.tartarus.snowball.SnowballProgram
-
- insideRange(Calendar, Calendar) - Method in class edu.ucla.sspace.util.TimeSpan
-
Returns true if the end date occurs after the start date during
the period of time represented by this time span.
- insideRange(Date, Date) - Method in class edu.ucla.sspace.util.TimeSpan
-
Returns true if the end date occurs after the start date during
the period of time represented by this time span.
- insideRange(long, long) - Method in class edu.ucla.sspace.util.TimeSpan
-
Returns true if the end date occurs after the start date during
the period of time represented by this time span.
- instanceOf(T) - Static method in class edu.ucla.sspace.vector.Vectors
-
Creates a Vector instance of the same type and length of the
provided vector.
- IntCollection - Interface in edu.ucla.sspace.util.primitive
-
A refinement of the
Collection interface for implementations that
store
int values.
- IntegerEntry - Interface in edu.ucla.sspace.util
-
An object that represents an index that has an associated int
value.
- IntegerMap<V> - Class in edu.ucla.sspace.util
-
A space-optimized map for associating integer keys with values, which also
doubles as a sparse object array.
- IntegerMap() - Constructor for class edu.ucla.sspace.util.IntegerMap
-
Creates a new map.
- IntegerMap(Map<Integer, ? extends V>) - Constructor for class edu.ucla.sspace.util.IntegerMap
-
Creates a new map with the mappings contained in m.
- IntegerMap(V[]) - Constructor for class edu.ucla.sspace.util.IntegerMap
-
Creates a sparse copy of the provided object array, retaining only those
non-null values and their associated indices.
- IntegerVector - Interface in edu.ucla.sspace.vector
-
An Integer based Vector.
- IntegerVectorGenerator<T extends IntegerVector> - Interface in edu.ucla.sspace.index
-
An interface for classes which will maintain and generate random IntegerVectors.
- IntIntHashMultiMap - Class in edu.ucla.sspace.util.primitive
-
A
MultiMap implementation for mapping
int primitives as both
keys and values using a hashing strategy.
- IntIntHashMultiMap() - Constructor for class edu.ucla.sspace.util.primitive.IntIntHashMultiMap
-
- IntIntHashMultiMap(Map<Integer, Integer>) - Constructor for class edu.ucla.sspace.util.primitive.IntIntHashMultiMap
-
Constructs this map and adds in all the mapping from the provided Map
- IntIntMultiMap - Interface in edu.ucla.sspace.util.primitive
-
A
MultiMap subinterface for mapping
int primitives as both
keys and values.
- IntIterator - Interface in edu.ucla.sspace.util.primitive
-
A refinement of the
Iterator interface for iterating over primitive
int values.
- IntPair - Class in edu.ucla.sspace.util.primitive
-
A utility class for holding two ints.
- IntPair(int, int) - Constructor for class edu.ucla.sspace.util.primitive.IntPair
-
Creates a pair out of x and y
- IntSet - Interface in edu.ucla.sspace.util.primitive
-
A refinement of the
Set interface for implementations that store
int values.
- inverse() - Method in interface edu.ucla.sspace.util.BiMap
-
Returns a reversed form of this
BiMap, where values in this
BiMap will map to keys in this
BiMap.
- inverse() - Method in class edu.ucla.sspace.util.HashBiMap
-
Returns a reversed form of this
BiMap, where values in this
BiMap will map to keys in this
BiMap.
- inverse(double[]) - Method in class jnt.FFT.ComplexDouble2DFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[], int) - Method in class jnt.FFT.ComplexDouble2DFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[]) - Method in class jnt.FFT.ComplexDoubleFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[], int, int) - Method in class jnt.FFT.ComplexDoubleFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[]) - Method in class jnt.FFT.ComplexFloat2DFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[], int) - Method in class jnt.FFT.ComplexFloat2DFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[]) - Method in class jnt.FFT.ComplexFloatFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[], int, int) - Method in class jnt.FFT.ComplexFloatFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[]) - Method in class jnt.FFT.RealDoubleFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[], int, int) - Method in class jnt.FFT.RealDoubleFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[], int, int) - Method in class jnt.FFT.RealDoubleFFT_Even
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(double[]) - Method in class jnt.FFT.RealDoubleFFT_Even
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[]) - Method in class jnt.FFT.RealFloat2DFFT_Even
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[], int) - Method in class jnt.FFT.RealFloat2DFFT_Even
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[]) - Method in class jnt.FFT.RealFloatFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inverse(float[], int, int) - Method in class jnt.FFT.RealFloatFFT
-
Compute the (nomalized) inverse FFT of data, leaving it in place.
- inversePreference(String) - Method in class edu.ucla.sspace.svs.SelectionalPreference
-
- inverseSelPreferences - Variable in class edu.ucla.sspace.svs.SelectionalPreference
-
- isAbbreviation(String) - Static method in class edu.ucla.sspace.tools.ConvertCorpusToOneSentencePerLine
-
- isAdjective(String) - Static method in class edu.ucla.sspace.dv.PennTags
-
Returns true if this part of speech tag can be used to label an
adjective in the Penn tag set.
- isAdverb(String) - Static method in class edu.ucla.sspace.dv.PennTags
-
Returns true if this part of speech tag can be used to label an
adverb in the Penn tag set.
- IsaMain - Class in edu.ucla.sspace.mains
-
- isDead() - Method in interface edu.ucla.sspace.graph.isomorphism.State
-
Returns true if the current state of mapping cannot proceed
because some invalid mapping has occurred and no further pairs would
result in an isomorphic match.
- isDead() - Method in class edu.ucla.sspace.graph.isomorphism.TypedVF2State
-
Returns true if the current state of mapping cannot proceed
because some invalid mapping has occurred and no further pairs would
result in an isomorphic match.
- isDead() - Method in class edu.ucla.sspace.graph.isomorphism.VF2State
-
Returns true if the current state of mapping cannot proceed
because some invalid mapping has occurred and no further pairs would
result in an isomorphic match.
- isEmpty() - Method in class edu.ucla.sspace.graph.SparseDirectedEdgeSet
- isEmpty() - Method in class edu.ucla.sspace.graph.SparseDirectedTypedEdgeSet
- isEmpty() - Method in class edu.ucla.sspace.graph.SparseTypedEdgeSet
- isEmpty() - Method in class edu.ucla.sspace.graph.SparseWeightedDirectedTypedEdgeSet
- isEmpty() - Method in class edu.ucla.sspace.util.CombinedSet
-
Returns true if all the sets are empty.
- isEmpty() - Method in class edu.ucla.sspace.util.DisjointSets
-
Returns true if all the sets are empty.
- isEmpty() - Method in class edu.ucla.sspace.util.GeneratorMap
- isEmpty() - Method in class edu.ucla.sspace.util.HashBiMap
- isEmpty() - Method in class edu.ucla.sspace.util.HashMultiMap
-
Returns true if this multi-map contains no mappings.
- isEmpty() - Method in interface edu.ucla.sspace.util.MultiMap
-
Returns true if this multi-map contains no mappings.
- isEmpty() - Method in class edu.ucla.sspace.util.OpenIntSet
-
- isEmpty() - Method in class edu.ucla.sspace.util.primitive.CompactIntSet
-
- isEmpty() - Method in class edu.ucla.sspace.util.primitive.IntIntHashMultiMap
-
Returns true if this multi-map contains no mappings.
- isEmpty() - Method in class edu.ucla.sspace.util.primitive.TroveIntSet
-
- isEmpty() - Method in class edu.ucla.sspace.util.SetDecorator
-
- isEmpty() - Method in class edu.ucla.sspace.util.TreeMultiMap
-
Returns true if this multi-map contains no mappings.
- isEmpty() - Method in class edu.ucla.sspace.util.TrieSet
-
Returns true if this set contains no elements.
- isFeasiblePair(int, int) - Method in interface edu.ucla.sspace.graph.isomorphism.State
-
Returns true if mapping node1 to node2 would
preseve the isomorphism between the graphs to the extend that their
vertices have been mapped thusfar.
- isFeasiblePair(int, int) - Method in class edu.ucla.sspace.graph.isomorphism.TypedVF2State
-
Returns true if mapping node1 to node2 would
preseve the isomorphism between the graphs to the extend that their
vertices have been mapped thusfar.
- isFeasiblePair(int, int) - Method in class edu.ucla.sspace.graph.isomorphism.VF2State
-
Returns true if mapping node1 to node2 would
preseve the isomorphism between the graphs to the extend that their
vertices have been mapped thusfar.
- isFinished() - Method in class edu.ucla.sspace.matrix.ClutoDenseMatrixBuilder
-
Returns true if no further data should be added to the matrix and
the file containing the data is available for us.
- isFinished() - Method in class edu.ucla.sspace.matrix.ClutoSparseMatrixBuilder
-
Returns true if no further data should be added to the matrix and
the file containing the data is available for us.
- isFinished() - Method in class edu.ucla.sspace.matrix.MatlabSparseMatrixBuilder
-
Returns true if no further data should be added to the matrix and
the file containing the data is available for us.
- isFinished() - Method in interface edu.ucla.sspace.matrix.MatrixBuilder
-
Returns true if no further data should be added to the matrix and
the file containing the data is available for us.
- isFinished() - Method in class edu.ucla.sspace.matrix.SvdlibcSparseBinaryMatrixBuilder
-
Returns true if no further data should be added to the matrix and
the file containing the data is available for us.
- isGoal() - Method in interface edu.ucla.sspace.graph.isomorphism.State
-
Returns true if all the vertices have been mapped.
- isGoal() - Method in class edu.ucla.sspace.graph.isomorphism.TypedVF2State
-
Returns true if all the vertices have been mapped.
- isGoal() - Method in class edu.ucla.sspace.graph.isomorphism.VF2State
-
Returns true if all the vertices have been mapped.
- isInitial(String) - Static method in class edu.ucla.sspace.tools.ConvertCorpusToOneSentencePerLine
-
- isMatlabAvailable() - Static method in class edu.ucla.sspace.matrix.SVD
-
Returns true if Matlab is available
- isMaximize() - Method in interface edu.ucla.sspace.clustering.criterion.CriterionFunction
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.E1Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.G1Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.H1Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.H2Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.I1Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMaximize() - Method in class edu.ucla.sspace.clustering.criterion.I2Function
-
Returns true if this
CriterionFunction tries to maximize it's
score, and false otherwise.
- isMultiThreaded - Variable in class edu.ucla.sspace.mains.GenericMain
-
Whether the
SemanticSpace class is capable of running with
multiple threads.
- isNoun(String) - Static method in class edu.ucla.sspace.dv.PennTags
-
Returns true if this part of speech tag can be used to label a
noun in the Penn tag set.
- isOctaveAvailable() - Static method in class edu.ucla.sspace.matrix.SVD
-
Returns true if Octave is available
- IsomorphicGraphCounter<G extends Graph<? extends Edge>> - Class in edu.ucla.sspace.graph.isomorphism
-
A special-purpose
Counter that counts graphs based on
isomorphism, rather
than object equivalence (which may take into account vertex labeling, etc.).
- IsomorphicGraphCounter() - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter
-
Creates a new
IsomorphicGraphCounter with the default
IsomorphismTester that tests for structural equivalence.
- IsomorphicGraphCounter(IsomorphismTester) - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter
-
Creates a new IsomorphicGraphCounter with the specified isomorphism tester.
- IsomorphicGraphCounter(Collection<? extends G>) - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter
-
Creates a new IsomorphicGraphCounter that counts only the specified motifs.
- IsomorphicSet<G extends Graph<? extends Edge>> - Class in edu.ucla.sspace.graph.isomorphism
-
A
Set of
Graph instances that maintains the invariant that
all graphs in the set are non-isomorphisms of each other.
- IsomorphicSet() - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicSet
-
Creates an empty set of structurally isomorphic graphs
- IsomorphicSet(IsomorphismTester) - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicSet
-
Creates an empty set of isomorphic graphs whose isomorphism is measured
according to the provided tester's isomorphic constraints.
- IsomorphicSet(Collection<? extends G>) - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicSet
-
Creates a set of structurally isomorphic graphs from those in the
provided collection.
- IsomorphicSet(IsomorphismTester, Collection<? extends G>) - Constructor for class edu.ucla.sspace.graph.isomorphism.IsomorphicSet
-
Creates an empty set of isomorphic graphs from those in the collection
using the provided tester's isomorphic constraints.
- IsomorphismTester - Interface in edu.ucla.sspace.graph.isomorphism
-
An interface for algorithms that detect whether two graphs are
isomorphic.
- isReadOnly() - Method in class edu.ucla.sspace.basis.AbstractBasisMapping
-
Returns true if the
BasisMapping is read only, false otherwise.
- isReadOnly() - Method in interface edu.ucla.sspace.basis.BasisMapping
-
Returns true if the
BasisMapping is read only, false otherwise.
- isReadOnly() - Method in class edu.ucla.sspace.dv.PathBasedBasisMapping
-
Returns true if the
BasisMapping is read only, false otherwise.
- isReadOnly() - Method in class edu.ucla.sspace.dv.RelationPathBasisMapping
-
Returns true if the
BasisMapping is read only, false otherwise.
- isSVDLIBCavailable() - Static method in class edu.ucla.sspace.matrix.SVD
-
Returns true if the SVDLIBC library is available
- isSymmetric() - Method in class edu.ucla.sspace.similarity.AbstractSymmetricSimilarityFunction
-
Returns true.
- isSymmetric() - Method in class edu.ucla.sspace.similarity.KLDivergence
-
Returns false (is asymmetric).
- isSymmetric() - Method in interface edu.ucla.sspace.similarity.SimilarityFunction
-
Returns true if sim(A,B) == sim(B,A) is true for any A,
B.
- isVerb(String) - Static method in class edu.ucla.sspace.dv.PennTags
-
Returns true if this part of speech tag can be used to label a
verb in the Penn tag set.
- ItalianStemmer - Class in edu.ucla.sspace.text
-
- ItalianStemmer() - Constructor for class edu.ucla.sspace.text.ItalianStemmer
-
- italianStemmer - Class in org.tartarus.snowball.ext
-
This class was automatically generated by a Snowball to Java compiler
It implements the stemming algorithm defined by a snowball script.
- italianStemmer() - Constructor for class org.tartarus.snowball.ext.italianStemmer
-
- items() - Method in class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter
-
Returns a view of the items currently being counted.
- items() - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphCounter
-
Returns a view of the items currently being counted.
- items() - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphIndexer
-
Returns an unmodifiable view of the items currently mapped to indices
- items() - Method in interface edu.ucla.sspace.util.Counter
-
Returns a view of the items currently being counted.
- items() - Method in class edu.ucla.sspace.util.HashIndexer
-
Returns an unmodifiable view of the items currently mapped to indices
- items() - Method in class edu.ucla.sspace.util.IndexedCounter
-
Returns a view of the items currently being counted.
- items() - Method in interface edu.ucla.sspace.util.Indexer
-
Returns an unmodifiable view of the items currently mapped to indices
- items() - Method in class edu.ucla.sspace.util.ObjectCounter
-
Returns a view of the items currently being counted.
- items() - Method in class edu.ucla.sspace.util.ObjectIndexer
-
Returns an unmodifiable view of the items currently mapped to indices
- items() - Method in class edu.ucla.sspace.util.PairCounter
-
Returns a view of the pairs currently being counted.
- ITERATIONS - Static variable in class edu.ucla.sspace.matrix.factorization.NonNegativeMatrixFactorizationOPL
-
The System Property used to define the number of gradient iterations used
when decomposing a matrix.
- IterativeBigramExtractor - Class in edu.ucla.sspace.tools
-
- IterativeBigramExtractor() - Constructor for class edu.ucla.sspace.tools.IterativeBigramExtractor
-
- iterator() - Method in class edu.ucla.sspace.clustering.Assignments
-
Returns an iterator over the
Assignment objects stored.
- iterator() - Method in interface edu.ucla.sspace.dependency.DependencyPath
-
Returns an iterator over all the relations in the path in order from
closest to the root to furthest.
- iterator() - Method in class edu.ucla.sspace.dependency.SimpleDependencyPath
-
Returns an iterator over all the relations in the path in order from
closest to the root to furthest.
- iterator() - Method in class edu.ucla.sspace.graph.AbstractGraph
- iterator() - Method in class edu.ucla.sspace.graph.AbstractGraph.Subgraph
- iterator() - Method in class edu.ucla.sspace.graph.GenericEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter
-
Returns an interator over the elements that have been counted thusfar and
their respective counts.
- iterator() - Method in class edu.ucla.sspace.graph.isomorphism.IsomorphicSet
-
- iterator() - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphCounter
-
Returns an interator over the elements that have been counted thusfar and
their respective counts.
- iterator() - Method in class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphIndexer
-
Returns an iterator over all the objects and their corresponding indices.
- iterator() - Method in class edu.ucla.sspace.graph.SparseDirectedEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.SparseDirectedTypedEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.SparseTypedEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.SparseUndirectedEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.SparseWeightedDirectedTypedEdgeSet
- iterator() - Method in class edu.ucla.sspace.graph.SparseWeightedEdgeSet
- iterator() - Method in class edu.ucla.sspace.matrix.MatrixFile
-
Returns an iterator over all the entries in the matrix.
- iterator() - Method in class edu.ucla.sspace.text.TermAssociationFinder
-
Returns an iterator over all the bigram pairs with their corresponding
association scores
- iterator() - Method in class edu.ucla.sspace.util.CombinedSet
-
Returns an iterator over all the unique items across all sets.
- iterator() - Method in interface edu.ucla.sspace.util.Counter
-
Returns an interator over the elements that have been counted thusfar and
their respective counts.
- iterator() - Method in class edu.ucla.sspace.util.DirectoryWalker
-
Returns an iterator over all the files recursively accessible from this
FileWalker's base directory
- iterator() - Method in class edu.ucla.sspace.util.DisjointSets
-
Returns an iterator over all the unique items across all sets.
- iterator() - Method in class edu.ucla.sspace.util.HashIndexer
-
Returns an iterator over all the objects and their corresponding indices.
- iterator() - Method in class edu.ucla.sspace.util.IndexedCounter
-
Returns an interator over the elements that have been counted thusfar and
their respective counts.
- iterator() - Method in interface edu.ucla.sspace.util.Indexer
-
Returns an iterator over all the objects and their corresponding indices.
- iterator() - Method in class edu.ucla.sspace.util.LineReader
-
Returns an iterator over the lines in the file.
- iterator() - Method in class edu.ucla.sspace.util.ObjectCounter
-
Returns an interator over the elements that have been counted thusfar and
their respective counts.
- iterator() - Method in class edu.ucla.sspace.util.ObjectIndexer
-
Returns an iterator over all the objects and their corresponding indices.
- iterator() - Method in class edu.ucla.sspace.util.OpenIntSet
-
- iterator() - Method in class edu.ucla.sspace.util.PairCounter
-
Returns an iterator over the pairs that have been counted thusfar and
their respective counts.
- iterator() - Method in class edu.ucla.sspace.util.primitive.AbstractIntSet
-
- iterator() - Method in class edu.ucla.sspace.util.primitive.CompactIntSet
-
- iterator() - Method in interface edu.ucla.sspace.util.primitive.IntCollection
-
- iterator() - Method in interface edu.ucla.sspace.util.primitive.IntSet
-
- iterator() - Method in class edu.ucla.sspace.util.primitive.TroveIntSet
-
- iterator() - Method in class edu.ucla.sspace.util.SetDecorator
-
- iterator() - Method in class edu.ucla.sspace.util.SparseDoubleArray
-
Returns an iterator over the non-zero values in this array.
- iterator() - Method in class edu.ucla.sspace.util.SparseHashArray
-
Returns an iterator over the non-null values in this array.
- iterator() - Method in class edu.ucla.sspace.util.SparseIntArray
-
Returns an iterator over the non-zero values in this array.
- iterator() - Method in class edu.ucla.sspace.util.TrieSet
-
Returns an iterator over the elements in this set.
- iterator() - Method in class edu.ucla.sspace.vector.CompactSparseIntegerVector
-
Returns an iterator over all the non-zero indices and values in this
vector.
- iterator() - Method in class edu.ucla.sspace.vector.CompactSparseVector
-
Returns an iterator over all the non-zero indices and values in this
vector.
- iterator() - Method in class edu.ucla.sspace.vector.SparseHashIntegerVector
-
Returns an iterator over the non-0 values in this vector.
- ITERATOR_FACTORY_PROPERTIES - Static variable in class edu.ucla.sspace.text.IteratorFactory
-
A list of all the factory properties supported for configuration by the
IteratorFactory.
- IteratorDecorator<T> - Class in edu.ucla.sspace.util
-
A decorator around an existing
Iterator that is designed to
facilitate subclasses that need to extend the functionality of an existing
iterator.
- IteratorDecorator(Iterator<T>) - Constructor for class edu.ucla.sspace.util.IteratorDecorator
-
Creates a new decorator around the existing iterator.
- IteratorFactory - Class in edu.ucla.sspace.text
-
A factory class for generating
Iterator<String> tokenizers for
streams of tokens such as
BufferedReader instances.