Return the number of free <code>Entry</code>s in this node.
@return The number of free <code>Entry</code>s in this node.
@see Entry
425787
protected int numFreeEntries() {
        int res = 0;
        for (int i = 0; i < entries.length; i++) {
            Entry entry = entries[i];
            if (entry.isEmpty()) {
                res++;
            }
        }

        assert (NUMBER_ENTRIES == entries.length);
        return res;
    }
1170093
int traverseAndCountElements() {
		int num = 0;

		for (Entry<?, ?> entry : table) {
			while (entry != null) {
				num++;
				entry = entry.next;
			}
		}

		return num;
	}
1260552
public int getCertNum() {
        for (int i = this.certChain.length - 1; i >= 0; i--) {
            if (!this.certChain[i].getSubjectDN().equals(this.certChain[i].getIssuerDN())) {
                return i + 1;
            }
        }
        return this.certChain.length;
    }
1082497
public final Set<Entry<String, L[]>> getEntries() {
        return (this.map != null)
                ? this.map.entrySet()
                : Collections.<Entry<String, L[]>>emptySet();
    }
955004
public function numberOfSubGraph(): int {
        if (null === $this->getNodes()) return 0;
        $c = 0;
        $v = new ArrayList();

        foreach ($this->getNodes() as $node) {
            if ($v->containsValue($node)) continue;
            $c++;
            $this->flood($node, $v);
        }
        return $c;
    }
880860
public int getTotalFree(){
		int total=0;
		for (int i=0; i < this.partitionCount && this.partitions[i] != null ; i++){
			total+=this.partitions[i].getAvailableConnections();
		}
		return total;
	}
880676
public long getNumberOfRequestsIssued()
  {
    if (TraceComponent.isAnyTracingEnabled() && tc.isEntryEnabled()) 
      SibTr.entry(tc, "getNumberOfRequestsIssued");
    long returnValue = anycastIH.getTotalSentRequests();   
    if (TraceComponent.isAnyTracingEnabled() && tc.isEntryEnabled()) 
      SibTr.exit(tc, "getNumberOfRequestsIssued", Long.valueOf(returnValue));     
    return returnValue;
  }
860268
public final CharSequence getEntry() {
        int index = indexOf(value);
        return index >= 0 && getEntries() != null ? getEntries()[index] : null;
    }
56410
@Override
    public Object get() {

        Object oObject = null;
        getCount++;

        // Check if any are free in the free hashtable
        if (lastEntry > -1) {
            // Free array has entries, get the last one.
            // remove last one for best performance
            oObject = free[lastEntry];
            free[lastEntry] = null;
            if (lastEntry == firstEntry) { // none left in pool
                lastEntry = -1;
                firstEntry = -1;
            } else if (lastEntry > 0) {
                lastEntry = lastEntry - 1;
            } else { // last entry = 0, reset to end of list
                lastEntry = poolSize - 1;
            }
        }
        if (oObject == null)
            underflowCount++;
        if (getCurrentNumElements() < minElements)
            minElements = getCurrentNumElements();
        if ((getCount + putCount) > adjustThreshold)
            adjustPoolSize();
        if (oObject == null && factory != null) {
            oObject = factory.create();
        }
        return oObject;
    }
202274
protected Integer getTotalNumberOfChildren() {
        Integer numChildrenNodes = 0;
        for (Level childLevel : levels) {
            numChildrenNodes += childLevel.getTotalNumberOfChildren();
        }
        return nodes.size() + numChildrenNodes;
    }
1147096
public int growSuperNode() {
    if(getNumEntries() < getCapacity()) {
      throw new IllegalStateException("This node is not yet overflowing (only " + getNumEntries() + " of " + getCapacity() + " entries)");
    }
    Entry[] old_nodes = super.entries.clone();
    assert old_nodes[old_nodes.length - 1] != null;
    super.entries = (Entry[]) java.util.Arrays.copyOfRange(old_nodes, 0, getCapacity() * 2 - 1, entries.getClass());
    assert super.entries.length == old_nodes.length * 2 - 1;
    return getCapacity();
  }
878443
public synchronized int getPartitionStoreMoves() {
        int count = 0;
        for (List<Integer> entry : storeToPartitionIds.values())
            count += entry.size();
        return count;
    }
992938
public T alloc() {
    if (numFree == 0) {
      Preconditions.checkState(numAlloc < maxSize);
      numAlloc++;
      return allocator.get();
    } else {
      T item = free[numFree - 1];
      numFree--;
      return item;
    }
  }
1283247
public final int getRemaining()
    {
        int rem = 0;
        for (int ii=0;ii<length;ii++)
        {
            rem += srcs[offset+ii].remaining();
        }
        return rem;
    }
1362066
public final int size()
  {
    if (tc.isEntryEnabled())
      SibTr.entry(tc, "size");
    int result = (m_tail >= m_head) ? (m_tail - m_head) : (m_array.length - m_head + m_tail);
    if (tc.isEntryEnabled())
      SibTr.exit(tc, "size", new Integer(result));
    return result;
  }
680538
public OMVRBTreeEntry<K, V> getPreviousInMemory() {
    OMVRBTreeEntry<K, V> t = this;
    OMVRBTreeEntry<K, V> p = null;

    if (t.getLeftInMemory() != null) {
      p = t.getLeftInMemory();
      while (p.getRightInMemory() != null)
        p = p.getRightInMemory();
    } else {
      p = t.getParentInMemory();
      while (p != null && t == p.getLeftInMemory()) {
        t = p;
        p = p.getParentInMemory();
      }
    }

    return p;
  }
876478
protected int getSize()
   {      
      if (tc.isEntryEnabled()) SibTr.entry(this, tc, "getSize");
      if (tc.isEntryEnabled()) SibTr.exit(this, tc, "getSize", ""+size);
      return size;
   }