Searched refs:m_predecessors (Results 1 – 1 of 1) sorted by relevance
260 private Map<T, T> m_predecessors = Maps.newHashMap(); field in Graph.Node278 for (T pred : m_predecessors.values()) { in clone()289 return m_predecessors; in getPredecessors()299 T pred = m_predecessors.get(o); in removePredecessor()301 result = null != m_predecessors.remove(o); in removePredecessor()317 for (T o : m_predecessors.values()) { in toString()327 m_predecessors.put(tm, tm); in addPredecessor()331 return m_predecessors.size() > 0; in hasPredecessors()335 return m_predecessors.containsKey(m); in hasPredecessor()