Search results
From LSWiki
You searched for Closure
For more information about searching LSWiki, see Searching LSWiki.
Showing below up to 20 results starting with #1.
View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500).
Article title matches
- Man closure guide (27,741 bytes)
1: ==Introduction, Overview and Efun-Closures==
3: A closure is a pointer to a function. That means that it is...
7: To create a closure that points to an efun like write() you can write
11: I very often put parentheses around such a closure-notation because
13: especially of interest within lambda-closures (see below).
Page text matches
- Chats (4,471 bytes)
7: ...our chats (easier) or by writing custom functions/closures (harder).
42: Note that you can also put a [[closure]] in a chat, i.e.
48: ==Custom Commands and Closures in Chats==
50: There are any number of reasons to use [[closures]] in chats. The simplest case is that you want a... - Man message (21,943 bytes)
6: object array targets, closure filter);
36: message. This can be a closure (which will be called with the
60: ...object should receive the message. This can be a closure
110: :*A closure
111: :The closure will be evaluated with no arguments passed. It i... - Man style (11,837 bytes)
54: ...r array-literal or mapping-literal boundary, or a closure #' element.
114: When writing array, mapping, and inline closure literals in multi-line form,
133: [ Example : ] closure func = (: - Man call out (1,867 bytes)
3: *void call_out(closure cl, int delay, mixed arg, ...)
7: closure cl. The call will take place in delay seconds, wi... - Man mappings (14,221 bytes)
9: or closures aren't a good choice because comparision between...
234: ... Instead of a string for the name of a function a closure can be
257: given as a string or a closure:
271: a function name (or again a closure) as second argument. Any additional
303: closure cl; - Man modifiers (6,849 bytes)
17: build an lfun-closure with #' out of a private function.
20: with call_other(). It is possible to create #' closures
184: [[man closures|closures(LPC)]], [[man inheritance|inheritance(LPC)]], [[... - Man belonging (5,284 bytes)
47: A closure: Will be called with arguments of 1) the characte...
84: This value must be a closure, which will be called with arguments of
90: is equipped. This value must be a closure, which will be called with
95: is unequipped. This value must be a closure, which will be called with - Man cache (9,719 bytes)
107: key is set to 'value' (which, if a closure, will be called with up to ten
149: that the first argument to the value closure is a reference to a status - Man caust (8,707 bytes)
89: ..._Maintain_Message when the caust is active. If a closure, will be - Man closure guide (27,741 bytes)
1: ==Introduction, Overview and Efun-Closures==
3: A closure is a pointer to a function. That means that it is...
7: To create a closure that points to an efun like write() you can write
11: I very often put parentheses around such a closure-notation because
13: especially of interest within lambda-closures (see below). - Man closures (10,783 bytes)
3: Closures provide a means of creating code dynamically and
9: The simplest kind of closures are efuns, lfuns or operators.
10: For example, #'this_player is an example of a closure. You can
13: closure f;
30: Inline closures are a variant of lfun closures, the difference being - Man dialog (15,179 bytes)
36: A closure: Will be called with the dialog descriptor as arg...
48: ...ser. Most typically, this is done by supplying a closure that
52: action itself, without involving the closure. (This makes more sense
55: as the return value of a closure action or as the action itself.
200: Dialog_Init: A closure that will be called when the dialog is first - Man element (17,175 bytes)
75: ...tion. In this event, any descript for which your closure evaluates true will be considered a match.
238: to cloned objects, many closures) may be lost at some point. Also, do not
283: '''closure Element_Match(mixed spec)'''
286: descriptor and returns a closure which will match element descriptors - Man input core (6,532 bytes)
59: void set_input_handler(closure proc)
61: Sets, as a closure, the procedure the input type uses to process raw...
62: ...ived from the user. When input is received, this closure is called with
75: void set_input_prompt_add(closure proc)
77: Sets a closure that provides additions to the prompts of dialogs... - Man location (4,619 bytes)
68: A closure, which may return any of the above or an object
111: closure targets and selecting from among any random distr... - Man menu item (2,250 bytes)
24: colorization applies. In the case of a closure, received an extra second
30: Menu_Item_Access: Can be used to specify a closure that will determine
31: ... item is usable and will appear in the menu. The closure - Man more (4,075 bytes)
65: May be a closure, which will be called with the user as argument; ...
66: closure must always return the same number of lines, or i...
70: display. May be a closure, which will be called with the user as argument;
71: the closure must always return the same number of lines, or i...
74: More_Done: A closure to call when the user exits all more sessions. T... - Man special attack (17,964 bytes)
15: Fields below which can be given as closures receive either standard
21: 4) the character. All closures are expected to return a value that could
71: of its capacity. May be a closure, which receives damage arguments. It
76: be a closure, which receives damage arguments. It is preferab...
81: closure, which receives damage arguments. - Man descriptors (13,902 bytes)
313: X_Map(dxr, field, closure)
315: ...the value of the field to the return value of the closure specified, as call with its current value as argu... - Man descriptors core (16,885 bytes)
103: void set_descriptor_field_validate(closure proc)
106: assigned to fields. The closure given will receive arguments of 1) the
111: void set_descriptor_field_convert(closure proc)
114: field. The closure given will receive arguments of 1) the descriptor...
119: void set_descriptor_query_convert(closure proc)
View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500).