Lines Matching refs:at
10 * You may obtain a copy of the License at
39 * Retrieval performance is critical, since this is used at the core
157 // total of m_blocksize squared elements, which at the default
158 // size is 4M integers... and we grow by at least that much each
247 * Inserts the specified node in this vector at the specified index.
255 * @param at Index of where to insert
257 private void insertElementAt(int value, int at)
259 if(at==m_firstFree)
261 else if (at>m_firstFree)
263 int index=at>>>m_SHIFT;
274 int offset=at&m_MASK;
280 int index=at>>>m_SHIFT;
283 int offset=at&m_MASK;
332 int at=indexOf(s,0);
333 if(at<0)
335 removeElementAt(at);
340 * Deletes the component at the specified index. Each component in
345 * @param at index of where to remove and int
347 private void removeElementAt(int at)
350 if(at<m_firstFree)
352 int index=at>>>m_SHIFT;
354 int offset=at&m_MASK;
380 * Sets the component at the specified index of this vector to be the
381 * specified object. The previous component at that position is discarded.
387 * @param at Index of where to set the object
389 public void setElementAt(int value, int at)
391 if(at<m_blocksize)
392 m_map0[at]=value;
395 int index=at>>>m_SHIFT;
396 int offset=at&m_MASK;
412 if(at>=m_firstFree)
413 m_firstFree=at+1;
418 * Get the nth element. This is often at the innermost loop of an
423 * @return value at given index. If that value wasn't previously set,
461 * beginning the search at index, and testing for equality
467 * argument in this vector at position index or later in the
501 * beginning the search at index, and testing for equality
506 * argument in this vector at position index or later in the
516 * beginning the search at index, and testing for equality
521 * argument in this vector at position index or later in the