Home | History | Annotate | Download | only in gcc

Lines Matching refs:sparse

24 /* Implementation of the Briggs and Torczon sparse set representation.
25    The sparse set representation was first published in:
27    "An Efficient Representation for Sparse Sets",
30    The sparse set representation is suitable for integer sets with a
32    the set.  If an element I is in the set, then sparse[I] is the
33    index of I in the dense vector, and dense[sparse[I]] == I.  The dense
47    Additionally, the sparse set representation supports enumeration of
50    This makes it a competitive choice for iterating over relatively sparse
65    sparse sets will often be superior to alternatives such as simple
67    hash tables, linked lists, etc., if the set is sufficiently sparse.
68    In the LOPLAS paper the cut-off point where sparse sets became faster
73    sparse sets with initially unknown size, linked-list bitmaps are a
76    Sparse sets storage requirements are relatively large: O(U) with a
78    sbitmap with universe U is S, then the storage required for a sparse
80    Accessing the sparse vector is not very cache-friendly, but iterating
91   SPARSESET_ELT_TYPE *sparse;	/* Sparse array.  */
97   SPARSESET_ELT_TYPE elms[2];   /* Combined dense and sparse arrays.  */
144   idx = s->sparse[e];
155   s->sparse[e] = idx;