List < Lineage > function ( Lineage arg0 ) { LineageDoesNotExistException . check ( mIdIndex . containsKey ( arg0 . getId ( ) ) , ExceptionMessage . LINEAGE_DOES_NOT_EXIST , arg0 . getId ( ) ) ; return mLineageDAG . getChildren ( arg0 ) ; }
gets all the children of a given lineage . concode_field_sep Map<Long,Lineage> mIdIndex concode_elem_sep LineageIdGenerator mLineageIdGenerator concode_elem_sep DirectedAcyclicGraph<Lineage> mLineageDAG concode_elem_sep Map<Long,Lineage> mOutputFileIndex concode_field_sep List<Lineage> getParents concode_elem_sep void addLineageFromJournal concode_elem_sep boolean hasOutputFile concode_elem_sep List<Lineage> sortLineageTopologically concode_elem_sep List<Lineage> getAllInTopologicalOrder concode_elem_sep void createLineageInternal concode_elem_sep void deleteLineage concode_elem_sep Lineage getLineageOfOutputFile concode_elem_sep void streamToJournalCheckpoint concode_elem_sep List<Lineage> getRootLineages concode_elem_sep Lineage getLineage concode_elem_sep long createLineage