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
|
/*
* Copyright (C)2005-2015 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 python;
import python.internal.UBuiltins;
import python.Tuple;
import python.NativeIterator;
import python.Syntax;
@:native("dict")
extern class Dict<K,V> {
function new ():Void;
var length(get,never):Int;
private inline function get_length():Int {
return UBuiltins.len(this);
}
function get(key:K, ?def:V):V;
inline function getSafe(key:K):V {
return Syntax.arrayAccess(this, key);
}
inline function set(key:K, val:V):Void {
Syntax.arraySet(this, key, val);
}
inline function remove(key:K):Void {
Syntax.delete(python.Syntax.arrayAccess(this, key));
}
inline function hasKey(k:K):Bool {
return Syntax.isIn(k, this);
}
function clear():Void;
function copy():Dict<K,V>;
function items():DictView<Tuple2<K,V>>;
function keys():DictView<K>;
function pop(key:K, ?def:V):V;
function popitem():Tuple2<K,V>;
function setdefault(key:K, ?def:V):V;
function update(d:Dict<K,V>):Void;
function values():DictView<V>;
inline function iter():NativeIterator<K> {
return UBuiltins.iter(this);
}
inline function iterator():Iterator<V> {
return values().iter();
}
private function __iter__():NativeIterator<K>;
}
extern class DictView<T> {
var length(get,never):Int;
private inline function get_length():Int {
return UBuiltins.len(this);
}
inline function iter():NativeIterator<T> {
return UBuiltins.iter(this);
}
inline function iterator():Iterator<T> {
return iter();
}
private function __iter__():NativeIterator<T>;
}
|