File: VirtualArray.hx

package info (click to toggle)
haxe 1%3A4.3.7-1.1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 44,524 kB
  • sloc: ml: 137,268; ansic: 2,491; makefile: 456; java: 386; cs: 336; cpp: 318; python: 318; sh: 75; objc: 64; php: 50; xml: 31; javascript: 11
file content (136 lines) | stat: -rw-r--r-- 4,620 bytes parent folder | download | duplicates (4)
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
/*
 * Copyright (C)2005-2019 Haxe Foundation
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

package cpp;

@:native("cpp::VirtualArray")
@:coreType extern class NativeVirtualArray implements ArrayAccess<Dynamic> {
	function new():Void;
	var length(get, null):Int;
	// concat<T>( a:Array<T> ) : Array<T> ?
	function concat(a:VirtualArray):VirtualArray;
	function join(sep:String):String;
	function pop():Dynamic;
	function push(x:Dynamic):Int;
	function reverse():Void;
	function shift():Dynamic;
	function slice(pos:Int, ?end:Int):VirtualArray;
	function sort(f:Dynamic->Dynamic->Int):Void;
	function splice(pos:Int, len:Int):VirtualArray;
	function toString():String;
	function unshift(x:Dynamic):Void;
	function insert(pos:Int, x:Dynamic):Void;
	function remove(x:Dynamic):Bool;
	function indexOf(x:Dynamic, ?fromIndex:Int):Int;
	function lastIndexOf(x:Dynamic, ?fromIndex:Int):Int;
	function copy():VirtualArray;
	function iterator():Iterator<Dynamic>;
	function keyValueIterator():KeyValueIterator<Int, Dynamic>;
	function map<S>(f:Dynamic->S):VirtualArray;
	function filter(f:Dynamic->Bool):VirtualArray;
	function resize(len:Int):Void;
}

abstract VirtualArray(NativeVirtualArray) {
	// Add these two functions...
	@:from extern inline static public function fromArray<T>(a:Array<T>):VirtualArray
		return untyped a;

	@:to extern inline public function toArray<T>():Array<T>
		return untyped this;

	// The rest is just boiler-plate
	inline public function new()
		this = new NativeVirtualArray();

	@:arrayAccess extern inline function get(idx:Int):Dynamic
		return untyped this[idx];

	@:arrayAccess extern inline function set<T>(pos:Int, value:T):T
		return untyped this[idx] = value;

	public var length(get, never):Int;

	extern inline public function get_length():Int
		return this.length;

	// concat<T>( a:Array<T> ) : Array<T> ?
	extern inline public function concat(a:VirtualArray):VirtualArray
		return this.concat(a);

	extern inline public function join(sep:String):String
		return this.join(sep);

	extern inline public function pop():Dynamic
		return this.pop();

	extern inline public function push(x:Dynamic):Int
		return this.push(x);

	extern inline public function reverse():Void
		this.reverse();

	extern inline public function shift():Dynamic
		return this.shift();

	extern inline public function slice(pos:Int, ?end:Int):VirtualArray
		return this.slice(pos, end);

	extern inline public function sort(f:Dynamic->Dynamic->Int):Void
		this.sort(f);

	extern inline public function splice(pos:Int, len:Int):VirtualArray
		return this.slice(pos, len);

	extern inline public function unshift(x:Dynamic):Void
		this.unshift(x);

	extern inline public function insert(pos:Int, x:Dynamic):Void
		this.insert(pos, x);

	extern inline public function remove(x:Dynamic):Bool
		return this.remove(x);

	extern inline public function indexOf(x:Dynamic, ?fromIndex:Int):Int
		return this.indexOf(x, fromIndex);

	extern inline public function lastIndexOf(x:Dynamic, ?fromIndex:Int):Int
		return this.lastIndexOf(x, fromIndex);

	extern inline public function copy():VirtualArray
		return this.copy();

	extern inline public function iterator():Iterator<Dynamic>
		return this.iterator();

	extern inline public function keyValueIterator():KeyValueIterator<Int, Dynamic>
		return this.keyValueIterator();

	extern inline public function map<S>(f:Dynamic->S):VirtualArray
		return this.map(f);

	extern inline public function filter(f:Dynamic->Bool):VirtualArray
		return this.filter(f);

	extern inline public function resize(len:Int):Void
		return this.resize(len);
}