forked from haxenme/nme
-
Notifications
You must be signed in to change notification settings - Fork 0
/
haxedoc.xml
10518 lines (10518 loc) · 431 KB
/
haxedoc.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<haxe>
<class path="Array" params="T" file="/usr/lib/haxe/std/Array.hx" extern="1">
<iterator public="1" set="method">
<f a=""><t path="Iterator"><c path="Array.T"/></t></f>
<haxe_doc>Returns an iterator of the Array values.</haxe_doc>
</iterator>
<copy public="1" set="method">
<f a=""><c path="Array"><c path="Array.T"/></c></f>
<haxe_doc>Returns a copy of the Array. The values are not
copied, only the Array structure.</haxe_doc>
</copy>
<remove public="1" set="method">
<f a="x">
<c path="Array.T"/>
<e path="Bool"/>
</f>
<haxe_doc>Removes the first occurence of [x].
Returns false if [x] was not present.
Elements are compared by using standard equality.</haxe_doc>
</remove>
<insert public="1" set="method">
<f a="pos:x">
<c path="Int"/>
<c path="Array.T"/>
<e path="Void"/>
</f>
<haxe_doc>Inserts the element [x] at the position [pos].
All elements after [pos] are moved one index ahead.</haxe_doc>
</insert>
<unshift public="1" set="method">
<f a="x">
<c path="Array.T"/>
<e path="Void"/>
</f>
<haxe_doc>Adds the element [x] at the start of the array.</haxe_doc>
</unshift>
<toString public="1" set="method">
<f a=""><c path="String"/></f>
<haxe_doc>Returns a displayable representation of the Array content.</haxe_doc>
</toString>
<splice public="1" set="method">
<f a="pos:len">
<c path="Int"/>
<c path="Int"/>
<c path="Array"><c path="Array.T"/></c>
</f>
<haxe_doc>Removes [len] elements starting from [pos] an returns them.</haxe_doc>
</splice>
<sort public="1" set="method">
<f a="f">
<f a=":">
<c path="Array.T"/>
<c path="Array.T"/>
<c path="Int"/>
</f>
<e path="Void"/>
</f>
<haxe_doc><![CDATA[Sort the Array according to the comparison function [f].
[f(x,y)] should return [0] if [x == y], [>0] if [x > y]
and [<0] if [x < y].]]></haxe_doc>
</sort>
<slice public="1" set="method">
<f a="pos:?end">
<c path="Int"/>
<c path="Int"/>
<c path="Array"><c path="Array.T"/></c>
</f>
<haxe_doc>Copies the range of the array starting at [pos] up to,
but not including, [end]. Both [pos] and [end] can be
negative to count from the end: -1 is the last item in
the array.</haxe_doc>
</slice>
<shift public="1" set="method">
<f a=""><t path="Null"><c path="Array.T"/></t></f>
<haxe_doc>Removes the first element and returns it.</haxe_doc>
</shift>
<reverse public="1" set="method">
<f a=""><e path="Void"/></f>
<haxe_doc>Reverse the order of elements of the Array.</haxe_doc>
</reverse>
<push public="1" set="method">
<f a="x">
<c path="Array.T"/>
<c path="Int"/>
</f>
<haxe_doc>Adds the element [x] at the end of the array.</haxe_doc>
</push>
<pop public="1" set="method">
<f a=""><t path="Null"><c path="Array.T"/></t></f>
<haxe_doc>Removes the last element of the array and returns it.</haxe_doc>
</pop>
<join public="1" set="method">
<f a="sep">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Returns a representation of an array with [sep] for separating each element.</haxe_doc>
</join>
<concat public="1" set="method">
<f a="a">
<c path="Array"><c path="Array.T"/></c>
<c path="Array"><c path="Array.T"/></c>
</f>
<haxe_doc>Returns a new Array by appending [a] to [this].</haxe_doc>
</concat>
<length public="1" set="null">
<c path="Int"/>
<haxe_doc>The length of the Array</haxe_doc>
</length>
<new public="1" set="method">
<f a=""><e path="Void"/></f>
<haxe_doc>Creates a new Array.</haxe_doc>
</new>
<haxe_doc>An Array is a storage for values. You can access it using indexes or
with its API. On the server side, it's often better to use a [List] which
is less memory and CPU consuming, unless you really need indexed access.</haxe_doc>
</class>
<class path="Class" params="T" file="/usr/lib/haxe/std/Class.hx" extern="1"><haxe_doc>An abstract type that represents a Class.
See [Type] for the haXe Reflection API.</haxe_doc></class>
<class path="Date" params="" file="/usr/lib/haxe/std/cpp/_std/Date.hx">
<now public="1" set="method" line="55" static="1">
<f a=""><c path="Date"/></f>
<haxe_doc>Returns a Date representing the current local time.</haxe_doc>
</now>
<fromTime public="1" set="method" line="59" static="1">
<f a="t">
<c path="Float"/>
<c path="Date"/>
</f>
<haxe_doc>Returns a Date from a timestamp [t] which is the number of
milliseconds elapsed since 1st January 1970.</haxe_doc>
</fromTime>
<fromString public="1" set="method" line="65" static="1">
<f a="s">
<c path="String"/>
<c path="Date"/>
</f>
<haxe_doc>Returns a Date from a formated string of one of the following formats :
[YYYY-MM-DD hh:mm:ss] or [YYYY-MM-DD] or [hh:mm:ss]. The first two formats
are expressed in local time, the third in UTC Epoch.</haxe_doc>
</fromString>
<toString public="1" set="method" line="53">
<f a=""><c path="String"/></f>
<haxe_doc>Returns a string representation for the Date, by using the
standard format [YYYY-MM-DD HH:MM:SS]. See [DateTools.format] for
other formating rules.</haxe_doc>
</toString>
<getDay public="1" set="method" line="51">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the week day of the date (0-6 range).</haxe_doc>
</getDay>
<getDate public="1" set="method" line="49">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the day of the date (1-31 range).</haxe_doc>
</getDate>
<getMonth public="1" set="method" line="47">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the month of the date (0-11 range).</haxe_doc>
</getMonth>
<getFullYear public="1" set="method" line="45">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the full year of the date.</haxe_doc>
</getFullYear>
<getSeconds public="1" set="method" line="43">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the seconds of the date (0-59 range).</haxe_doc>
</getSeconds>
<getMinutes public="1" set="method" line="41">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the minutes value of the date (0-59 range).</haxe_doc>
</getMinutes>
<getHours public="1" set="method" line="39">
<f a=""><c path="Int"/></f>
<haxe_doc>Returns the hours value of the date (0-23 range).</haxe_doc>
</getHours>
<getTime public="1" set="method" line="35">
<f a=""><c path="Float"/></f>
<haxe_doc>Returns the timestamp of the date. It's the number of milliseconds
elapsed since 1st January 1970. It might only have a per-second precision
depending on the platforms.</haxe_doc>
</getTime>
<mSeconds><c path="Float"/></mSeconds>
<new public="1" set="method" line="31">
<f a="year:month:day:hour:min:sec">
<c path="Int"/>
<c path="Int"/>
<c path="Int"/>
<c path="Int"/>
<c path="Int"/>
<c path="Int"/>
<e path="Void"/>
</f>
<haxe_doc>Creates a new date object.</haxe_doc>
</new>
<haxe_doc>The Date class is used for date manipulation. There is some extra functions
available in the [DateTools] class.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<class path="Enum" params="T" file="/usr/lib/haxe/std/Enum.hx" extern="1"><haxe_doc>An abstract type that represents an Enum.
See [Type] for the haXe Reflection API.</haxe_doc></class>
<class path="EnumValue" params="" file="/usr/lib/haxe/std/EnumValue.hx" extern="1"><haxe_doc>An abstract type that represents any enum value.
See [Type] for the haXe Reflection API.</haxe_doc></class>
<class path="Hash" params="T" file="/usr/lib/haxe/std/cpp/_std/Hash.hx">
<toString public="1" set="method" line="76">
<f a=""><c path="String"/></f>
<haxe_doc>Returns an displayable representation of the hashtable content.</haxe_doc>
</toString>
<iterator public="1" set="method" line="61">
<f a=""><t path="Iterator"><c path="Hash.T"/></t></f>
<haxe_doc>Returns an iterator of all values in the hashtable.</haxe_doc>
</iterator>
<keys public="1" set="method" line="52">
<f a=""><t path="Iterator"><c path="String"/></t></f>
<haxe_doc>Returns an iterator of all keys in the hashtable.</haxe_doc>
</keys>
<remove public="1" set="method" line="45">
<f a="key">
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Removes a hashtable entry. Returns [true] if
there was such entry.</haxe_doc>
</remove>
<exists public="1" set="method" line="41">
<f a="key">
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if a value exists for the given key.
In particular, it's useful to tells if a key has
a [null] value versus no value.</haxe_doc>
</exists>
<get public="1" set="method" line="37">
<f a="key">
<c path="String"/>
<t path="Null"><c path="Hash.T"/></t>
</f>
<haxe_doc>Get a value for the given key.</haxe_doc>
</get>
<set public="1" set="method" line="33">
<f a="key:value">
<c path="String"/>
<c path="Hash.T"/>
<e path="Void"/>
</f>
<haxe_doc>Set a value for the given key.</haxe_doc>
</set>
<__Internal><d/></__Internal>
<new public="1" set="method" line="29">
<f a=""><e path="Void"/></f>
<haxe_doc>Creates a new empty hashtable.</haxe_doc>
</new>
<haxe_doc>Hashtable over a set of elements, using [String] as keys.
Other kind of keys are not possible on all platforms since they
can't always be implemented efficiently.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<class path="IntHash" params="T" file="/usr/lib/haxe/std/cpp/_std/IntHash.hx">
<toString public="1" set="method" line="60">
<f a=""><c path="String"/></f>
<haxe_doc>Returns an displayable representation of the hashtable content.</haxe_doc>
</toString>
<iterator public="1" set="method" line="55">
<f a=""><t path="Iterator"><c path="IntHash.T"/></t></f>
<haxe_doc>Returns an iterator of all values in the hashtable.</haxe_doc>
</iterator>
<keys public="1" set="method" line="50">
<f a=""><t path="Iterator"><c path="Int"/></t></f>
<haxe_doc>Returns an iterator of all keys in the hashtable.</haxe_doc>
</keys>
<remove public="1" set="method" line="46">
<f a="key">
<c path="Int"/>
<e path="Bool"/>
</f>
<haxe_doc>Removes a hashtable entry. Returns [true] if
there was such entry.</haxe_doc>
</remove>
<exists public="1" set="method" line="42">
<f a="key">
<c path="Int"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if a value exists for the given key.
In particular, it's useful to tells if a key has
a [null] value versus no value.</haxe_doc>
</exists>
<get public="1" set="method" line="38">
<f a="key">
<c path="Int"/>
<t path="Null"><c path="IntHash.T"/></t>
</f>
<haxe_doc>Get a value for the given key.</haxe_doc>
</get>
<set public="1" set="method" line="34">
<f a="key:value">
<c path="Int"/>
<c path="IntHash.T"/>
<e path="Void"/>
</f>
<haxe_doc>Set a value for the given key.</haxe_doc>
</set>
<h><d/></h>
<new public="1" set="method" line="30">
<f a=""><e path="Void"/></f>
<haxe_doc>Creates a new empty hashtable.</haxe_doc>
</new>
<haxe_doc>Hashtable over a set of elements, using [Int] as keys.
On Flash and Javascript, the underlying structure is an Object.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<class path="IntIter" params="" file="/usr/lib/haxe/std/IntIter.hx">
<next public="1" set="method" line="53">
<f a=""><c path="Int"/></f>
<haxe_doc>Moves to the next item of the iterator.</haxe_doc>
</next>
<hasNext public="1" set="method" line="46">
<f a=""><e path="Bool"/></f>
<haxe_doc>Returns true if the iterator has other items, false otherwise.</haxe_doc>
</hasNext>
<max><c path="Int"/></max>
<min><c path="Int"/></min>
<new public="1" set="method" line="38">
<f a="min:max">
<c path="Int"/>
<c path="Int"/>
<e path="Void"/>
</f>
<haxe_doc><![CDATA[Iterate from [min] (inclusive) to [max] (exclusive).
If [max <= min], the iterator will not act as a countdown.]]></haxe_doc>
</new>
<haxe_doc>Integer iterator. Used for interval implementation.</haxe_doc>
</class>
<class path="List" params="T" file="/usr/lib/haxe/std/List.hx">
<map public="1" params="X" set="method" line="246">
<f a="f">
<f a="">
<c path="List.T"/>
<c path="map.X"/>
</f>
<c path="List"><c path="map.X"/></c>
</f>
<haxe_doc>Returns a new list where all elements have been converted
by the function [f].</haxe_doc>
</map>
<filter public="1" set="method" line="230">
<f a="f">
<f a="">
<c path="List.T"/>
<e path="Bool"/>
</f>
<c path="List"><c path="List.T"/></c>
</f>
<haxe_doc>Returns a list filtered with [f]. The returned list
will contain all elements [x] for which [f(x) = true].</haxe_doc>
</filter>
<join public="1" set="method" line="211">
<f a="sep">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Join the element of the list by using the separator [sep].</haxe_doc>
</join>
<toString public="1" set="method" line="191">
<f a=""><c path="String"/></f>
<haxe_doc>Returns a displayable representation of the String.</haxe_doc>
</toString>
<iterator public="1" set="method" line="152">
<f a=""><t path="Iterator"><c path="List.T"/></t></f>
<haxe_doc>Returns an iterator on the elements of the list.</haxe_doc>
</iterator>
<remove public="1" set="method" line="129">
<f a="v">
<c path="List.T"/>
<e path="Bool"/>
</f>
<haxe_doc>Remove the first element that is [== v] from the list.
Returns [true] if an element was removed, [false] otherwise.</haxe_doc>
</remove>
<clear public="1" set="method" line="119">
<f a=""><e path="Void"/></f>
<haxe_doc>Makes the list empty.</haxe_doc>
</clear>
<isEmpty public="1" set="method" line="112">
<f a=""><e path="Bool"/></f>
<haxe_doc>Tells if a list is empty.</haxe_doc>
</isEmpty>
<pop public="1" set="method" line="98">
<f a=""><t path="Null"><c path="List.T"/></t></f>
<haxe_doc>Removes the first element of the list and
returns it or simply returns null if the
list is empty.</haxe_doc>
</pop>
<last public="1" set="method" line="88">
<f a=""><t path="Null"><c path="List.T"/></t></f>
<haxe_doc>Returns the last element of the list, or null
if the list is empty.</haxe_doc>
</last>
<first public="1" set="method" line="80">
<f a=""><t path="Null"><c path="List.T"/></t></f>
<haxe_doc>Returns the first element of the list, or null
if the list is empty.</haxe_doc>
</first>
<push public="1" set="method" line="64">
<f a="item">
<c path="List.T"/>
<e path="Void"/>
</f>
<haxe_doc>Push an element at the beginning of the list.</haxe_doc>
</push>
<add public="1" set="method" line="51">
<f a="item">
<c path="List.T"/>
<e path="Void"/>
</f>
<haxe_doc>Add an element at the end of the list.</haxe_doc>
</add>
<length public="1" set="null">
<c path="Int"/>
<haxe_doc>The number of elements in this list.</haxe_doc>
</length>
<q><c path="Array"><d/></c></q>
<h><c path="Array"><d/></c></h>
<new public="1" set="method" line="44">
<f a=""><e path="Void"/></f>
<haxe_doc>Creates a new empty list.</haxe_doc>
</new>
<haxe_doc>A linked-list of elements. The list is composed of two-elements arrays
that are chained together. It's optimized so that adding or removing an
element doesn't imply to copy the whole array content everytime.</haxe_doc>
</class>
<class path="Math" params="" file="/usr/lib/haxe/std/Math.hx" extern="1">
<PI public="1" set="null" static="1"><c path="Float"/></PI>
<NaN public="1" set="null" static="1"><c path="Float"/></NaN>
<NEGATIVE_INFINITY public="1" set="null" static="1"><c path="Float"/></NEGATIVE_INFINITY>
<POSITIVE_INFINITY public="1" set="null" static="1"><c path="Float"/></POSITIVE_INFINITY>
<abs public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></abs>
<min public="1" set="method" static="1"><f a="a:b">
<c path="Float"/>
<c path="Float"/>
<c path="Float"/>
</f></min>
<max public="1" set="method" static="1"><f a="a:b">
<c path="Float"/>
<c path="Float"/>
<c path="Float"/>
</f></max>
<sin public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></sin>
<cos public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></cos>
<atan2 public="1" set="method" static="1"><f a="y:x">
<c path="Float"/>
<c path="Float"/>
<c path="Float"/>
</f></atan2>
<tan public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></tan>
<exp public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></exp>
<log public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></log>
<sqrt public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></sqrt>
<round public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Int"/>
</f></round>
<floor public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Int"/>
</f></floor>
<ceil public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Int"/>
</f></ceil>
<atan public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></atan>
<asin public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></asin>
<acos public="1" set="method" static="1"><f a="v">
<c path="Float"/>
<c path="Float"/>
</f></acos>
<pow public="1" set="method" static="1"><f a="v:exp">
<c path="Float"/>
<c path="Float"/>
<c path="Float"/>
</f></pow>
<random public="1" set="method" static="1"><f a=""><c path="Float"/></f></random>
<isFinite public="1" set="method" static="1"><f a="f">
<c path="Float"/>
<e path="Bool"/>
</f></isFinite>
<isNaN public="1" set="method" static="1"><f a="f">
<c path="Float"/>
<e path="Bool"/>
</f></isNaN>
<haxe_doc>This class defines mathematical functions and constants.</haxe_doc>
</class>
<class path="Reflect" params="" file="/usr/lib/haxe/std/cpp/_std/Reflect.hx">
<hasField public="1" set="method" line="29" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if an object has a field set. This doesn't take into account the object prototype (class methods).</haxe_doc>
</hasField>
<field public="1" set="method" line="33" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<d/>
</f>
<haxe_doc>Returns the field of an object, or null if [o] is not an object or doesn't have this field.</haxe_doc>
</field>
<setField public="1" get="inline" set="null" line="37" static="1">
<f a="o:field:value">
<d/>
<c path="String"/>
<d/>
<e path="Void"/>
</f>
<haxe_doc>Set an object field value.</haxe_doc>
</setField>
<getProperty public="1" get="inline" set="null" line="42" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<d/>
</f>
<haxe_doc>Similar to field but also supports property (might be slower).</haxe_doc>
</getProperty>
<setProperty public="1" get="inline" set="null" line="46" static="1">
<f a="o:field:value">
<d/>
<c path="String"/>
<d/>
<e path="Void"/>
</f>
<haxe_doc>Similar to setField but also supports property (might be slower).</haxe_doc>
</setProperty>
<callMethod public="1" set="method" line="51" static="1">
<f a="o:func:args">
<d/>
<d/>
<c path="Array"><d/></c>
<d/>
</f>
<haxe_doc>Call a method with the given object and arguments.</haxe_doc>
</callMethod>
<fields public="1" set="method" line="58" static="1">
<f a="o">
<d/>
<c path="Array"><c path="String"/></c>
</f>
<haxe_doc>Returns the list of fields of an object, excluding its prototype (class methods).</haxe_doc>
</fields>
<isFunction public="1" set="method" line="65" static="1">
<f a="f">
<d/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if a value is a function or not.</haxe_doc>
</isFunction>
<compare public="1" params="T" set="method" line="69" static="1">
<f a="a:b">
<c path="compare.T"/>
<c path="compare.T"/>
<c path="Int"/>
</f>
<haxe_doc>Generic comparison function, does not work for methods, see [compareMethods]</haxe_doc>
</compare>
<compareMethods public="1" set="method" line="73" static="1">
<f a="f1:f2">
<d/>
<d/>
<e path="Bool"/>
</f>
<haxe_doc>Compare two methods closures. Returns true if it's the same method of the same instance.</haxe_doc>
</compareMethods>
<isObject public="1" set="method" line="81" static="1">
<f a="v">
<d/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if a value is an object or not.</haxe_doc>
</isObject>
<deleteField public="1" set="method" line="88" static="1">
<f a="o:f">
<d/>
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Delete an object field.</haxe_doc>
</deleteField>
<copy public="1" params="T" set="method" line="93" static="1">
<f a="o">
<c path="copy.T"/>
<c path="copy.T"/>
</f>
<haxe_doc>Make a copy of the fields of an object.</haxe_doc>
</copy>
<makeVarArgs public="1" set="method" line="104" static="1">
<f a="f">
<f a="">
<c path="Array"><d/></c>
<d/>
</f>
<d/>
</f>
<haxe_doc>Transform a function taking an array of arguments into a function that can
be called with any number of arguments.</haxe_doc>
</makeVarArgs>
<haxe_doc>The Reflect API is a way to manipulate values dynamicly through an
abstract interface in an untyped manner. Use with care.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<class path="Std" params="" file="/usr/lib/haxe/std/cpp/_std/Std.hx">
<is public="1" set="method" line="27" static="1">
<f a="v:t">
<d/>
<d/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if a value v is of the type t.</haxe_doc>
</is>
<string public="1" set="method" line="31" static="1">
<f a="s">
<d/>
<c path="String"/>
</f>
<haxe_doc>Convert any value to a String</haxe_doc>
</string>
<int public="1" set="method" line="35" static="1">
<f a="x">
<c path="Float"/>
<c path="Int"/>
</f>
<haxe_doc>Convert a Float to an Int, rounded down.</haxe_doc>
</int>
<parseInt public="1" set="method" line="39" static="1">
<f a="x">
<c path="String"/>
<t path="Null"><c path="Int"/></t>
</f>
<haxe_doc>Convert a String to an Int, parsing different possible representations. Returns [null] if could not be parsed.</haxe_doc>
</parseInt>
<parseFloat public="1" set="method" line="43" static="1">
<f a="x">
<c path="String"/>
<c path="Float"/>
</f>
<haxe_doc>Convert a String to a Float, parsing different possible reprensations.</haxe_doc>
</parseFloat>
<random public="1" set="method" line="47" static="1">
<f a="x">
<c path="Int"/>
<c path="Int"/>
</f>
<haxe_doc>Return a random integer between 0 included and x excluded.</haxe_doc>
</random>
<haxe_doc>The Std class provides standard methods for manipulating basic types.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<enum path="Void" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes"><haxe_doc>The standard Void type. Only [null] values can be of the type [Void].</haxe_doc></enum>
<class path="Float" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes" extern="1"><haxe_doc>The standard Float type, this is a double-precision IEEE 64bit float.</haxe_doc></class>
<class path="Int" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes" extern="1">
<extends path="Float"/>
<haxe_doc>The standard Int type. Its precision depends on the platform.</haxe_doc>
</class>
<typedef path="Null" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<c path="Null.T"/>
<haxe_doc>[Null] can be useful in two cases. In order to document some methods
that accepts or can return a [null] value, or for the Flash9 compiler and AS3
generator to distinguish between base values that can be null and others that
can't.</haxe_doc>
</typedef>
<enum path="Bool" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<true/>
<false/>
<haxe_doc>The standard Boolean type is represented as an enum with two choices.</haxe_doc>
</enum>
<class path="Dynamic" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes" extern="1"><haxe_doc>Dynamic is an internal compiler type which has special behavior.
See the haXe language reference for more informations.</haxe_doc></class>
<typedef path="Iterator" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<a>
<next set="method"><f a=""><c path="Iterator.T"/></f></next>
<hasNext set="method"><f a=""><e path="Bool"/></f></hasNext>
</a>
<haxe_doc>An Iterator is a structure that permits to list a given container
values. It can be used by your own data structures. See the haXe
documentation for more informations.</haxe_doc>
</typedef>
<typedef path="Iterable" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<a><iterator set="method"><f a=""><t path="Iterator"><c path="Iterable.T"/></t></f></iterator></a>
<haxe_doc>An Iterable is a data structure which has an iterator() method.
See [Lambda] for generic functions on iterable structures.</haxe_doc>
</typedef>
<class path="ArrayAccess" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes" extern="1" interface="1"><haxe_doc>ArrayAccess is used to indicate a class that can be accessed using brackets.
The type parameter represent the type of the elements stored.</haxe_doc></class>
<class path="String" params="" file="/usr/lib/haxe/std/String.hx" extern="1">
<fromCharCode public="1" set="method" static="1"><f a="code">
<c path="Int"/>
<c path="String"/>
</f></fromCharCode>
<toString public="1" set="method">
<f a=""><c path="String"/></f>
<haxe_doc>Returns the String itself.</haxe_doc>
</toString>
<substring public="1" set="method">
<f a="startIndex:?endIndex">
<c path="Int"/>
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc><![CDATA[Returns a part of the String, taking from [startIndex] to [endIndex] - 1.
If [endIndex] is not specified, length is used.
If [startIndex] or [endIndex] is smaller than 0, than 0 is used.
If [startIndex] > [endIndex] then they are swaped.]]></haxe_doc>
</substring>
<substr public="1" set="method">
<f a="pos:?len">
<c path="Int"/>
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Returns a part of the String, taking [len] characters starting from [pos].
If [len] is not specified, it takes all the remaining characters.</haxe_doc>
</substr>
<split public="1" set="method">
<f a="delimiter">
<c path="String"/>
<c path="Array"><c path="String"/></c>
</f>
<haxe_doc>Split the string using the specified delimiter.</haxe_doc>
</split>
<lastIndexOf public="1" set="method">
<f a="str:?startIndex">
<c path="String"/>
<c path="Int"/>
<c path="Int"/>
</f>
<haxe_doc>Similar to [indexOf] but returns the latest index.</haxe_doc>
</lastIndexOf>
<indexOf public="1" set="method">
<f a="str:?startIndex">
<c path="String"/>
<c path="Int"/>
<c path="Int"/>
</f>
<haxe_doc>Returns the index of first occurence of [value]
Returns [1-1] if [value] is not found.
The optional [startIndex] parameter allows you to specify at which character to start searching.
The position returned is still relative to the beginning of the string.</haxe_doc>
</indexOf>
<charCodeAt public="1" set="method">
<f a="index">
<c path="Int"/>
<t path="Null"><c path="Int"/></t>
</f>
<haxe_doc>Returns the character code at the given position.
Returns [null] if outside of String bounds.</haxe_doc>
</charCodeAt>
<charAt public="1" set="method">
<f a="index">
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Returns the character at the given position.
Returns the empty String if outside of String bounds.</haxe_doc>
</charAt>
<toLowerCase public="1" set="method">
<f a=""><c path="String"/></f>
<haxe_doc>Returns an String where all characters have been lowercased.</haxe_doc>
</toLowerCase>
<toUpperCase public="1" set="method">
<f a=""><c path="String"/></f>
<haxe_doc>Returns an String where all characters have been uppercased.</haxe_doc>
</toUpperCase>
<length public="1" set="null">
<c path="Int"/>
<haxe_doc>The number of characters in the String.</haxe_doc>
</length>
<new public="1" set="method">
<f a="string">
<c path="String"/>
<e path="Void"/>
</f>
<haxe_doc>Creates a copy from a given String.</haxe_doc>
</new>
<haxe_doc>The basic String class.</haxe_doc>
</class>
<class path="StringBuf" params="" file="/usr/lib/haxe/std/cpp/_std/StringBuf.hx">
<toString public="1" get="inline" set="null" line="47">
<f a=""><c path="String"/></f>
<haxe_doc>Returns the content of the string buffer.
The buffer is not emptied by this operation.</haxe_doc>
</toString>
<addChar public="1" get="inline" set="null" line="43">
<f a="c">
<c path="Int"/>
<e path="Void"/>
</f>
<haxe_doc>Adds a part of a string to the string buffer.</haxe_doc>
</addChar>
<addSub public="1" get="inline" set="null" line="39">
<f a="s:pos:?len">
<c path="String"/>
<c path="Int"/>
<c path="Int"/>
<e path="Void"/>
</f>
<haxe_doc>Adds a character to the string buffer.</haxe_doc>
</addSub>
<add public="1" get="inline" set="null" line="35">
<f a="x">
<d/>
<e path="Void"/>
</f>
<haxe_doc>Adds the representation of any value to the string buffer.</haxe_doc>
</add>
<b><c path="Array"><d/></c></b>
<new public="1" set="method" line="31">
<f a=""><e path="Void"/></f>
<haxe_doc>Creates a new string buffer.</haxe_doc>
</new>
<haxe_doc>A String buffer is an efficient way to build a big string by
appending small elements together.</haxe_doc>
<meta><m n=":core_api"/></meta>
</class>
<class path="StringTools" params="" file="/usr/lib/haxe/std/StringTools.hx">
<urlEncode public="1" set="method" line="41" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Encode an URL by using the standard format.</haxe_doc>
</urlEncode>
<urlDecode public="1" set="method" line="68" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Decode an URL using the standard format.</haxe_doc>
</urlDecode>
<htmlEscape public="1" set="method" line="95" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Escape HTML special characters of the string.</haxe_doc>
</htmlEscape>
<htmlUnescape public="1" set="method" line="102" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Unescape HTML special characters of the string.</haxe_doc>
</htmlUnescape>
<startsWith public="1" set="method" line="113" static="1">
<f a="s:start">
<c path="String"/>
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if the string [s] starts with the string [start].</haxe_doc>
</startsWith>
<endsWith public="1" set="method" line="126" static="1">
<f a="s:end">
<c path="String"/>
<c path="String"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if the string [s] ends with the string [end].</haxe_doc>
</endsWith>
<isSpace public="1" set="method" line="141" static="1">
<f a="s:pos">
<c path="String"/>
<c path="Int"/>
<e path="Bool"/>
</f>
<haxe_doc>Tells if the character in the string [s] at position [pos] is a space.</haxe_doc>
</isSpace>
<ltrim public="1" set="method" line="149" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Removes spaces at the left of the String [s].</haxe_doc>
</ltrim>
<rtrim public="1" set="method" line="170" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Removes spaces at the right of the String [s].</haxe_doc>
</rtrim>
<trim public="1" set="method" line="192" static="1">
<f a="s">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Removes spaces at the beginning and the end of the String [s].</haxe_doc>
</trim>
<rpad public="1" set="method" line="207" static="1">
<f a="s:c:l">
<c path="String"/>
<c path="String"/>
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Pad the string [s] by appending [c] at its right until it reach [l] characters.</haxe_doc>
</rpad>
<lpad public="1" set="method" line="229" static="1">
<f a="s:c:l">
<c path="String"/>
<c path="String"/>
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Pad the string [s] by appending [c] at its left until it reach [l] characters.</haxe_doc>
</lpad>
<replace public="1" set="method" line="254" static="1">
<f a="s:sub:by">
<c path="String"/>
<c path="String"/>
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Replace all occurences of the string [sub] in the string [s] by the string [by].</haxe_doc>
</replace>
<hex public="1" set="method" line="269" static="1">
<f a="n:?digits">
<c path="Int"/>
<c path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Encode a number into a hexadecimal representation, with an optional number of zeros for left padding.</haxe_doc>
</hex>
<fastCodeAt public="1" get="inline" set="null" line="292" static="1">
<f a="s:index">
<c path="String"/>
<c path="Int"/>
<c path="Int"/>
</f>
<haxe_doc>Provides a fast native string charCodeAt access. Since the EOF value might vary depending on the platforms, always test with StringTools.isEOF.
Only guaranteed to work if index in [0,s.length] range. Might not work with strings containing \0 char.</haxe_doc>
</fastCodeAt>
<isEOF public="1" get="inline" set="null" line="322" static="1"><f a="c">
<c path="Int"/>
<e path="Bool"/>
</f></isEOF>
<haxe_doc>The StringTools class contains some extra functionalities for [String]
manipulation. It's stored in a different class in order to prevent
the standard [String] of being bloated and thus increasing the size of
each application using it.</haxe_doc>
</class>
<class path="cpp.Lib" params="" file="/usr/lib/haxe/std/cpp/Lib.hx">
<load public="1" set="method" line="32" static="1">
<f a="lib:prim:nargs">
<c path="String"/>
<c path="String"/>
<c path="Int"/>
<d/>
</f>
<haxe_doc>Load and return a Cpp primitive from a DLL library.</haxe_doc>
</load>
<loadLazy public="1" set="method" line="44" static="1">
<f a="lib:prim:nargs">
<c path="String"/>
<c path="String"/>
<c path="Int"/>
<d/>
</f>
<haxe_doc>Tries to load, and always returns a valid function, but the function may throw
if called.</haxe_doc>
</loadLazy>
<rethrow public="1" set="method" line="60" static="1"><f a="inExp">
<d/>