git » swiftpm » main » tree

[main] / Sources / c_snikket / iinclude / haxe / ds / BalancedTree.h 

 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
// Generated by Haxe 4.3.3
#ifndef INCLUDED_haxe_ds_BalancedTree
#define INCLUDED_haxe_ds_BalancedTree

#ifndef HXCPP_H
#include <hxcpp.h>
#endif

#ifndef INCLUDED_haxe_IMap
#include <haxe/IMap.h>
#endif
HX_DECLARE_CLASS1(haxe,IMap)
HX_DECLARE_CLASS2(haxe,ds,BalancedTree)
HX_DECLARE_CLASS2(haxe,ds,TreeNode)

namespace haxe{
namespace ds{


class HXCPP_CLASS_ATTRIBUTES BalancedTree_obj : public ::hx::Object
{
	public:
		typedef ::hx::Object super;
		typedef BalancedTree_obj OBJ_;
		BalancedTree_obj();

	public:
		enum { _hx_ClassId = 0x4cc9cf7f };

		void __construct();
		inline void *operator new(size_t inSize, bool inContainer=true,const char *inName="haxe.ds.BalancedTree")
			{ return ::hx::Object::operator new(inSize,inContainer,inName); }
		inline void *operator new(size_t inSize, int extra)
			{ return ::hx::Object::operator new(inSize+extra,true,"haxe.ds.BalancedTree"); }
		static ::hx::ObjectPtr< BalancedTree_obj > __new();
		static ::hx::ObjectPtr< BalancedTree_obj > __alloc(::hx::Ctx *_hx_ctx);
		static void * _hx_vtable;
		static Dynamic __CreateEmpty();
		static Dynamic __Create(::hx::DynamicArray inArgs);
		//~BalancedTree_obj();

		HX_DO_RTTI_ALL;
		::hx::Val __Field(const ::String &inString, ::hx::PropertyAccess inCallProp);
		::hx::Val __SetField(const ::String &inString,const ::hx::Val &inValue, ::hx::PropertyAccess inCallProp);
		void __GetFields(Array< ::String> &outFields);
		static void __register();
		void __Mark(HX_MARK_PARAMS);
		void __Visit(HX_VISIT_PARAMS);
		bool _hx_isInstanceOf(int inClassId);
		void *_hx_getInterface(int inHash);
		::String __ToString() const { return HX_("BalancedTree",66,71,f8,aa); }

		 ::haxe::ds::TreeNode root;
		void set( ::Dynamic key, ::Dynamic value);
		::Dynamic set_dyn();

		 ::Dynamic get( ::Dynamic key);
		::Dynamic get_dyn();

		bool exists( ::Dynamic key);
		::Dynamic exists_dyn();

		 ::Dynamic keys();
		::Dynamic keys_dyn();

		 ::haxe::ds::TreeNode setLoop( ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode node);
		::Dynamic setLoop_dyn();

		void keysLoop( ::haxe::ds::TreeNode node,::cpp::VirtualArray acc);
		::Dynamic keysLoop_dyn();

		 ::haxe::ds::TreeNode balance( ::haxe::ds::TreeNode l, ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode r);
		::Dynamic balance_dyn();

		virtual int compare( ::Dynamic k1, ::Dynamic k2);
		::Dynamic compare_dyn();

};

} // end namespace haxe
} // end namespace ds

#endif /* INCLUDED_haxe_ds_BalancedTree */