void function ( T arg0 ) { DependencyNode < T > loc0 = new DependencyNode < T > ( arg0 ) ; _nodes . put ( arg0 , loc0 ) ; _orphans . add ( arg0 ) ; }
adds an element with no initial dependencies from the graph . concode_field_sep List<DependencyNode<DT>> parents concode_elem_sep List<DependencyNode<DT>> children concode_elem_sep List<T> _orphans concode_elem_sep Map<T,DependencyNode<T>> _nodes concode_elem_sep DT content concode_field_sep int size concode_elem_sep boolean dependsOn concode_elem_sep boolean isEmpty concode_elem_sep T removeAvailableElement concode_elem_sep ObserverList<T> toObserverList concode_elem_sep void addDependency concode_elem_sep void remove