Collection < Node < T >> function ( ) { if ( preds == null ) { return Collections . emptyList ( ) ; } else { return Collections . unmodifiableCollection ( preds ) ; } }
returns an unordered , possibly immutable set of the nodes that link to this node . concode_field_sep int INITIAL_HASHSET_CAPACITY concode_elem_sep int ARRAYLIST_THRESHOLD concode_elem_sep int hashCode concode_elem_sep T label concode_elem_sep Collection<Node<T>> succs concode_elem_sep Collection<Node<T>> preds concode_field_sep boolean add concode_elem_sep boolean addPredecessor concode_elem_sep T getLabel concode_elem_sep boolean removeSuccessor concode_elem_sep Collection<Node<T>> getSuccessors concode_elem_sep int numSuccessors concode_elem_sep boolean addSuccessor concode_elem_sep void removeAllEdges concode_elem_sep boolean removePredecessor concode_elem_sep boolean remove concode_elem_sep int numPredecessors concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep boolean hasPredecessors concode_elem_sep boolean hasSuccessors concode_elem_sep String toString concode_elem_sep boolean updateField