Tryag File Manager
Home
-
Turbo Force
Current Path :
/
usr
/
lib
/
python2.4
/
site-packages
/
_xmlplus
/
xpath
/
Upload File :
New :
File
Dir
//usr/lib/python2.4/site-packages/_xmlplus/xpath/BuiltInExtFunctions.pyc
mò xùžNc @ sb d Z d k Z d k Z d k Z d k Z d k l Z l Z d k l Z d k l Z d k l Z l Z l Z l Z d „ Z d „ Z d d „ Z d d „ Z d d „ Z d d „ Z d „ Z d „ Z d d „ Z d „ Z d „ Z y d k Z d „ Z Wn d Z n Xd „ Z d d „ Z! d d „ Z" d „ Z# d „ Z$ d „ Z% h e d f e <e d f e <e d f e i& d j o e p e <e d f e <e d f e <e d f e <e d f e <e d f e <e d! f e! <e d" f e" <e d# f e# <e d$ f e$ <e d% f e% <e d& f e <e d' f e <e d( f e <e d) f e <e d f e <e d f e <e d f e i& d j o e p e <e d f e <e d f e <e d f e <e d f e <e d f e <e d! f e! <e d" f e" <e d# f e# <e d$ f e$ <e d% f e% <e d& f e <e d' f e <Z' d S(* sñ 4XPath-specific Extension functions WWW: http://4suite.org/XSLT e-mail: support@4suite.org Copyright (c) 2000-2001 Fourthought Inc, USA. All Rights Reserved. See http://4suite.org/COPYRIGHT for license and copyright information N( s Nodes EMPTY_NAMESPACE( s Text( s boolean( s CoreFunctionss Conversionss FT_EXT_NAMESPACEs FT_OLD_EXT_NAMESPACEc C s' y d k l } | SWn d Sn Xd S( N( s __version__s 0.11.1( t Ft.__init__t __version__( t contextR ( ( tF /usr/lib/python2.4/site-packages/_xmlplus/xpath/BuiltInExtFunctions.pyt Version s c C sd t | ƒ t g ƒ j o | Sn t | d ƒ o& | i t i j o t | i ƒ } n | g } | S( s, Convert a result-tree fragment to a node-sett nodeTypeN( t typet rtft hasattrR t Nodet DOCUMENT_NODEt listt childNodest node_set( R R R ( ( R t NodeSet s # c C sM | p | i } n t i | ƒ } t i | | ƒ o t i p t i } | S( s2 Do a regular expression match against the argumentN( t argR t nodet Conversionst StringValuet ret matcht patternt booleant truet falset bool( R R R R ( ( R t Match' s &c C sT | p | i } n t i | ƒ } t i | ƒ } t i | ƒ } t i | | | ƒ S( s5 Do a global search and replace of the string contentsN( R R R R R t oldt newt stringt replace( R R R R ( ( R t Replace0 s c C s4 | p | i } n t i | ƒ } t i | | ƒ } | i } g } xé | D]á } | i ƒ | i d i d t ƒ t | ƒ t f ƒ j o | f } n xM | D]E } | i d i d t ƒ | i d i | ƒ | i d i d ƒ qŸ W| i d i d ƒ | i ƒ } | i i | ƒ | i | i d ƒ qK W| S( sJ Do a regular expression search against the argument (i.e. get all matches)iÿÿÿÿR t Groupi N( R R R R R R t findallR t matchest processort proct matches_nodesett groupst pushResultt writerst startElementt EMPTY_NAMESPACER t groupt textt endElementt popResultt fragt rtfst appendR ( R R R R/ R& R" R+ R% R$ ( ( R t SearchRe; s. c C s` | p | i } n t i | ƒ } | i } g } t i | ƒ } | i | ƒ } x | o| i ƒ | i d i d t ƒ | i ƒ } | p t | i ƒ ƒ } n xT | D]L } | i d i d t ƒ | i d i | p d ƒ | i d i d ƒ q« W| i d i d ƒ | i ƒ } | i i | ƒ | i | i d ƒ | i | | i ƒ ƒ } qS W| S( sJ Do a regular expression search against the argument (i.e. get all matches)iÿÿÿÿR R t i N( R R R R R R# R$ R% R t compileR t _ret searcht _matchR' R( R) R* R& t _groupst tupleR+ R, R- R. R/ R0 R1 R t end( R R R R8 R+ R5 R7 R% R/ R$ ( ( R t SearchRePy20V s4 c G s t | d | i ƒ\ } } t i t ƒ p t i i t d ƒ } | p t d | ƒ ‚ n t g t | ƒ } d „ } t t | | f | ƒ } | i } g } xe | D]] } | i ƒ | i d i t i | ƒ ƒ | i ƒ } | i i! | ƒ | i! | i" d ƒ q¦ W| S( sÍ Apply the function serially over the given node sets. In iteration i, the function is passed N parameters where N is the number of argument node sets. Each parameter is a node set of size 1, whose node is the ith node of the corresponding argument node set. The return value is a node set consisting of a series of result-tree nodes, each of which is a text node whose value is the string value of the result of the ith function invocation. Warning: this function uses the implied ordering of the node set Based on its implementation as a Python list. But in reality There is no reliable ordering of XPath node sets. In other words, this function is voodoo. t namespacess* Dynamically invoked function %s not found.c G s t | | ƒ S( N( t applyt ft args( t xR> R? ( ( R t <lambda>Š s iÿÿÿÿi N(# t ExpandQNamet funcnameR t processorNsst prefixt localt g_extFunctionst gett expandedt CoreFunctionst Nonet funct ExceptionR> t lent nodesetst flistt lfR= t mapt retlistR# R$ t result_nodesett retR' R( R, R R R. R/ R0 R1 R ( R RC RO RE RQ RU R$ R/ RT RP RL RF RS ( ( R t Mapt s$ % c C s t i t i | ƒ ƒ S( s" Escape illegal characters in a URLN( t urllibt quoteR R t url( R RY ( ( R t EscapeUrl˜ s c C sa | p | i g } n t | d d ƒ o | d i Sn$ t | d d ƒ o | d i Sn d S( s Get the base URI of the argumenti t baseUrit refUriR3 N( R R R R R[ R\ ( R R ( ( R t BaseUri s c C s% d k } | i ƒ } | i i | ƒ S( N( t DateTimet nowt dt ISOt str( R R` R^ ( ( R t IsoTime¨ s c C s( d k } | i i t i t ƒ d | ƒS( NR ( t xml.xpatht xmlt xpatht EvaluateR R t stR ( R t exprRe ( ( R Rg ® s c C s d k l } | i | i ƒ ƒ S( N( s Uuid( t Ft.Libt Uuidt UuidAsStringt GenerateUuid( R Rk ( ( R Rm ¶ s c C s] t | ƒ t g ƒ j o t d ƒ ‚ n h } x! | D] } | | t i | ƒ <q6 W| i ƒ S( Ns. 'distinct' parameter must be of type node-set!( R t nodesetRM t nodesR R R t values( R Rn R Ro ( ( R t distinctÄ s c C sj | i } x | i o | i } q Wg } x9 t i t i | ƒ | ƒ D] } | i | i | ƒ ƒ qF W| S( N( R R t doct parentNodeRn R t splitR R R t delimt tokenR1 t createTextNode( R R Ru Rr Rv Rn ( ( R Rt Î s c C s> t d „ | ƒ } | o t i | | ƒ Sn t i | ƒ Sd S( Nc C s t i | ƒ S( N( R R R@ ( R@ ( ( R RA Ú s ( RR Rn t compsRu R t joinfields( R Rn Ru Rx ( ( R t joinÙ s c C s‚ | i } x | i o | i } q Wt i | ƒ } t i | ƒ } g } x3 t | | ƒ D]" } | i | i t | ƒ ƒ ƒ qX W| S( N( R R Rr Rs R t NumberValuet lot hiRn t xranget numberR1 Rw Rb ( R R| R} R Rr Rn ( ( R t rangeà s c C s t i | ƒ o | Sn | Sd S( N( R t BooleanValuet condt v1t v2( R R‚ Rƒ R„ ( ( R t if_functionî s c C s" t i t i | ƒ t i | ƒ ƒ S( N( R t findR R t outert inner( R R‡ Rˆ ( ( R R† ô s s node-setR s search-reiñ s base-uris escape-urls iso-timet evaluateRq Rt Rz R€ t ifR† RR t versions generate-uuidR (( t __doc__t sysR R RW t xml.domR R* t xml.dom.Textt Textt xml.utilsR Rd RJ R t FT_EXT_NAMESPACEt FT_OLD_EXT_NAMESPACER R RK R R R2 R; RV RZ R] Rc Rg t Ft.Lib.DumpBgTuplet FtRm Rq Rt Rz R€ R… R† t hexversiont ExtFunctions( RJ RZ R R* R— R† R R RV R; Rq Rg RW R Rt R2 R R R] Rc R R“ R• R Rm Rz R R R€ R R’ R… ( ( R t ? s8 $ $