forked from haxenme/nme
-
Notifications
You must be signed in to change notification settings - Fork 0
/
haxedoc.xml
11137 lines (10879 loc) · 453 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">
<filter public="1" set="method"><f a="f">
<f a="">
<c path="Array.T"/>
<x path="Bool"/>
</f>
<c path="Array"><c path="Array.T"/></c>
</f></filter>
<map public="1" params="S" set="method"><f a="f">
<f a="">
<c path="Array.T"/>
<c path="map.S"/>
</f>
<c path="Array"><c path="map.S"/></c>
</f></map>
<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 shallow copy of [this] Array.
The elements are not copied and retain their identity, so
a[i] == a.copy()[i] is true for any valid i. However, a == a.copy() is
always false.</haxe_doc>
</copy>
<remove public="1" set="method">
<f a="x">
<c path="Array.T"/>
<x path="Bool"/>
</f>
<haxe_doc>Removes the first occurence of [x] in [this] Array.
This operation modifies [this] Array in place.
If [x] is found by checking standard equality, it is removed from [this]
Array and all following elements are reindexed acoordingly. The function
then returns true.
If [x] is not found, [this] Array is not changed and the function
returns false.</haxe_doc>
</remove>
<insert public="1" set="method">
<f a="pos:x">
<x path="Int"/>
<c path="Array.T"/>
<x path="Void"/>
</f>
<haxe_doc>Inserts the element [x] at the position [pos].
This operation modifies [this] Array in place.
The offset is calculated like so:
- If [pos] exceeds [this].length, the offset is [this].length.
- If [pos] is negative, the offset is calculated from the end of [this]
Array, i.e. [this].length + [pos]. If this yields a negative value,
the offset is 0.
- Otherwise, the offset is [pos].
If the resulting offset does not exceed [this].length, all elements from
and including that offset to the end of [this] Array are moved one index
ahead.</haxe_doc>
</insert>
<unshift public="1" set="method">
<f a="x">
<c path="Array.T"/>
<x path="Void"/>
</f>
<haxe_doc>Adds the element [x] at the start of [this] Array.
This operation modifies [this] Array in place.
[this].length and the index of each Array element increases by 1.</haxe_doc>
</unshift>
<toString public="1" set="method">
<f a=""><c path="String"/></f>
<haxe_doc>Returns a string representation of [this] Array.
The result will include the individual elements' String representations
separated by comma. The enclosing [ ] may be missing on some platforms,
use Std.string() to get a String representation that is consistent
across platforms.</haxe_doc>
</toString>
<splice public="1" set="method">
<f a="pos:len">
<x path="Int"/>
<x path="Int"/>
<c path="Array"><c path="Array.T"/></c>
</f>
<haxe_doc><![CDATA[Removes [len] elements from [this] Array, starting at and including
[pos], an returns them.
This operation modifies [this] Array in place.
If [len] is < 0 or [pos] exceeds [this].length, the result is the empty
Array [].
If [pos] is negative, its value is calculated from the end of [this]
Array by [this].length + [pos]. If this yields a negative value, 0 is
used instead.
If the sum of the resulting values for [len] and [pos] exceed
[this].length, this operation will affect the elements from [pos] to the
end of [this] Array.
The length of the returned Array is equal to the new length of [this]
Array subtracted from the original length of [this] Array. In other
words, each element of the original [this] Array either remains in
[this] Array or becomes an element of the returned Array.]]></haxe_doc>
</splice>
<sort public="1" set="method">
<f a="f">
<f a=":">
<c path="Array.T"/>
<c path="Array.T"/>
<x path="Int"/>
</f>
<x path="Void"/>
</f>
<haxe_doc><![CDATA[Sorts [this] Array according to the comparison function [f], where
[f(x,y)] returns 0 if x == y, a positive Int if x > y and a
negative Int if x < y.
This operation modifies [this] Array in place.
The sort operation is not guaranteed to be stable, which means that the
order of equal elements may not be retained. For a stable Array sorting
algorithm, haxe.ds.sort.MergeSort.sort() can be used instead.
If [f] is null, the result is unspecified.]]></haxe_doc>
</sort>
<slice public="1" set="method">
<f a="pos:?end">
<x path="Int"/>
<x path="Int"/>
<c path="Array"><c path="Array.T"/></c>
</f>
<haxe_doc>Creates a shallow copy of the range of [this] Array, starting at and
including [pos], up to but not including [end].
This operation does not modify [this] Array.
The elements are not copied and retain their identity.
If [end] is omitted or exceeds [this].length, it defaults to the end of
[this] Array.
If [pos] or [end] are negative, their offsets are calculated from the
end of [this] Array by [this].length + [pos] and [this].length + [end]
respectively. If this yields a negative value, 0 is used instead.
If [pos] exceeds [this].length or if [end} exceeds or equals [pos],
the result is [].</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 of [this] Array and returns it.
This operation modifies [this] Array in place.
If [this] has at least one element, [this].length and the index of each
remaining element is decreased by 1.
If [this] is the empty Array [], null is returned and the length remains
0.</haxe_doc>
</shift>
<reverse public="1" set="method">
<f a=""><x path="Void"/></f>
<haxe_doc><![CDATA[Reverse the order of elements of [this] Array.
This operation modifies [this] Array in place.
If [this].length < 2, [this] remains unchanged.]]></haxe_doc>
</reverse>
<push public="1" set="method">
<f a="x">
<c path="Array.T"/>
<x path="Int"/>
</f>
<haxe_doc>Adds the element [x] at the end of [this] Array and returns the offset
it was added at.
This operation modifies [this] Array in place.
[this].length will increase by 1.</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 [this] Array and returns it.
This operation modifies [this] Array in place.
If [this] has at least one element, [this].length will decrease by 1.
If [this] is the empty Array [], null is returned and the length remains
0.</haxe_doc>
</pop>
<join public="1" set="method">
<f a="sep">
<c path="String"/>
<c path="String"/>
</f>
<haxe_doc>Returns a string representation of [this] Array, with [sep] separating
each element.
The result of this operation is equal to Std.string(this[0]) + sep +
Std.string(this[1]) + sep + ... + sep + Std.string(this[this.length-1]).
If [this] is the empty Array [], the result is the empty String "". If
[this] has exactly one element, the result is equal to a call to
Std.string(this[0]).
If [a] is null, the result is unspecified.</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 the elements of [a] to the elements of
[this] Array.
This operation does not modify [this] Array.
If [a] is the empty Array [], a copy of [this] Array is returned.
The length of the returned Array is equal to the sum of [this].length
and [a].length.
If [a] is null, the result is unspecified.</haxe_doc>
</concat>
<length public="1" set="null">
<x path="Int"/>
<haxe_doc>The length of [this] Array.</haxe_doc>
</length>
<new public="1" set="method">
<f a=""><x 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>
<abstract path="Class" params="T" file="/usr/lib/haxe/std/Class.hx">
<haxe_doc>An abstract type that represents a Class.
See [Type] for the haXe Reflection API.</haxe_doc>
<meta>
<m n=":valueUsed"/>
<m n=":coreType"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<class path="Date" params="" file="/usr/lib/haxe/std/cpp/_std/Date.hx">
<fromString public="1" set="method" line="60" static="1">
<f a="s">
<c path="String"/>
<c path="Date"/>
</f>
<haxe_doc>Returns a Date from a formated string [s], with the following accepted
formats:
- [YYYY-MM-DD hh:mm:ss]
- [YYYY-MM-DD]
- [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="48">
<f a=""><c path="String"/></f>
<haxe_doc>Returns a string representation of [this] Date, by using the
standard format [YYYY-MM-DD HH:MM:SS]. See [DateTools.format] for
other formating rules.</haxe_doc>
</toString>
<mSeconds><x path="Float"/></mSeconds>
<new public="1" set="method" line="26">
<f a="year:month:day:hour:min:sec">
<x path="Int"/>
<x path="Int"/>
<x path="Int"/>
<x path="Int"/>
<x path="Int"/>
<x path="Int"/>
<x path="Void"/>
</f>
<haxe_doc>Creates a new date object from the given arguments.
The behaviour of a Date instance is only consistent across platforms if
the the arguments describe a valid date.
- month: 0 to 11
- day: 1 to 31
- hour: 0 to 23
- min: 0 to 59
- sec: 0 to 59</haxe_doc>
</new>
<haxe_doc>The Date class provides a basic structure for date and time related
information. Date instances can be created by
- new Date() for a specific date,
- Date.now() to obtain information about the current time,
- Date.fromTime() with a given timestamp or
- Date.fromString() by parsing from a String.
There is some extra functions available in the [DateTools] class.
In the context of haxe dates, a timestamp is defined as the number of
milliseconds elapsed since 1st January 1970.</haxe_doc>
<meta>
<m n=":keep"/>
<m n=":coreApi"/>
</meta>
</class>
<abstract path="Enum" params="T" file="/usr/lib/haxe/std/Enum.hx">
<haxe_doc>An abstract type that represents an Enum type.
The corresponding enum instance type is EnumValue.
See [Type] for the haXe Reflection API.</haxe_doc>
<meta>
<m n=":coreType"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<abstract path="EnumValue" params="" file="/usr/lib/haxe/std/EnumValue.hx">
<haxe_doc>An abstract type that represents any enum value.
See [Type] for the haXe Reflection API.</haxe_doc>
<meta><m n=":coreType"/></meta>
</abstract>
<class path="List" params="T" file="/usr/lib/haxe/std/List.hx">
<iterator public="1" set="method" line="148">
<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="125">
<f a="v">
<c path="List.T"/>
<x 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>
<isEmpty public="1" set="method" line="108">
<f a=""><x path="Bool"/></f>
<haxe_doc>Tells if a list is empty.</haxe_doc>
</isEmpty>
<push public="1" set="method" line="60">
<f a="item">
<c path="List.T"/>
<x path="Void"/>
</f>
<haxe_doc>Push an element at the beginning of the list.</haxe_doc>
</push>
<add public="1" set="method" line="47">
<f a="item">
<c path="List.T"/>
<x path="Void"/>
</f>
<haxe_doc>Add an element at the end of the list.</haxe_doc>
</add>
<length public="1" set="null">
<x 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="40">
<f a=""><x 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>
<meta><m n=":keep"/></meta>
</class>
<abstract path="Map" params="K:V" file="/usr/lib/haxe/std/Map.hx">
<from>
<c path="haxe.ds.StringMap"><c path="fromStringMap.V"/></c>
<c path="haxe.ds.IntMap"><c path="fromIntMap.V"/></c>
<c path="haxe.ds.ObjectMap">
<c path="fromObjectMap.K"/>
<c path="fromObjectMap.V"/>
</c>
</from>
<to>
<c path="haxe.ds.StringMap"><c path="Map.V"/></c>
<c path="haxe.ds.IntMap"><c path="Map.V"/></c>
<c path="haxe.ds.ObjectMap">
<c path="toObjectMap.K"/>
<c path="Map.V"/>
</c>
</to>
<haxe_doc><![CDATA[Map allows key to value mapping for arbitrary value types, and many key
types.
This is a multi-type abstract, it is instantiated as one of its
specialization types depending on its type parameters.
A Map can be instantiated without explicit type parameters. Type inference
will then determine the type parameters from the usage.
Maps can also be created with [key1 => value1, key2 => value2] syntax.
Map is an abstract type, it is not available at runtime.]]></haxe_doc>
<meta><m n=":multiType"/></meta>
</abstract>
<class path="IMap" params="K:V" file="/usr/lib/haxe/std/Map.hx" module="Map" interface="1"><meta><m n=":keep"/></meta></class>
<typedef path="_Map.Hashable" params="" file="/usr/lib/haxe/std/Map.hx" private="1" module="Map"><a><hashCode set="method"><f a=""><x path="Int"/></f></hashCode></a></typedef>
<class path="Math" params="" file="/usr/lib/haxe/std/Math.hx" extern="1">
<PI public="1" set="null" static="1"><x path="Float"/></PI>
<NEGATIVE_INFINITY public="1" set="null" static="1">
<x path="Float"/>
<haxe_doc>A special Float constant which denotes negative infinity.
For example, this is the result of -1.0 / 0.0.
Operations with NEGATIVE_INFINITY as an operand may result in
Operations with NEGATIVE_INFINITY as an operand may result in
NEGATIVE_INFINITY, POSITIVE_INFINITY or NaN. For detailed information,
see ...
If this constant is converted to an Int, e.g. through Std.int(), the
result is unspecified.</haxe_doc>
</NEGATIVE_INFINITY>
<POSITIVE_INFINITY public="1" set="null" static="1">
<x path="Float"/>
<haxe_doc>A special Float constant which denotes negative infinity.
For example, this is the result of 1.0 / 0.0.
Operations with POSITIVE_INFINITY as an operand may result in
NEGATIVE_INFINITY, POSITIVE_INFINITY or NaN. For detailed information,
see ...
If this constant is converted to an Int, e.g. through Std.int(), the
result is unspecified.</haxe_doc>
</POSITIVE_INFINITY>
<NaN public="1" set="null" static="1">
<x path="Float"/>
<haxe_doc>A special Float constant which denotes an invalid number.
NaN stands for "Not a Number". It occurs when a mathematically incorrect
operation is executed, such as taking the square root of a negative
number: Math.sqrt(-1).
All further operations with NaN as an operand will result in NaN.
If this constant is converted to an Int, e.g. through Std.int(), the
result is unspecified.
In order to test if a value is NaN, you should use Math.isNaN() function.
(Php) In PHP versions prior to 5.3.1 VC 9 there may be unexpected
results when performing arithmetic operations with NaN on Windows, see:
https://bugs.php.net/bug.php?id=42143</haxe_doc>
</NaN>
<abs public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the absolute value of [v].
If [v] is positive or 0, the result is unchanged. Otherwise the result
is -[v].
If [v] is NEGATIVE_INFINITY or POSITIVE_INFINITY, the result is
POSITIVE_INFINITY.
If [v] is NaN, the result is NaN.</haxe_doc>
</abs>
<min public="1" set="method" static="1">
<f a="a:b">
<x path="Float"/>
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the smaller of values [a] and [b].
If [a] or [b] are NaN, the result is NaN.
If [a] or [b] are NEGATIVE_INFINITY, the result is NEGATIVE_INFINITY.
If [a] and [b] are POSITIVE_INFINITY, the result is POSITIVE_INFINITY.</haxe_doc>
</min>
<max public="1" set="method" static="1">
<f a="a:b">
<x path="Float"/>
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the greater of values [a] and [b].
If [a] or [b] are NaN, the result is NaN.
If [a] or [b] are POSITIVE_INFINITY, the result is POSITIVE_INFINITY.
If [a] and [b] are NEGATIVE_INFINITY, the result is NEGATIVE_INFINITY.</haxe_doc>
</max>
<sin public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the trigonometric sine of [v].
The unit of [v] is radians.
If [v] is NaN or infinite, the result is NaN.</haxe_doc>
</sin>
<cos public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the trigonometric cosine of [v].
The unit of [v] is radians.
If [v] is NaN or infinite, the result is NaN.</haxe_doc>
</cos>
<tan public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></tan>
<asin public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></asin>
<acos public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></acos>
<atan public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></atan>
<atan2 public="1" set="method" static="1"><f a="y:x">
<x path="Float"/>
<x path="Float"/>
<x path="Float"/>
</f></atan2>
<exp public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns Euler's number, raised to the power of [v].
exp(1.0) is approximately 2.718281828459.
If [v] is POSITIVE_INFINITY, the result is POSITIVE_INFINITY.
If [v] is NEGATIVE_INFINITY, the result is 0.0.
If [v] is NaN, the result is NaN.</haxe_doc>
</exp>
<log public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the natural logarithm of [v].
If [v] is negative (including NEGATIVE_INFINITY) or NaN, the result is
NaN.
If [v] is POSITIVE_INFINITY, the result is POSITIVE_INFINITY.
If [v] is 0.0, the result is NEGATIVE_INFINITY.
This is the inverse operation of exp, i.e. log(exp(v)) == v always
holds.</haxe_doc>
</log>
<pow public="1" set="method" static="1"><f a="v:exp">
<x path="Float"/>
<x path="Float"/>
<x path="Float"/>
</f></pow>
<sqrt public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Float"/>
</f>
<haxe_doc>Returns the square root of [v].
If [v] is negative (including NEGATIVE_INFINITY) or NaN, the result is
NaN.
If [v] is POSITIVE_INFINITY, the result is POSITIVE_INFINITY.
If [v] is 0.0, the result is 0.0.</haxe_doc>
</sqrt>
<round public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Int"/>
</f>
<haxe_doc>Rounds [v] to the nearest Int value.
If v is outside of the signed Int32 range, or is NaN, NEGATIVE_INFINITY or POSITIVE_INFINITY, the result is unspecified.
TODO: need spec</haxe_doc>
</round>
<floor public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Int"/>
</f>
<haxe_doc>Returns the largest Int value that is not greater than [v].
If v is outside of the signed Int32 range, or is NaN, NEGATIVE_INFINITY or POSITIVE_INFINITY, the result is unspecified.
TODO: need spec</haxe_doc>
</floor>
<ceil public="1" set="method" static="1">
<f a="v">
<x path="Float"/>
<x path="Int"/>
</f>
<haxe_doc>Returns the smallest Int value that is not less than [v].
If v is outside of the signed Int32 range, or is NaN, NEGATIVE_INFINITY or POSITIVE_INFINITY, the result is unspecified.
TODO: need spec</haxe_doc>
</ceil>
<random public="1" set="method" static="1">
<f a=""><x path="Float"/></f>
<haxe_doc>Returns a pseudo-random number which is greater than or equal to 0.0,
and less than 1.0.</haxe_doc>
</random>
<ffloor public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></ffloor>
<fceil public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></fceil>
<fround public="1" set="method" static="1"><f a="v">
<x path="Float"/>
<x path="Float"/>
</f></fround>
<isFinite public="1" set="method" static="1">
<f a="f">
<x path="Float"/>
<x path="Bool"/>
</f>
<haxe_doc>Tells if [f] is a finite number.
If [f] is POSITIVE_INFINITY, NEGATIVE_INFINITY or NaN, the result is
false.
Otherwise the result is true.</haxe_doc>
</isFinite>
<isNaN public="1" set="method" static="1">
<f a="f">
<x path="Float"/>
<x path="Bool"/>
</f>
<haxe_doc>Tells if [f] is not a valid number.
If [f] is NaN, the result is true.
Otherwise the result is false. In particular, both POSITIVE_INFINITY and
NEGATIVE_INFINITY are not considered NaN.</haxe_doc>
</isNaN>
<haxe_doc>This class defines mathematical functions and constants.</haxe_doc>
<meta><m n=":include"><e>"hxMath"</e></m></meta>
</class>
<class path="Reflect" params="" file="/usr/lib/haxe/std/cpp/_std/Reflect.hx">
<hasField public="1" set="method" line="24" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<x path="Bool"/>
</f>
<haxe_doc>Tells if structure [o] has a field named [field].
This is only guaranteed to work for anonymous structures. Refer to
[Type.getInstanceFields()] for a function supporting class instances.
If [o] or [field] are null, the result is unspecified.</haxe_doc>
</hasField>
<field public="1" set="method" line="28" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<d/>
</f>
<haxe_doc>Returns the value of the field named [field] on object [o].
If [o] is not an object or has no field named [field], the result is
null.
If the field is defined as a property, its accessors are ignored. Refer
to [Reflect.getProperty()] for a function supporting property accessors.
If [field] is null, the result is unspecified.</haxe_doc>
</field>
<callMethod public="1" set="method" line="46" 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="53" static="1">
<f a="o">
<d/>
<c path="Array"><c path="String"/></c>
</f>
<haxe_doc>Returns the fields of structure [o].
This method is only guaranteed to work on anonymous structures. Refer to
[Type.getInstanceFields()] for a function supporting class instances.
If [o] is null, the result is unspecified.</haxe_doc>
</fields>
<isFunction public="1" set="method" line="60" static="1">
<f a="f">
<d/>
<x path="Bool"/>
</f>
<haxe_doc>Returns true if [f] is a function, false otherwise.
If [f] is null, the result is false.</haxe_doc>
</isFunction>
<compareMethods public="1" set="method" line="68" static="1">
<f a="f1:f2">
<d/>
<d/>
<x 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="76" static="1">
<f a="v">
<d/>
<x path="Bool"/>
</f>
<haxe_doc>Tells if a value is an object or not.</haxe_doc>
</isObject>
<deleteField public="1" set="method" line="83" static="1">
<f a="o:field">
<d/>
<c path="String"/>
<x path="Bool"/>
</f>
<haxe_doc>Removes the field named [field] from structure [o].
This method is only guaranteed to work on anonymous structures.
If [o] or [field] are null, the result is unspecified.</haxe_doc>
</deleteField>
<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=":keep"/>
<m n=":coreApi"/>
</meta>
</class>
<class path="Std" params="" file="/usr/lib/haxe/std/cpp/_std/Std.hx">
<is public="1" set="method" line="23" static="1">
<f a="v:t">
<d/>
<d/>
<x path="Bool"/>
</f>
<haxe_doc>Tells if a value v is of the type t. Returns false if v or t are null.</haxe_doc>
</is>
<string public="1" set="method" line="27" static="1">
<f a="s">
<d/>
<c path="String"/>
</f>
<haxe_doc>Converts any value to a String.
If s is of String, Int, Float or Bool, its value is returned.
If s is an instance of a class and that class or one of its parent classes has
a toString() method, that method is called. If no such method is present, the result
is unspecified.
If s is an enum constructor without argument, the constructor's name is returned. If
arguments exists, the constructor's name followed by the String representations of
the arguments is returned.
If s is a structure, the field names along with their values are returned. The field order
and the operator separating field names and values are unspecified.
If s is null, "null" is returned.</haxe_doc>
</string>
<int public="1" set="method" line="31" static="1">
<f a="x">
<x path="Float"/>
<x path="Int"/>
</f>
<haxe_doc>Converts a Float to an Int, rounded towards 0.
If x is outside of the signed Int32 range, or is NaN, NEGATIVE_INFINITY or POSITIVE_INFINITY, the result is unspecified.</haxe_doc>
</int>
<parseInt public="1" set="method" line="35" static="1">
<f a="x">
<c path="String"/>
<t path="Null"><x path="Int"/></t>
</f>
<haxe_doc>Converts a String to an Int.
Leading whitespaces are ignored.
If x starts with 0x or 0X, hexadecimal notation is recognized where the following digits may
contain 0-9 and A-F.
Otherwise x is read as decimal number with 0-9 being allowed characters. x may also start with
a - to denote a negative value.
In decimal mode, parsing continues until an invalid character is detected, in which case the
result up to that point is returned. For hexadecimal notation, the effect of invalid characters
is unspecified.
Leading 0s that are not part of the 0x/0X hexadecimal notation are ignored, which means octal
notation is not supported.
If the input cannot be recognized, the result is null.</haxe_doc>
</parseInt>
<parseFloat public="1" set="method" line="39" static="1">
<f a="x">
<c path="String"/>
<x path="Float"/>
</f>
<haxe_doc>Converts a String to a Float.
The parsing rules for parseInt() apply here as well, with the exception of invalid input
resulting in a NaN value instead of null.
Additionally, decimal notation may contain a single . to denote the start of the fractions.</haxe_doc>
</parseFloat>
<haxe_doc>The Std class provides standard methods for manipulating basic types.</haxe_doc>
<meta>
<m n=":keep"/>
<m n=":coreApi"/>
</meta>
</class>
<abstract 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>
<meta><m n=":coreType"/></meta>
</abstract>
<abstract path="Float" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<haxe_doc>The standard Float type, this is a double-precision IEEE 64bit float.</haxe_doc>
<meta>
<m n=":valueUsed"/>
<m n=":coreType"/>
<m n=":notNull"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<abstract path="Int" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<to><x path="Float"/></to>
<haxe_doc>The standard Int type. Its precision depends on the platform.</haxe_doc>
<meta>
<m n=":valueUsed"/>
<m n=":coreType"/>
<m n=":notNull"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<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>
<abstract path="Bool" params="" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<haxe_doc>The standard Boolean type is represented as an enum with two choices.</haxe_doc>
<meta>
<m n=":coreType"/>
<m n=":notNull"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<abstract path="Dynamic" params="T" file="/usr/lib/haxe/std/StdTypes.hx" module="StdTypes">
<haxe_doc>Dynamic is an internal compiler type which has special behavior.
See the haXe language reference for more informations.</haxe_doc>
<meta>
<m n=":valueUsed"/>
<m n=":coreType"/>
<m n=":runtimeValue"/>
</meta>
</abstract>
<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>
<haxe_doc>Returns the current item of the Iterator and advances to the next one.
This method is not required to check hasNext() first. A call to this
method while hasNext() is false yields unspecified behavior.</haxe_doc>
</next>
<hasNext set="method">
<f a=""><x path="Bool"/></f>
<haxe_doc>Returns false if the iteration is complete, true otherwise.
Usually iteration is considered to be complete if all elements of the
underlying data structure were handled through calls to next(). However,
in custom iterators any logic may be used to determine the completion
state.</haxe_doc>
</hasNext>
</a>
<haxe_doc>An Iterator is a structure that permits iteration over elements of type T.
Any class with matching hasNext and next fields is considered an Iterator
and can then be used e.g. in for-loops. This makes it easy to implement
custom iterators.</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">
<x path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Returns the String corresponding to the character code [code].
If [code] is negative or has another invalid value, the result is
unspecified.</haxe_doc>
</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">
<x path="Int"/>
<x path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Returns the part of [this] String from [startIndex] to [endIndex].
If [startIndex] or [endIndex] are negative, 0 is used instead.
If [startIndex] exceeds [endIndex], they are swapped.
If the (possibly swapped) [endIndex] is omitted or exceeds
[this].length, [this].length is used instead.
If the (possibly swapped) [startIndex] exceeds [this].length, the empty
String "" is returned.</haxe_doc>
</substring>
<substr public="1" set="method">
<f a="pos:?len">
<x path="Int"/>
<x path="Int"/>
<c path="String"/>
</f>
<haxe_doc>Returns [len] characters of [this] String, starting at position [pos].
If [len] is omitted, all characters from position [pos] to the end of
[this] String are included.
If [pos] is negative, its value is calculated from the end of [this]
String by [this].length + [pos]. If this yields a negative value, 0 is
used instead.
If the calculated position + [len] exceeds [this].length, the characters
from that position to the end of [this] String are returned.
If [len] is negative, the result is unspecified.</haxe_doc>
</substr>
<split public="1" set="method">
<f a="delimiter">
<c path="String"/>
<c path="Array"><c path="String"/></c>
</f>
<haxe_doc>Splits [this] String at each occurence of [delimiter].
If [delimiter] is the empty String "", [this] String is split into an
Array of [this].length elements, where the elements correspond to the
characters of [this] String.
If [delimiter] is not found within [this] String, the result is an Array
with one element, which equals [this] String.
If [delimiter] is null, the result is unspecified.
Otherwise, [this] String is split into parts at each occurence of
[delimiter]. If [this] String starts (or ends) with [delimiter}, the
result Array contains a leading (or trailing) empty String "" element.
Two subsequent delimiters also result in an empty String "" element.</haxe_doc>
</split>
<lastIndexOf public="1" set="method">