| java.lang.Object com.hp.hpl.jena.mem.ArrayBunch
ArrayBunch | public class ArrayBunch implements TripleBunch(Code) | | An ArrayBunch implements TripleBunch with a linear search of a short-ish
array of Triples. The array can grow, but it only grows by 4 elements each time
(because, if it gets big enough for this linear growth to be bad, it should anyways
have been replaced by a more efficient set-of-triples implementation).
author: kers |
changes | protected volatile int changes(Code) | | |
ArrayBunch | public ArrayBunch()(Code) | | |
containsBySameValueAs | public boolean containsBySameValueAs(Triple t)(Code) | | |
grow | protected void grow()(Code) | | Note: linear growth is suboptimal (order n2) normally, but
ArrayBunch's are meant for small sets and are replaced by some
sort of hash- or tree- set when they get big; currently "big" means more
than 9 elements, so that's only one growth spurt anyway.
|
|
|