MCPcopy Create free account

hub / github.com/PlutoLang/Pluto / functions

Functions1,782 in github.com/PlutoLang/Pluto

↓ 1 callersFunctionHgetstr
src/ltable.cpp:1034
↓ 1 callersFunctionI2d
src/lmathlib.cpp:458
↓ 1 callersMethodIs
src/llex.h:124
↓ 1 callersMethodIsCompatible
src/llex.h:149
↓ 1 callersMethodIsEscapingToken
src/llex.h:132
↓ 1 callersMethodIsNarrow
src/llex.h:143
↓ 1 callersMethodIsReservedNonValue
src/llex.h:136
↓ 1 callersFunctionLEfloatint
** Check whether float 'f' is less than or equal to integer 'i'. ** See comments on previous function. */
src/lvm.cpp:502
↓ 1 callersFunctionLEintfloat
** Check whether integer 'i' is less than or equal to float 'f'. ** See comments on previous function. */
src/lvm.cpp:468
↓ 1 callersFunctionLEnum
** Return 'l <= r', for numbers. */
src/lvm.cpp:540
↓ 1 callersFunctionLTfloatint
** Check whether float 'f' is less than integer 'i'. ** See comments on previous function. */
src/lvm.cpp:485
↓ 1 callersFunctionLTintfloat
** Check whether integer 'i' is less than float 'f'. If 'i' has an ** exact representation as a float ('l_intfitsf'), compare numbers as ** floats. Ot
src/lvm.cpp:451
↓ 1 callersFunctionLTnum
** Return 'l < r', for numbers. */
src/lvm.cpp:518
↓ 1 callersFunctionLUAI_TRY
src/ldo.cpp:81
↓ 1 callersFunctionMurmurHash1Aligned
----------------------------------------------------------------------------- MurmurHash1Aligned, by Austin Appleby Same algorithm as MurmurHash1, but
src/lcryptolib.hpp:13
↓ 1 callersFunctionMurmurHash2
src/lcryptolib.hpp:135
↓ 1 callersFunctionMurmurHash2A
src/lcryptolib.hpp:327
↓ 1 callersFunctionMurmurHash64A
src/lcryptolib.hpp:199
↓ 1 callersFunctionMurmurHash64B
src/lcryptolib.hpp:258
↓ 1 callersFunctionMurmurHashAligned2
src/lcryptolib.hpp:437
↓ 1 callersFunctionMurmurHashNeutral2
src/lcryptolib.hpp:377
↓ 1 callersFunctionPrintCode
src/luac.cpp:357
↓ 1 callersFunctionPrintDebug
src/luac.cpp:725
↓ 1 callersFunctionPrintHeader
src/luac.cpp:705
↓ 1 callersFunctionPrintString
src/luac.cpp:243
↓ 1 callersFunctionPrintType
src/luac.cpp:288
↓ 1 callersFunctionSuperFastHash
src/lcryptolib.hpp:607
↓ 1 callersFunctionadd_s
src/lstrlib.cpp:934
↓ 1 callersFunctionadd_value
** Add the replacement value to the string buffer 'b'. ** Return true if the original string was changed. (Function calls and ** table indexing result
src/lstrlib.cpp:969
↓ 1 callersFunctionaddreturn
** Try to compile line on the stack as 'return <line>;'; on return, stack ** has either compiled chunk or original line (if compilation failed). */
src/lua.cpp:599
↓ 1 callersFunctionaddtoclib
** registry.CLIBS[path] = plib -- for queries. ** Also create a reference to strlib, so that the library string will ** only be collected whe
src/loadlib.cpp:363
↓ 1 callersFunctionarereturnscompatible
src/lparser.cpp:2662
↓ 1 callersFunctionarraydestructuring
src/lparser.cpp:5550
↓ 1 callersFunctionauxclone
** Pushes a clone of the table at i. */
src/ltablib.cpp:271
↓ 1 callersFunctionauxgetinfo
src/ldebug.cpp:347
↓ 1 callersFunctionauxsort
** Quicksort algorithm (recursive function) */
src/ltablib.cpp:419
↓ 1 callersFunctionb_str2int
src/lbaselib.cpp:107
↓ 1 callersFunctionboolF
** Add a false to list of constants and return its index. */
src/lcode.cpp:646
↓ 1 callersFunctionboolT
** Add a true to list of constants and return its index. */
src/lcode.cpp:656
↓ 1 callersFunctionbreakstat
** Break statement. Very similiar to `continue` usage, but it jumps slightly more forward. ** ** Implementation Detail: ** Unlike normal Lua, it has
src/lparser.cpp:1732
↓ 1 callersFunctionbuildhiddenargs
** initial stack: func arg1 ... argn extra1 ... ** ^ ci->func ^ L->top ** final stack: func nil ... nil extra1 ...
src/ltm.cpp:262
↓ 1 callersFunctionbuiltinoperators
src/lparser.cpp:6287
↓ 1 callersFunctioncall
src/lwasmlib.cpp:141
↓ 1 callersFunctioncallclosemethod
** Call closing method for object 'obj' with error object 'err'. The ** boolean 'yy' controls whether the call is yieldable. ** (This function assumes
src/lfunc.cpp:107
↓ 1 callersFunctioncapture_to_close
src/lstrlib.cpp:451
↓ 1 callersFunctioncat_decode_aux_flat
src/lcatlib.cpp:89
↓ 1 callersFunctioncat_decode_aux_full
src/lcatlib.cpp:133
↓ 1 callersFunctionchangedline
** Check whether new instruction 'newpc' is in a different line from ** previous instruction 'oldpc'. More often than not, 'newpc' is only ** one or a
src/ldebug.cpp:915
↓ 1 callersFunctioncheckJson
src/ljson.cpp:25
↓ 1 callersFunctioncheck_capture
src/lstrlib.cpp:442
↓ 1 callersFunctioncheck_conflict
** check whether, in an assignment to an upvalue/local variable, the ** upvalue/local variable is begin used in a previous assignment to a ** table. I
src/lparser.cpp:4695
↓ 1 callersFunctioncheck_vm_compatibility
src/ldump.cpp:292
↓ 1 callersFunctioncheck_xml
src/lxml.cpp:9
↓ 1 callersFunctioncheckclib
** return registry.CLIBS[path] */
src/loadlib.cpp:326
↓ 1 callersFunctioncheckclosemth
** Check whether object at given level has a close metamethod and raise ** an error if not. */
src/lfunc.cpp:127
↓ 1 callersFunctioncheckkeyword
src/lparser.cpp:5901
↓ 1 callersFunctionchecklocal
src/lua.cpp:611
↓ 1 callersFunctioncheckmajorminor
** After an atomic incremental step from a major collection, ** check whether collector could return to minor collections. ** It checks whether the nu
src/lgc.cpp:1471
↓ 1 callersFunctioncheckminormajor
** Decide whether to shift to major mode. It shifts if the accumulated ** number of added old bytes (counted in 'GCmarked') is larger than ** 'minorma
src/lgc.cpp:1323
↓ 1 callersFunctioncheckoption
src/loslib.cpp:271
↓ 1 callersFunctioncheckrepeated
** Check whether there is already a label with the given 'name'. */
src/lparser.cpp:4957
↓ 1 callersFunctionchecktoclose
src/lparser.cpp:5470
↓ 1 callersFunctionchoosePivot
** Choose an element in the middle (2nd-3th quarters) of [lo,up] ** "randomized" by 'rnd' */
src/ltablib.cpp:408
↓ 1 callersFunctionclassstat
src/lparser.cpp:2336
↓ 1 callersFunctionclearNewSlice
** Clear new slice of the array. */
src/ltable.cpp:693
↓ 1 callersFunctionclearbuff
src/lobject.cpp:576
↓ 1 callersFunctionclosegoto
** Closes the goto at index 'g' to given 'label' and removes it ** from the list of pending gotos. ** If it jumps into the scope of some variable, rai
src/lparser.cpp:1297
↓ 1 callersFunctioncodebitwise
** Code bitwise operations; they are all commutative, so the function ** tries to put an integer constant as the 2nd operand (a K operand). */
src/lcode.cpp:1758
↓ 1 callersFunctioncodecommutative
** Code commutative operators ('+', '*'). If first operand is a ** numeric constant, change order of operands to try to use an ** immediate or K opera
src/lcode.cpp:1740
↓ 1 callersFunctioncodeconcat
** Create code for '(e1 .. e2)'. ** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', ** because concatenation is right associative), mer
src/lcode.cpp:1942
↓ 1 callersFunctioncodeeq
** Emit code for equality comparisons ('==', '~='). ** 'e1' was already put as RK by 'luaK_infix'. */
src/lcode.cpp:1808
↓ 1 callersFunctioncodenot
** Code 'not e', doing constant folding. */
src/lcode.cpp:1373
↓ 1 callersFunctioncodesJ
** Format and emit an 'isJ' instruction. */
src/lcode.cpp:439
↓ 1 callersFunctioncodeunexpval
** Emit code for unary expressions that "produce values" ** (everything but 'not'). ** Expression to produce final result will be encoded in 'e'. */
src/lcode.cpp:1615
↓ 1 callersFunctioncollectargs
** Traverses all arguments from 'argv', returning a mask with those ** needed before running any Lua code or an error code if it finds any ** invalid
src/lua.cpp:295
↓ 1 callersFunctioncollectvalidlines
src/ldebug.cpp:308
↓ 1 callersFunctioncombine
src/luac.cpp:154
↓ 1 callersFunctioncompoundassign
compound assignment function determines the binary operation to perform depending on lexer state tokens (ls->lasttoken) resets the lexer state tok
src/lparser.cpp:4739
↓ 1 callersFunctioncomputesizes
** Compute the optimal size for the array part of table 't'. ** This size maximizes the number of elements going to the array part ** while satisfying
src/ltable.cpp:446
↓ 1 callersFunctionconst2exp
** Convert a constant in 'v' into an expression description 'e' */
src/lcode.cpp:729
↓ 1 callersFunctionconstexprdefinestat
src/lparser.cpp:5395
↓ 1 callersFunctionconstexprifstat
src/lparser.cpp:5344
↓ 1 callersFunctionconstexprstat
src/lparser.cpp:5418
↓ 1 callersMethodcontains
src/lparser.h:343
↓ 1 callersFunctioncontinuestat
** Continue statement. Semantically similar to "goto continue". ** Unlike break, this doesn't use labels. It tracks where to jump via BlockCnt.scopeen
src/lparser.cpp:1678
↓ 1 callersFunctioncorrectgraylists
** Correct all gray lists, coalescing them into 'grayagain'. */
src/lgc.cpp:1260
↓ 1 callersFunctioncorrectpointers
** Correct pointers to objects inside 'allgc' list when ** object 'o' is being removed from the list. */
src/lgc.cpp:1056
↓ 1 callersFunctioncountdepth
src/lparser.cpp:1662
↓ 1 callersFunctioncreateargtable
** Create the 'arg' table, which stores all arguments from the ** command line ('argv'). It should be aligned so that, at index 0, ** it has 'argv[scr
src/lua.cpp:192
↓ 1 callersFunctioncreatelibstr
** Create a library string that, when deallocated, will unload 'plib' */
src/loadlib.cpp:351
↓ 1 callersFunctioncreatemeta
src/liolib.cpp:1421
↓ 1 callersFunctioncreatemetatable
src/lcorolib.cpp:252
↓ 1 callersFunctioncreatemetatable
src/lstrlib.cpp:2428
↓ 1 callersFunctioncreatesearcherstable
src/loadlib.cpp:752
↓ 1 callersFunctioncreatevarargtab
** Create a vararg table at the top of the stack, with 'n' elements ** starting at 'f'. */
src/ltm.cpp:238
↓ 1 callersFunctiondecode
src/ljson.cpp:177
↓ 1 callersFunctiondestructuring
src/lparser.cpp:5532
↓ 1 callersFunctiondoargs
src/luac.cpp:85
↓ 1 callersFunctiondofilecont
src/lbaselib.cpp:489
↓ 1 callersFunctiondolibrary
** Receives 'globname[=modname]' and runs 'globname = require(modname)'. ** If there is no explicit modname and globname contains a '-', cut ** the su
src/lua.cpp:225
← previousnext →801–900 of 1,782, ranked by callers