boolean function ( Node arg0 , Stack < Node > arg1 ) { for ( Node loc0 : arg1 ) { if ( equalNodes ( arg0 , loc0 ) ) { return true ; } } return false ; }
determine if a node has already been visited already by checking the cycledetectionstack for it 's existence . this method is used -- rather than stack.contains -- because we want to ignore the node 's ` next ' attribute when comparing for equality . concode_field_sep Node node concode_elem_sep PropertyContainer propertyContainer0 concode_elem_sep PropertyContainer propertyContainer1 concode_field_sep void handleVariable concode_elem_sep String transform concode_elem_sep boolean equalNodes concode_elem_sep String lookupKey concode_elem_sep String constructRecursionErrorMessage concode_elem_sep void handleLiteral concode_elem_sep void compileNode concode_elem_sep String variableNodeValue concode_elem_sep String substituteVariable concode_elem_sep Node tokenizeAndParseString