- 2;csrdZ hdd<dd<dd<dd<d d <d d <d d<ddscreators UNSPECIFIEDsprojectsSun, 11-Nov-2001 10:47:39 ESTscreateds$Author: doughellmann $sauthors$Revision: 1.2 $sversions$Date: 2001/11/18 22:13:24 $sdates is0.0Nscompoundspowers docstringscs|idfjo d}n:|o|ddddfjoF|ddjo|o|ddjo |}n d}n| p(|o|ddfjp |dfjo d}n|o|dddd fjo|o|dd d d fjo d}n;|o|dddd fjo |}n |}d |||f}|SdS(sJoin two code snippets into one string. Use some general code content rules to try to make the resulting snippet look nice. s.sis,s(is-s[s{s)s]s}s%s%s%sN(ssecondsstripssep_to_be_usedsfirsts separatorstext(sfirstsseconds separatorstextssep_to_be_used((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pysjoinCodeSnippetss  $,  6 E $  csd}|ot|titifjot|dtitifjo |}n|d}t|d|}x&|D]}t |||}qWnt |}|SdS(sConvert a parse tree to a string which would have parsed in that way. Given a parse tree, walk it to determine the original string which would have been parsed to produce that tree. siicst||S(N(sparseTreeToStringsxss(sxss((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pyssN( stextstreestypestypess TupleTypesListTypes tree_partssmaps separators sub_partssone_partsjoinCodeSnippetssstr(strees separatorsone_partstexts tree_partss sub_parts((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pysparseTreeToStrings )&    cs|tjo g}nt|titifjo |Sn|d|jo|i|n/x(|dD]}t |||qW|SdS(sAReturn a sequence of subtrees starting with node value of 'node'.iiN( sresponsesNonestypestreestypessListTypes TupleTypesnodesappendssubtreesfindNode(streesnodesresponsessubtree((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pysfindNodes "  csbxKt|D]:}y|d}Wntj ofSnXqW|SdS(sBReturn the section of the parse 'tree' that is 'depth' nodes deep.iN(srangesdepthsistrees IndexError(streesdepthsi((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pysdrills icsht|}|tjo  h}n |tijo" |||d<d|fSn|tij oS|ti jo|o|ddjod|fSn||j|fSnt |t |jod|fSnxWt t||D]@\}}"t |||d|\}}#| o$PnqW%||fSdS(sjMatch `data' to `pattern', with variable extraction. pattern -- Pattern to match against, possibly containing variables. data -- Data to be checked and against which variables are extracted. vars -- Dictionary of variables which have already been found. If not provided, an empty dictionary is created. The `pattern' value may contain variables of the form ['varname'] which are allowed to match anything. The value that is matched is returned as part of a dictionary which maps 'varname' to the matched value. 'varname' is not required to be a string object, but using strings makes patterns and the code which uses them more readable. This function returns two values: a boolean indicating whether a match was found and a dictionary mapping variable names to their associated values. iis#sdbgN(stypespatterns pattern_typesvarssNonestypessListTypesdatas TupleTypes StringTypeslensmapsmatchsdbgssame(spatternsdatasvarssdbgs pattern_typessame((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pysmatchs&  +!  cs#+GN|tjo Oh}nPt|tijo"S|||d<Td|fSnUt|tij oX||j|fSnYd}Z|o|oj[x`t t||D[]I\}}^t |||d|\}}_| o`Pn b|}qWnc||fSdS(sMatch `data' to `pattern', with variable extraction. pattern -- Pattern to match against, possibly containing variables. data -- Data to be checked and against which variables are extracted. vars -- Dictionary of variables which have already been found. If not provided, an empty dictionary is created. The `pattern' value may contain variables of the form ['varname'] which are allowed to match anything. The value that is matched is returned as part of a dictionary which maps 'varname' to the matched value. 'varname' is not required to be a string object, but using strings makes patterns and the code which uses them more readable. This function is based on the match() function, but is more lenient. The pattern does not have to completely describe the tree. Instead, it can be the 'top' portion of the tree. Everything must match down to the leaves of the pattern. At that point, the matching stops. If a match was found at all, the return values indicate a match. This function returns two values: a boolean indicating whether a match was found and a dictionary mapping variable names to their associated values. iisdbgN( svarssNonestypespatternstypessListTypesdatas TupleTypes found_matchsmaps lenientMatchsdbgssame(spatternsdatasvarssdbgssames found_match((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pys lenientMatch+s"  ! ('s__doc__s __rcs_info__ssplits __version__spprintssymbolstokenstypessstmts compound_stmtsCOMPOUND_STMT_PATTERNstestsand_testsnot_tests comparisonsexprsxor_exprsand_exprs shift_exprs arith_exprstermsfactorsBASE_CLASS_NAME_PATTERNs simple_stmts small_stmts expr_stmtstestlistspowersatomsSTRINGsNEWLINEsDOCSTRING_STMT_PATTERNsjoinCodeSnippetssparseTreeToStringsNonesfindNodesdrillsmatchs lenientMatch(sfindNodesparseTreeToStringssymbolspprintsCOMPOUND_STMT_PATTERNs __rcs_info__stokensBASE_CLASS_NAME_PATTERNsmatchsdrills __version__s lenientMatchsjoinCodeSnippetsstypessDOCSTRING_STMT_PATTERN((sY/home/dhellmann/Personal/Devel/HappyDoc/dist/HappyDoc-r2_1/happydoclib/parseinfo/utils.pys?s$ Q     o # @