Repository URL to install this package:
|
Version:
2.5.0 ▾
|
]q (cpygments.token
_TokenType
qX Textq
q
qq}q(X subtypesqcbuiltins
set
q]q (hhX Rootq
q
qq
}q(hh]q
qRqX parentqhubhhX Symbolqq
qq}q(hh]q
qRqhhubhhX Ragqq
qq}q(hh]q
q!Rq"hhubhhX
Whitespaceq#q$
q%q&}q'(hh]q(
q)Rq*hhubhhX Beerq+q,
q-q.}q/(hh]q0
q1Rq2hhubhhX Punctuationq3q4
q5q6}q7(hh]q8
q9Rq:hhube
q;Rq<hh)
q=q>}q?(hh]q@(hX EscapeqA
qB
qCqD}qE(hh]qF
qGRqHhh>ubhX OperatorqI
qJ
qKqL}qM(hh]qN(hhIX DBSqOqP
qQqR}qS(hh]qT
qURqVhhLubhhIX WordqWqX
qYqZ}q[(hh]q\
q]Rq^hhLube
q_Rq`hh>hWhZhOhRubhX Nameqa
qb
qcqd}qe(hh]qf(hhaX Tagqgqh
qiqj}qk(hh]ql
qmRqnhhdubhhaX Entityqoqp
qqqr}qs(hh]qthhahohOqu
qvqw}qx(hh]qy
qzRq{hhruba
q|Rq}hhdhOhwubhhaX Exceptionq~q
qq}q(hh]q
qRq
hhdubhhaX Decoratorqq
qq}q(hh]q
qRqhhdubhhaX Classqq
qq}q(hh]q(hhahhOq
qq}q(hh]q
qRqhhubhhahX Startqq
qq}q(hh]q
q¡Rq¢hhube
q£Rq¤hhdhhhOhubhhaX Variableq¥q¦
q§q¨}q©(hh]qª(hhah¥X Anonymousq«q¬
qq®}q¯(hh]q°
q±Rq²hh¨ubhhah¥hq³
q´qµ}q¶(hh]q·
q¸Rq¹hh¨ubhhah¥X Magicqºq»
q¼q½}q¾(hh]q¿
qÀRqÁhh¨ubhhah¥X GlobalqqÅqāqÅ}qÆ(hh]qDžqÈRqÉhh¨ubhhah¥X Instanceqʇq˅q́qÍ}qÎ(hh]qυqÐRqÑhh¨ube
qÒRqÓhhdhhµhÂhÅhÊhÍhºh½h«h®ubhhaX AttributeqԆqՅqցq×}qØ(hh]qÙhhahÔh¥qڅqہqÜ}qÝ(hh]qޅqßRqàhh×uba
qáRqâhhdh¥hÜubhhaX Namespaceqãqä
qåqæ}qç(hh]qè
qéRqêhhdubhhaX Propertyqëqì
qíqî}qï(hh]qð
qñRqòhhdubhhahqó
qôqõ}qö(hh]q÷
qøRqùhhdubhhaX Classesqúqû
qüqý}qþ(hh]qÿ
r Rr hhdubhhaX Pseudor r
r r }r (hh]r
r Rr hhdubhhaX Labelr
r
r r
}r (hh]r
r Rr hhdubhhahIr
r r }r (hh]r
r Rr hhdubhhaX Builtinr r
r r }r (hh]r (hhaj j r
r r! }r" (hh]r#
r$ Rr% hj ubhhaj X Typer& r'
r( r) }r* (hh]r+
r, Rr- hj ube
r. Rr/ hhdj j! j& j) ubhhaX Fieldr0 r1
r2 r3 }r4 (hh]r5
r6 Rr7 hhdubhhaX Otherr8 r9
r: r; }r< (hh]r= hhaj8 X Memberr> r?
r@ rA }rB (hh]rC
rD RrE hj; uba
rF RrG hhdj> jA ubhhaX FunctionrH rI
rJ rK }rL (hh]rM hhajH hºrN
rO rP }rQ (hh]rR
rS RrT hjK uba
rU RrV hhdhºjP ubhhaj& rW
rX rY }rZ (hh]r[
r\ Rr] hhdubhhaX Constantr^ r_
r` ra }rb (hh]rc
rd Rre hhdube
rf Rrg hh>hÔh×j j hhj^ ja hhhohrh~hjH jK hëhîj
j
hãhæj8 j; hghjh¥h¨j0 j3 hhõj j hIj húhýj& jY ubhX Literalrh
ri
rj rk }rl (hh]rm (hjh j8 rn
ro rp }rq (hh]rr
rs Rrt hjk ubhjh X Charru rv
rw rx }ry (hh]rz
r{ Rr| hjk ubhjh X Dater} r~
r r }r (hh]r
r Rr hjk ubhjh X Scalarr
r
r r }r (hh]r hjh j
X Plainr r
r r }r (hh]r
r Rr hj uba
r Rr hjk j j ubhjh X Stringr r
r r }r (hh]r (hjh j X Interpolr r
r r }r (hh]r
r¡ Rr¢ hj ubhjh j X Delimeterr£ r¤
r¥ r¦ }r§ (hh]r¨
r© Rrª hj ubhjh j ju r«
r¬ r }r® (hh]r¯
r° Rr± hj ubhjh j hr²
r³ r´ }rµ (hh]r¶
r· Rr¸ hj ubhjh j X Singler¹ rº
r» r¼ }r½ (hh]r¾
r¿ RrÀ hj ubhjh j j8 rÁ
r rà }rÄ (hh]rÅ
rÆ RrÇ hj ubhjh j X BacktickrÈ rÉ
rÊ rË }rÌ (hh]rÍ
rÎ RrÏ hj ubhjh j hArÐ
rÑ rÒ }rÓ (hh]rÔ
rÕ RrÖ hj ubhjh j X Regexr× rØ
rÙ rÚ }rÛ (hh]rÜ
rÝ RrÞ hj ubhjh j X Momentrß rà
rá râ }rã (hh]rä
rå Rræ hj ubhjh j X Booleanrç rè
ré rê }rë (hh]rì
rí Rrî hj ubhjh j X Characterrï rð
rñ rò }ró (hh]rô
rõ Rrö hj ubhjh j X Delimiterr÷ rø
rù rú }rû (hh]rü
rý Rrþ hj ubhjh j X Docrÿ r
r r }r (hh]r
r Rr hj ubhjh j har
r r }r
(hh]r
r Rr
hj ubhjh j X Affixr r
r r }r (hh]r
r Rr hj ubhjh j X Heredocr r
r r }r (hh]r
r Rr hj ubhjh j X Doubler r
r r! }r" (hh]r#
r$ Rr% hj ubhjh j X Interpr& r'
r( r) }r* (hh]r+
r, Rr- hj ubhjh j X Atomr. r/
r0 r1 }r2 (hh]r3
r4 Rr5 hj ube
r6 Rr7 hjk j j jÈ jË ju j j÷ jú jÿ j j j! hAjÒ j j j j j8 jà j× jÚ j¹ j¼ hj´ jï jò jß jâ j& j) jç jê j£ j¦ j. j1 haj ubhjh X Numberr8 r9
r: r; }r< (hh]r= (hjh j8 X Floatr> r?
r@ rA }rB (hh]rC
rD RrE hj; ubhjh j8 X DecrF rG
rH rI }rJ (hh]rK
rL RrM hj; ubhjh j8 X RadixrN rO
rP rQ }rR (hh]rS
rT RrU hj; ubhjh j8 X OctrV rW
rX rY }rZ (hh]r[
r\ Rr] hj; ubhjh j8 X Binr^ r_
r` ra }rb (hh]rc
rd Rre hj; ubhjh j8 hԇrf
rg rh }ri (hh]rj
rk Rrl hj; ubhjh j8 X Hexrm rn
ro rp }rq (hh]rr
rs Rrt hj; ubhjh j8 X Integerru rv
rw rx }ry (hh]rz h(jh j8 ju X Longr{ tr|
r} r~ }r (hh]r
r Rr hjx uba
r Rr hj; j{ j~ ubhjh j8 X Decimalr
r
r r }r (hh]r
r Rr hj; ube
r Rr hjk j^ ja j> jA jm jp ju jx jV jY jN jQ hÔjh j
j jF jI ube
r Rr hh>j j j8 j; j} j j
j j8 jp ju jx ubhX Genericr
r
r r }r (hh]r (hj X Errorr r
r r }r (hh]r
r Rr hj ubhj X
Subheadingr r
r¡ r¢ }r£ (hh]r¤
r¥ Rr¦ hj ubhj X Tracebackr§ r¨
r© rª }r« (hh]r¬
r Rr® hj ubhj X Outputr¯ r°
r± r² }r³ (hh]r´
rµ Rr¶ hj ubhj X Promptr· r¸
r¹ rº }r» (hh]r¼
r½ Rr¾ hj ubhj X Deletedr¿ rÀ
rÁ r }rà (hh]rÄ
rÅ RrÆ hj ubhj X InsertedrÇ rÈ
rÉ rÊ }rË (hh]rÌ
rÍ RrÎ hj ubhj X HeadingrÏ rÐ
rÑ rÒ }rÓ (hh]rÔ
rÕ RrÖ hj ubhj X Strongr× rØ
rÙ rÚ }rÛ (hh]rÜ
rÝ RrÞ hj ubhj X Emphrß rà
rá râ }rã (hh]rä
rå Rræ hj ube
rç Rrè hh>j¿ j jß jâ j j jÏ jÒ jÇ jÊ j¯ j² j· jº j× jÚ j j¢ j§ jª ubhj
ré
rê rë }rì (hh]rí
rî Rrï hh>ubhX Keywordrð
rñ
rò ró }rô (hh]rõ (hjð hWrö
r÷ rø }rù (hh]rú
rû Rrü hjó ubhjð jð rý
rþ rÿ }r (hh]r
r Rr hjó ubhjð j& r
r r }r (hh]r
r Rr
hjó ubhjð X PreProcr r
r
r }r (hh]r
r Rr hjó ubhjð X Controlr r
r r }r (hh]r
r Rr hjó ubhjð j^ r
r r }r (hh]r
r Rr! hjó ubhjð hãr"
r# r$ }r% (hh]r&
r' Rr( hjó ubhjð j r)
r* r+ }r, (hh]r-
r. Rr/ hjó ubhjð X Declarationr0 r1
r2 r3 }r4 (hh]r5
r6 Rr7 hjó ubhjð X Reservedr8 r9
r: r; }r< (hh]r=
r> Rr? hjó ube
r@ RrA hh>j^ j j0 j3 hãj$ j j+ j8 j; j& j j j jð jÿ j j hWjø ubhj8
rB
rC rD }rE (hh]rF
rG RrH hh>ubhhX CommentrI
rJ
rK rL }rM (hh]rN (hjI X PreprocrO rP
rQ rR }rS (hh]rT
rU RrV hjL ubhjI X MultirW rX
rY rZ }r[ (hh]r\
r] Rr^ hjL ubhjI X Hashbangr_ r`
ra rb }rc (hh]rd
re Rrf hjL ubhjI j¹ rg
rh ri }rj (hh]rk
rl Rrm hjL ubhjI X
SingleLinern ro
rp rq }rr (hh]rs
rt Rru hjL ubhjI jÿ rv
rw rx }ry (hh]rz
r{ Rr| hjL ubhjI X Directiver} r~
r r }r (hh]r
r Rr hjL ubhjI X Multiliner
r
r r }r (hh]r
r Rr hjL ubhjI X
Singleliner r
r r }r (hh]r
r Rr hjL ubhjI X PreprocFiler r
r r }r (hh]r
r Rr hjL ubhjI X Specialr r
r r }r¡ (hh]r¢
r£ Rr¤ hjL ube
r¥ Rr¦ hh>j_ jb j
j jO jR j j j¹ ji j j j} j jn jq jÿ jx jW jZ j j ubhh3
r§
r¨ r© }rª (hh]r« hh3X Indicatorr¬ r
r® r¯ }r° (hh]r±
r² Rr³ hj© uba
r´ Rrµ hh>j¬ j¯ ube
r¶ Rr· hhhAhDj jë j8 jD jð jó hahdjh jk h3j© hIhLjI jL j j X Tokenr¸ h>j j j8 j; ubh#h&hhh3h6h
h
h+h.hhubX r¹ rº ji X # Underscore.coffee
r» r¼ hX r½ r¾ ji X/ # (c) 2010 Jeremy Ashkenas, DocumentCloud Inc.
r¿ rÀ hX rÁ r ji XI # Underscore is freely distributable under the terms of the MIT license.
rà rÄ hX rÅ rÆ ji XH # Portions of Underscore are inspired by or borrowed from Prototype.js,
rÇ rÈ hX rÉ rÊ ji XA # Oliver Steele's Functional, and John Resig's Micro-Templating.
rË rÌ hX rÍ rÎ ji X% # For all details and documentation:
rÏ rÐ hX rÑ rÒ ji X. # http://documentcloud.github.com/underscore/
rÓ rÔ hX
rÕ rÖ ji XM # ------------------------- Baseline setup ---------------------------------
r× rØ hX
rÙ rÚ ji XQ # Establish the root object, "window" in the browser, or "global" on the server.
rÛ rÜ hX rÝ rÞ h¨X root: rß rà jó X thisrá râ hX
rã rä ji X/ # Save the previous value of the "_" variable.
rå ræ hX rç rè h¨X previousUnderscore: ré rê j; X rootrë rì j© X .rí rî j; X _rï rð hX
rñ rò ji XJ # If Underscore is called as a function, it returns a wrapped object that
ró rô hX rõ rö ji XG # can be used OO-style. This wrapper holds altered versions of all the
r÷ rø hX rù rú ji X8 # underscore functions. Wrapped objects may be chained.
rû rü hX rý rþ h¨X wrapper: rÿ r jK X (obj) ->r r hX
r r jó X thisr r j© jí r h¨X
_wrapped: r r j; X objr
r hX
r r
jó X thisr r hX
r r ji XJ # Establish the object that gets thrown to break out of a loop iteration.
r r hX r r h¨X breaker: r r jó X ifr r hX r r jó X typeofr r j© X (r r j; X
StopIterationr r! j© X )r" r# hj r$ hLX isr% r& hj r' j X 'r( r) j X undefinedr* r+ j j( r, hj r- jó X thenr. r/ hj r0 j j( r1 j X __break__r2 r3 j j( r4 hj r5 jó X elser6 r7 hj r8 j; X
StopIterationr9 r: hX
r; r< ji XG # Create a safe reference to the Underscore object forreference below.
r= r> hX r? r@ h¨X _: rA rB h¨X root._: rC rD jK X (obj) ->rE rF hj rG jó X newrH rI hj rJ j; X wrapperrK rL j© j rM j; X objrN rO j© j" rP hX
rQ rR ji X- # Export the Underscore object for CommonJS.
rS rT hX rU rV jó X ifrW rX hj rY jó X typeofrZ r[ j© j r\ j; X exportsr] r^ j© j" r_ hj r` hLX !=ra rb hj rc j j( rd j X undefinedre rf j j( rg hj rh jó X thenri rj hj rk h¨X exports._: rl rm j; jï rn hX
ro rp ji XH # Create quick reference variables for speed access to core prototypes.
rq rr hX rs rt h¨X slice: ru rv hX rw rx j X Arrayry rz hLX :r{ r| hLj{ r} j; X slicer~ r hX
r r h¨X unshift: r r hX
r r
j X Arrayr r hLj{ r hLj{ r j; X unshiftr r hX
r r h¨X
toString: r r hX r r j X Objectr r hLj{ r hLj{ r j; X toStringr r hX
r r h¨X hasOwnProperty: r r hX r r j X Objectr r hLj{ r hLj{ r¡ j; X hasOwnPropertyr¢ r£ hX
r¤ r¥ h¨X propertyIsEnumerable: r¦ r§ j X Objectr¨ r© hLj{ rª hLj{ r« j; X propertyIsEnumerabler¬ r hX
r® r¯ ji X # Current version.
r° r± hX r² r³ h¨X _.VERSION: r´ rµ j j( r¶ j X 0.5.7r· r¸ j j( r¹ hX
rº r» ji XM # ------------------------ Collection Functions: ---------------------------
r¼ r½ hX
r¾ r¿ ji X+ # The cornerstone, an each implementation.
rÀ rÁ hX r rà ji XA # Handles objects implementing forEach, arrays, and raw objects.
rÄ rÅ hX rÆ rÇ h¨X _.each: rÈ rÉ jK X (obj, iterator, context) ->rÊ rË hX
rÌ rÍ h¨X index: rÎ rÏ jx X 0rÐ rÑ hX
rÒ rÓ jó X tryrÔ rÕ hX
rÖ r× jó X returnrØ rÙ hj rÚ j; X objrÛ rÜ j© jí rÝ j; X forEachrÞ rß j© j rà j; X iteratorrá râ j© X ,rã rä hj rå j; X contextræ rç j© j" rè hj ré jó X ifrê rë hj rì j; X objrí rî j© jí rï j; X forEachrð rñ hX
rò ró jó X ifrô rõ hj rö j; jï r÷ j© jí rø j; X isArrayrù rú j© j rû j; X objrü rý j© j" rþ hj rÿ hLX orr r hj r j; jï r j© jí r j; X isArgumentsr r j© j r j; X objr r j© j" r
hX
r r jó X returnr
r hj r j; X iteratorr r j© jí r j; X callr r j© j r j; X contextr r j© jã r hj r j; X objr r j© X [r r j; X ir r j© X ]r r! j© jã r" hj r# j; j r$ j© jã r% hj r& j; X objr' r( j© j" r) hj r* jó X forr+ r, hj r- j; j r. hj r/ jó X inr0 r1 hj r2 j© j r3 jx jÐ r4 j© jí r5 j© jí r6 j© jí r7 j; X objr8 r9 j© jí r: j; X lengthr; r< j© j r= hX
r> r? j; X iteratorr@ rA j© jí rB j; X callrC rD j© j rE j; X contextrF rG j© jã rH hj rI j; X valrJ rK j© jã rL hj rM j; X keyrN rO j© jã rP hj rQ j; X objrR rS j© j" rT hj rU jó X forrV rW hj rX j; X keyrY rZ j© jã r[ hj r\ j; X valr] r^ hj r_ jó X ofr` ra hj rb j; X objrc rd hX
re rf jó X catchrg rh hj ri j; X erj rk hX
rl rm jó X throwrn ro hj rp j; jj rq hj rr jó X ifrs rt hj ru j; jj rv hj rw hLX isntrx ry hj rz j; X breakerr{ r| hX
r} r~ j; X objr r hX
r r ji XN # Return the results of applying the iterator to each element. Use JavaScript
r r hX r
r ji X% # 1.6's version of map, if possible.
r r hX r r h¨X _.map: r r jK X (obj, iterator, context) ->r r hX
r r jó X returnr r hj r j; X objr r j© jí r j; X mapr r j© j r j; X iteratorr r j© jã r hj r j; X contextr r j© j" r hj r¡ jó X ifr¢ r£ hj r¤ j© j r¥ j; X objr¦ r§ hj r¨ hLX andr© rª hj r« j; jï r¬ j© jí r j; X
isFunctionr® r¯ j© j r° j; X objr± r² j© jí r³ j; X mapr´ rµ j© j" r¶ j© j" r· hX
r¸ r¹ h¨X results: rº r» j© j r¼ j© j r½ hX
r¾ r¿ j; jï rÀ j© jí rÁ j; X eachr rà hj rÄ j; X objrÅ rÆ j© jã rÇ hj rÈ jK X (value, index, list) ->rÉ rÊ hX
rË rÌ j; X resultsrÍ rÎ j© jí rÏ j; X pushrÐ rÑ j© j rÒ j; X iteratorrÓ rÔ j© jí rÕ j; X callrÖ r× j© j rØ j; X contextrÙ rÚ j© jã rÛ hj rÜ j; X valuerÝ rÞ j© jã rß hj rà j; X indexrá râ j© jã rã hj rä j; X listrå ræ j© j" rç j© j" rè hX
ré rê j; X resultsrë rì hX
rí rî ji XH # Reduce builds up a single result from a list of values. Also known as
rï rð hX rñ rò ji XJ # inject, or foldl. Uses JavaScript 1.8's version of reduce, if possible.
ró rô hX rõ rö h¨X
_.reduce: r÷ rø jK X! (obj, memo, iterator, context) ->rù rú hX
rû rü jó X returnrý rþ hj rÿ j; X objr r j© jí r j; X reducer r j© j r j; jï r j© jí r j; X bindr r j© j r
j; X iteratorr r j© jã r
hj r j; X contextr r j© j" r j© jã r hj r j; X memor r j© j" r hj r jó X ifr r hj r j© j r j; X objr r hj r hLX andr r hj r! j; jï r" j© jí r# j; X
isFunctionr$ r% j© j r& j; X objr' r( j© jí r) j; X reducer* r+ j© j" r, j© j" r- hX
r. r/ j; jï r0 j© jí r1 j; X eachr2 r3 hj r4 j; X objr5 r6 j© jã r7 hj r8 jK X (value, index, list) ->r9 r: hX
r; r< h¨X memo: r= r> j; X iteratorr? r@ j© jí rA j; X callrB rC j© j rD j; X contextrE rF j© jã rG hj rH j; X memorI rJ j© jã rK hj rL j; X valuerM rN j© jã rO hj rP j; X indexrQ rR j© jã rS hj rT j; X listrU rV j© j" rW hX
rX rY j; X memorZ r[ hX
r\ r] ji XE # The right-associative version of reduce, also known as foldr. Uses
r^ r_ hX r` ra ji X9 # JavaScript 1.8's version of reduceRight, if available.
rb rc hX rd re h¨X _.reduceRight: rf rg jK X! (obj, memo, iterator, context) ->rh ri hX
rj rk jó X returnrl rm hj rn j; X objro rp j© jí rq j; X reduceRightrr rs j© j rt j; jï ru j© jí rv j; X bindrw rx j© j ry j; X iteratorrz r{ j© jã r| hj r} j; X contextr~ r j© j" r j© jã r hj r j; X memor r j© j" r
hj r jó X ifr r hj r j© j r j; X objr r hj r hLX andr r hj r j; jï r j© jí r j; X
isFunctionr r j© j r j; X objr r j© jí r j; X reduceRightr r j© j" r j© j" r hX
r r j; jï r j© jí r j; X eachr¡ r¢ hj r£ j; jï r¤ j© jí r¥ j; X cloner¦ r§ j© j r¨ j; jï r© j© jí rª j; X toArrayr« r¬ j© j r j; X objr® r¯ j© j" r° j© j" r± j© jí r² j; X reverser³ r´ j© j rµ j© j" r¶ j© jã r· hj r¸ jK X (value, index) ->r¹ rº hX
r» r¼ h¨X memo: r½ r¾ j; X iteratorr¿ rÀ j© jí rÁ j; X callr rà j© j rÄ j; X contextrÅ rÆ j© jã rÇ hj rÈ j; X memorÉ rÊ j© jã rË hj rÌ j; X valuerÍ rÎ j© jã rÏ hj rÐ j; X indexrÑ rÒ j© jã rÓ hj rÔ j; X objrÕ rÖ j© j" r× hX
rØ rÙ j; X memorÚ rÛ hX
rÜ rÝ ji X4 # Return the first value which passes a truth test.
rÞ rß hX rà rá h¨X
_.detect: râ rã jK X (obj, iterator, context) ->rä rå hX
ræ rç h¨X result: rè ré j X nullrê rë hX
rì rí j; jï rî j© jí rï j; X eachrð rñ hj rò j; X objró rô j© jã rõ hj rö jK X (value, index, list) ->r÷ rø hX
rù rú jó X ifrû rü hj rý j; X iteratorrþ rÿ j© jí r j; X callr r j© j r j; X contextr r j© jã r hj r j; X valuer r j© jã r
hj r j; X indexr r
j© jã r hj r j; X listr r j© j" r hX
r r h¨X result: r r j; X valuer r hX
r r j; jï r j© jí r j; X breakLoopr r j© j r j© j" r hX
r! r" j; X resultr# r$ hX
r% r& ji XG # Return all the elements that pass a truth test. Use JavaScript 1.6's
r' r( hX r) r* ji X # filter(), if it exists.
r+ r, hX r- r. h¨X
_.select: r/ r0 jK X (obj, iterator, context) ->r1 r2 hX
r3 r4 jó X ifr5 r6 hj r7 j; X objr8 r9 hj r: hLX andr; r< hj r= j; jï r> j© jí r? j; X
isFunctionr@ rA j© j rB j; X objrC rD j© jí rE j; X filterrF rG j© j" rH hj rI jó X thenrJ rK hj rL jó X returnrM rN hj rO j; X objrP rQ j© jí rR j; X filterrS rT j© j rU j; X iteratorrV rW j© jã rX hj rY j; X contextrZ r[ j© j" r\ hX
r] r^ h¨X results: r_ r` j© j ra j© j rb hX
rc rd j; jï re j© jí rf j; X eachrg rh hj ri j; X objrj rk j© jã rl hj rm jK X (value, index, list) ->rn ro hX
rp rq j; X resultsrr rs j© jí rt j; X pushru rv j© j rw j; X valuerx ry j© j" rz hj r{ jó X ifr| r} hj r~ j; X iteratorr r j© jí r j; X callr r j© j r j; X contextr
r j© jã r hj r j; X valuer r j© jã r hj r j; X indexr r j© jã r hj r j; X listr r j© j" r hX
r r j; X resultsr r hX
r r ji X8 # Return all the elements for which a truth test fails.
r r hX r r h¨X
_.reject: r r jK X (obj, iterator, context) ->r r¡ hX
r¢ r£ h¨X results: r¤ r¥ j© j r¦ j© j r§ hX
r¨ r© j; jï rª j© jí r« j; X eachr¬ r hj r® j; X objr¯ r° j© jã r± hj r² jK X (value, index, list) ->r³ r´ hX
rµ r¶ j; X resultsr· r¸ j© jí r¹ j; X pushrº r» j© j r¼ j; X valuer½ r¾ j© j" r¿ hj rÀ jó X ifrÁ r hj rà hLX notrÄ rÅ hj rÆ j; X iteratorrÇ rÈ j© jí rÉ j; X callrÊ rË j© j rÌ j; X contextrÍ rÎ j© jã rÏ hj rÐ j; X valuerÑ rÒ j© jã rÓ hj rÔ j; X indexrÕ rÖ j© jã r× hj rØ j; X listrÙ rÚ j© j" rÛ hX
rÜ rÝ j; X resultsrÞ rß hX
rà rá ji XH # Determine whether all of the elements match a truth test. Delegate to
râ rã hX rä rå ji X. # JavaScript 1.6's every(), if it is present.
ræ rç hX rè ré h¨X _.all: rê rë jK X (obj, iterator, context) ->rì rí hX
rî rï j; X iteratorrð rñ hj rò hLX ||ró rô hLX =rõ rö hj r÷ j; jï rø j© jí rù j; X identityrú rû hX
rü rý jó X returnrþ rÿ hj r j; X objr r j© jí r j; X everyr r j© j r j; X iteratorr r j© jã r hj r
j; X contextr r j© j" r
hj r jó X ifr r hj r j; X objr r hj r hLX andr r hj r j; jï r j© jí r j; X
isFunctionr r j© j r j; X objr r j© jí r j; X everyr r! j© j" r" hX
r# r$ h¨X result: r% r& j X truer' r( hX
r) r* j; jï r+ j© jí r, j; X eachr- r. hj r/ j; X objr0 r1 j© jã r2 hj r3 jK X (value, index, list) ->r4 r5 hX
r6 r7 j; jï r8 j© jí r9 j; X breakLoopr: r; j© j r< j© j" r= hj r> jó X unlessr? r@ hj rA j© j rB h¨X result: rC rD j; X resultrE rF hj rG hLX andrH rI hj rJ j; X iteratorrK rL j© jí rM j; X callrN rO j© j rP j; X contextrQ rR j© jã rS hj rT j; X valuerU rV j© jã rW hj rX j; X indexrY rZ j© jã r[ hj r\ j; X listr] r^ j© j" r_ j© j" r` hX
ra rb j; X resultrc rd hX
re rf ji XL # Determine if at least one element in the object matches a truth test. Use
rg rh hX ri rj ji X) # JavaScript 1.6's some(), if it exists.
rk rl hX rm rn h¨X _.any: ro rp jK X (obj, iterator, context) ->rq rr hX
rs rt j; X iteratorru rv hj rw hLX ||rx ry hLjõ rz hj r{ j; jï r| j© jí r} j; X identityr~ r hX
r r jó X returnr r hj r j; X objr
r j© jí r j; X somer r j© j r j; X iteratorr r j© jã r hj r j; X contextr r j© j" r hj r jó X ifr r hj r j; X objr r hj r hLX andr r hj r j; jï r j© jí r j; X
isFunctionr r j© j r j; X objr¡ r¢ j© jí r£ j; X somer¤ r¥ j© j" r¦ hX
r§ r¨ h¨X result: r© rª j X falser« r¬ hX
r r® j; jï r¯ j© jí r° j; X eachr± r² hj r³ j; X objr´ rµ j© jã r¶ hj r· jK X (value, index, list) ->r¸ r¹ hX
rº r» j; jï r¼ j© jí r½ j; X breakLoopr¾ r¿ j© j rÀ j© j" rÁ hj r jó X ifrà rÄ hj rÅ j© j rÆ h¨X result: rÇ rÈ j; X iteratorrÉ rÊ j© jí rË j; X callrÌ rÍ j© j rÎ j; X contextrÏ rÐ j© jã rÑ hj rÒ j; X valuerÓ rÔ j© jã rÕ hj rÖ j; X indexr× rØ j© jã rÙ hj rÚ j; X listrÛ rÜ j© j" rÝ j© j" rÞ hX
rß rà j; X resultrá râ hX
rã rä ji XA # Determine if a given value is included in the array or object,
rå ræ hX rç rè ji X # based on '==='.
ré rê hX rë rì h¨X _.include: rí rî jK X (obj, target) ->rï rð hX
rñ rò jó X returnró rô hj rõ j; jï rö j© jí r÷ j; X indexOfrø rù j© j rú j; X objrû rü j© jã rý hj rþ j; X targetrÿ r j© j" r hj r hLX isntr r hj r hLX -r r jx X 1r r hj r
jó X ifr r hj r
j; jï r j© jí r j; X isArrayr r j© j r j; X objr r j© j" r hX
r r jó X forr r hj r j; X keyr r j© jã r hj r j; X valr r hj r! jó X ofr" r# hj r$ j; X objr% r& hX
r' r( jó X returnr) r* hj r+ j X truer, r- hj r. jó X ifr/ r0 hj r1 j; X valr2 r3 hj r4 hLX isr5 r6 hj r7 j; X targetr8 r9 hX
r: r; j X falser< r= hX
r> r? ji X@ # Invoke a method with arguments on every item in a collection.
r@ rA hX rB rC h¨X
_.invoke: rD rE jK X (obj, method) ->rF rG hX
rH rI h¨X args: rJ rK j; jï rL j© jí rM j; X restrN rO j© j rP j; X argumentsrQ rR j© jã rS hj rT jx X 2rU rV j© j" rW hX
rX rY j© j rZ jó X ifr[ r\ hj r] j; X methodr^ r_ hj r` jó X thenra rb hj rc j; X valrd re j© j rf j; X methodrg rh j© j ri hj rj jó X elserk rl hj rm j; X valrn ro j© j" rp j© jí rq j; X applyrr rs j© j rt j; X valru rv j© jã rw hj rx j; X argsry rz j© j" r{ hj r| jó X forr} r~ hj r j; X valr r hj r jó X inr r hj r
j; X objr r hX
r r ji XH # Convenience version of a common use case of map: fetching a property.
r r hX r r h¨X _.pluck: r r jK X
(obj, key) ->r r hX
r r j; jï r j© jí r j; X mapr r j© j r j; X objr r j© jã r hj r j© j r jK X (val) ->r r hj r j; X valr¡ r¢ j© j r£ j; X keyr¤ r¥ j© j r¦ j© j" r§ j© j" r¨ hX
r© rª ji X7 # Return the maximum item or (item-based computation).
r« r¬ hX r r® h¨X _.max: r¯ r° jK X (obj, iterator, context) ->r± r² hX
r³ r´ jó X returnrµ r¶ hj r· j X Mathr¸ r¹ j© jí rº j; X maxr» r¼ j© jí r½ j; X applyr¾ r¿ j© j rÀ j X MathrÁ r j© jã rà e(hj rÄ j; X objrÅ rÆ j© j" rÇ hj rÈ jó X ifrÉ rÊ hj rË hLX notrÌ rÍ hj rÎ j; X iteratorrÏ rÐ hj rÑ hLX andrÒ rÓ hj rÔ j; jï rÕ j© jí rÖ j; X isArrayr× rØ j© j rÙ j; X objrÚ rÛ j© j" rÜ hX
rÝ rÞ h¨X result: rß rà j© X {rá râ h¨X
computed: rã rä hLj rå j X Infinityræ rç j© X }rè ré hX
rê rë j; jï rì j© jí rí j; X eachrî rï hj rð j; X objrñ rò j© jã ró hj rô jK X (value, index, list) ->rõ rö hX
r÷ rø h¨X
computed: rù rú jó X ifrû rü hj rý j; X iteratorrþ rÿ hj r
jó X thenr
r
hj r
j; X iteratorr
r
j© jí r
j; X callr
r
j© j r
j; X contextr
r
j© jã r
hj r
j; X valuer
r
j© jã r
hj r
j; X indexr
r
j© jã r
hj r
j; X listr
r
j© j" r
hj r
jó X elser
r
hj r
j; X valuer
r
hX
r
r
j; X computedr!
r"
hj r#
hLX >=r$
r%
hj r&
j; X resultr'
r(
j© jí r)
j; X computedr*
r+
hj r,
hLX andr-
r.
hj r/
j© j r0
h¨X result: r1
r2
j© já r3
h¨X value: r4
r5
j; X valuer6
r7
j© jã r8
hj r9
h¨X
computed: r:
r;
j; X computedr<
r=
j© jè r>
j© j" r?
hX
r@
rA
j; X resultrB
rC
j© jí rD
j; X valuerE
rF
hX
rG
rH
ji X= # Return the minimum element (or element-based computation).
rI
rJ
hX rK
rL
h¨X _.min: rM
rN
jK X (obj, iterator, context) ->rO
rP
hX
rQ
rR
jó X returnrS
rT
hj rU
j X MathrV
rW
j© jí rX
j; X minrY
rZ
j© jí r[
j; X applyr\
r]
j© j r^
j X Mathr_
r`
j© jã ra
hj rb
j; X objrc
rd
j© j" re
hj rf
jó X ifrg
rh
hj ri
hLX notrj
rk
hj rl
j; X iteratorrm
rn
hj ro
hLX andrp
rq
hj rr
j; jï rs
j© jí rt
j; X isArrayru
rv
j© j rw
j; X objrx
ry
j© j" rz
hX
r{
r|
h¨X result: r}
r~
j© já r
h¨X
computed: r
r
j X Infinityr
r
j© jè r
hX
r
r
j; jï r
j© jí r
j; X eachr
r
hj r
j; X objr
r
j© jã r
hj r
jK X (value, index, list) ->r
r
hX
r
r
h¨X
computed: r
r
jó X ifr
r
hj r
j; X iteratorr
r
hj r
jó X thenr
r
hj r
j; X iteratorr
r
j© jí r¡
j; X callr¢
r£
j© j r¤
j; X contextr¥
r¦
j© jã r§
hj r¨
j; X valuer©
rª
j© jã r«
hj r¬
j; X indexr
r®
j© jã r¯
hj r°
j; X listr±
r²
j© j" r³
hj r´
jó X elserµ
r¶
hj r·
j; X valuer¸
r¹
hX
rº
r»
j; X computedr¼
r½
hj r¾
hLX <r¿
rÀ
hj rÁ
j; X resultrÂ
rÃ
j© jí rÄ
j; X computedrÅ
rÆ
hj rÇ
hLX andrÈ
rÉ
hj rÊ
j© j rË
h¨X result: rÌ
rÍ
j© já rÎ
h¨X value: rÏ
rÐ
j; X valuerÑ
rÒ
j© jã rÓ
hj rÔ
h¨X
computed: rÕ
rÖ
j; X computedr×
rØ
j© jè rÙ
j© j" rÚ
hX
rÛ
rÜ
j; X resultrÝ
rÞ
j© jí rß
j; X valuerà
rá
hX
râ
rã
ji XB # Sort the object's values by a criteria produced by an iterator.
rä
rå
hX ræ
rç
h¨X
_.sortBy: rè
ré
jK X (obj, iterator, context) ->rê
rë
hX
rì
rí
j; jï rî
j© jí rï
j; X pluckrð
rñ
j© j rò
j© j ró
j© j rô
j; jï rõ
j© jí rö
j; X mapr÷
rø
hj rù
j; X objrú
rû
j© jã rü
hj rý
jK X (value, index, list) ->rþ
rÿ
hX
r r j© já r h¨X value: r r j; X valuer r j© jã r hj r h¨X
criteria: r r
j; X iteratorr r j© jí r
j; X callr r j© j r j; X contextr r j© jã r hj r j; X valuer r j© jã r hj r j; X indexr r j© jã r hj r j; X listr r j© j" r j© jè r hX
r! r" j© j" r# j© jí r$ j; X sortr% r& j© j r' jK X (left, right) ->r( r) hX
r* r+ h¨X a: r, r- j; X leftr. r/ j© jí r0 j; X criteriar1 r2 j© X ;r3 r4 hj r5 h¨X b: r6 r7 j; X rightr8 r9 j© jí r: j; X criteriar; r< hX
r= r> jó X ifr? r@ hj rA j; X arB rC hj rD hLj¿
rE hj rF j; X brG rH hj rI jó X thenrJ rK hj rL hLj rM jx j rN hj rO jó X elserP rQ hj rR jó X ifrS rT hj rU j; jB rV hj rW hLX >rX rY hj rZ j; jG r[ hj r\ jó X thenr] r^ hj r_ jx j r` hj ra jó X elserb rc hj rd jx jÐ re hX
rf rg j© j" rh j© j" ri j© jã rj hj rk j j( rl j X valuerm rn j j( ro j© j" rp hX
rq rr ji XI # Use a comparator function to figure out at what index an object should
rs rt hX ru rv ji X; # be inserted so as to maintain order. Uses binary search.
rw rx hX ry rz h¨X _.sortedIndex: r{ r| jK X (array, obj, iterator) ->r} r~ hX
r r j; X iteratorr r hj r hLX ||r r
hLjõ r hj r j; jï r j© jí r j; X identityr r hX
r r h¨X low: r r jx jÐ r j© j3 r hj r h¨X high: r r j; X arrayr r j© jí r j; X lengthr r hX
r r jó X whiler r hj r j; X lowr r hj r¡ hLj¿
r¢ hj r£ j; X highr¤ r¥ hX
r¦ r§ h¨X mid: r¨ r© j© j rª j; X lowr« r¬ hj r hLX +r® r¯ hj r° j; X highr± r² j© j" r³ hj r´ hLX >>rµ r¶ hj r· jx j r¸ hX
r¹ rº jó X ifr» r¼ hj r½ j; X iteratorr¾ r¿ j© j rÀ j; X arrayrÁ r j© j rà j; X midrÄ rÅ j© j rÆ j© j" rÇ hj rÈ hLj¿
rÉ hj rÊ j; X iteratorrË rÌ j© j rÍ j; X objrÎ rÏ j© j" rÐ hj rÑ jó X thenrÒ rÓ hj rÔ h¨X low: rÕ rÖ j; X midr× rØ hj rÙ hLj® rÚ hj rÛ jx j rÜ hj rÝ jó X elserÞ rß hj rà h¨X high: rá râ j; X midrã rä hX
rå ræ j; X lowrç rè hX
ré rê ji X5 # Convert anything iterable into a real, live array.
rë rì hX rí rî h¨X _.toArray: rï rð jK X
(iterable) ->rñ rò hX
ró rô jó X returnrõ rö hj r÷ j© j rø j© j rù hX rú rû jó X ifrü rý hj rþ j© j rÿ hLX !r r j; X iterabler r j© j" r hX
r r jó X returnr r hj r j; X iterabler
r j© jí r j; X toArrayr
r j© j r j© j" r hX r r jó X ifr r hj r j© j r j; X iterabler r j© jí r j; X toArrayr r j© j" r hX
r r jó X returnr r hj r! j; X iterabler" r# hX
r$ r% jó X ifr& r' hj r( j© j r) j; jï r* j© jí r+ j; X isArrayr, r- j© j r. j; X iterabler/ r0 j© j" r1 j© j" r2 hX
r3 r4 jó X returnr5 r6 hj r7 j; X slicer8 r9 j© jí r: j; X callr; r< j© j r= j; X iterabler> r? j© j" r@ hj rA jó X ifrB rC hj rD j© j rE j; jï rF j© jí rG j; X isArgumentsrH rI j© j rJ j; X iterablerK rL j© j" rM j© j" rN hX
rO rP j; jï rQ j© jí rR j; X valuesrS rT j© j rU j; X iterablerV rW j© j" rX hX
rY rZ ji X. # Return the number of elements in an object.
r[ r\ hX r] r^ h¨X _.size: r_ r` jK X (obj) ->ra rb hj rc j; jï rd j© jí re j; X toArrayrf rg j© j rh j; X objri rj j© j" rk j© jí rl j; X lengthrm rn hX
ro rp ji XM # -------------------------- Array Functions: ------------------------------
rq rr hX
rs rt ji XI # Get the first element of an array. Passing "n" will return the first N
ru rv hX rw rx ji XN # values in the array. Aliased as "head". The "guard" check allows it to work
ry rz hX r{ r| ji X # with _.map.
r} r~ hX r r h¨X _.first: r r jK X (array, n, guard) ->r r hX
r
r jó X ifr r hj r j; X nr r hj r hLX andr r hj r hLX notr r hj r j; X guardr r hj r jó X thenr r hj r j; X slicer r j© jí r j; X callr r j© j r j; X arrayr r j© jã r¡ hj r¢ jx jÐ r£ j© jã r¤ hj r¥ j; j r¦ j© j" r§ hj r¨ jó X elser© rª hj r« j; X arrayr¬ r j© j r® jx jÐ r¯ j© j r° hX
r± r² ji XJ # Returns everything but the first entry of the array. Aliased as "tail".
r³ r´ hX rµ r¶ ji XL # Especially useful on the arguments object. Passing an "index" will return
r· r¸ hX r¹ rº ji XJ # the rest of the values in the array from that index onward. The "guard"
r» r¼ hX r½ r¾ ji X&