1 /* This C header file is generated by NIT to compile modules and programs that requires list. */
4 #include "abstract_collection._sep.h"
5 #include <nit_common.h>
7 extern const classtable_elt_t VFT_List
[];
9 extern const classtable_elt_t VFT_ListIterator
[];
11 extern const classtable_elt_t VFT_ListNode
[];
12 extern const char *LOCATE_list
;
13 extern const int SFT_list
[];
14 #define ID_List (SFT_list[0])
15 #define COLOR_List (SFT_list[1])
16 #define ATTR_list___List____head(recv) ATTR(recv, (SFT_list[2] + 0))
17 #define ATTR_list___List____tail(recv) ATTR(recv, (SFT_list[2] + 1))
18 #define INIT_TABLE_POS_List (SFT_list[3] + 0)
19 #define CALL_list___List___link(recv) ((list___List___link_t)CALL((recv), (SFT_list[3] + 1)))
20 #define CALL_list___List___init(recv) ((list___List___init_t)CALL((recv), (SFT_list[3] + 2)))
21 #define CALL_list___List___from(recv) ((list___List___from_t)CALL((recv), (SFT_list[3] + 3)))
22 #define CALL_list___List___get_node(recv) ((list___List___get_node_t)CALL((recv), (SFT_list[3] + 4)))
23 #define CALL_list___List___search_node_after(recv) ((list___List___search_node_after_t)CALL((recv), (SFT_list[3] + 5)))
24 #define CALL_list___List___remove_node(recv) ((list___List___remove_node_t)CALL((recv), (SFT_list[3] + 6)))
25 #define CALL_list___List___insert_before(recv) ((list___List___insert_before_t)CALL((recv), (SFT_list[3] + 7)))
26 #define ID_ListIterator (SFT_list[4])
27 #define COLOR_ListIterator (SFT_list[5])
28 #define ATTR_list___ListIterator____node(recv) ATTR(recv, (SFT_list[6] + 0))
29 #define ATTR_list___ListIterator____index(recv) ATTR(recv, (SFT_list[6] + 1))
30 #define INIT_TABLE_POS_ListIterator (SFT_list[7] + 0)
31 #define CALL_list___ListIterator___init(recv) ((list___ListIterator___init_t)CALL((recv), (SFT_list[7] + 1)))
32 #define ID_ListNode (SFT_list[8])
33 #define COLOR_ListNode (SFT_list[9])
34 #define ATTR_list___ListNode____next(recv) ATTR(recv, (SFT_list[10] + 0))
35 #define ATTR_list___ListNode____prev(recv) ATTR(recv, (SFT_list[10] + 1))
36 #define INIT_TABLE_POS_ListNode (SFT_list[11] + 0)
37 #define CALL_list___ListNode___init(recv) ((list___ListNode___init_t)CALL((recv), (SFT_list[11] + 1)))
38 #define CALL_list___ListNode___next(recv) ((list___ListNode___next_t)CALL((recv), (SFT_list[11] + 2)))
39 #define CALL_list___ListNode___next__eq(recv) ((list___ListNode___next__eq_t)CALL((recv), (SFT_list[11] + 3)))
40 #define CALL_list___ListNode___prev(recv) ((list___ListNode___prev_t)CALL((recv), (SFT_list[11] + 4)))
41 #define CALL_list___ListNode___prev__eq(recv) ((list___ListNode___prev__eq_t)CALL((recv), (SFT_list[11] + 5)))
42 typedef val_t (* list___List___iterator_t
)(val_t self
);
43 val_t
list___List___iterator(val_t self
);
44 #define LOCATE_list___List___iterator "list::List::(abstract_collection::Collection::iterator)"
45 typedef val_t (* list___List___is_empty_t
)(val_t self
);
46 val_t
list___List___is_empty(val_t self
);
47 #define LOCATE_list___List___is_empty "list::List::(abstract_collection::Collection::is_empty)"
48 typedef val_t (* list___List___length_t
)(val_t self
);
49 val_t
list___List___length(val_t self
);
50 #define LOCATE_list___List___length "list::List::(abstract_collection::Collection::length)"
51 typedef val_t (* list___List___has_t
)(val_t self
, val_t param0
);
52 val_t
list___List___has(val_t self
, val_t param0
);
53 #define LOCATE_list___List___has "list::List::(abstract_collection::Collection::has)"
54 typedef val_t (* list___List___has_only_t
)(val_t self
, val_t param0
);
55 val_t
list___List___has_only(val_t self
, val_t param0
);
56 #define LOCATE_list___List___has_only "list::List::(abstract_collection::Collection::has_only)"
57 typedef val_t (* list___List___count_t
)(val_t self
, val_t param0
);
58 val_t
list___List___count(val_t self
, val_t param0
);
59 #define LOCATE_list___List___count "list::List::(abstract_collection::Collection::count)"
60 typedef val_t (* list___List___first_t
)(val_t self
);
61 val_t
list___List___first(val_t self
);
62 #define LOCATE_list___List___first "list::List::(abstract_collection::Collection::first)"
63 typedef val_t (* list___List_____bra_t
)(val_t self
, val_t param0
);
64 val_t
list___List_____bra(val_t self
, val_t param0
);
65 #define LOCATE_list___List_____bra "list::List::(abstract_collection::MapRead::[])"
66 typedef val_t (* list___List___has_key_t
)(val_t self
, val_t param0
);
67 val_t
list___List___has_key(val_t self
, val_t param0
);
68 #define LOCATE_list___List___has_key "list::List::(abstract_collection::MapRead::has_key)"
69 typedef val_t (* list___List___last_t
)(val_t self
);
70 val_t
list___List___last(val_t self
);
71 #define LOCATE_list___List___last "list::List::(abstract_collection::IndexedCollectionRead::last)"
72 typedef void (* list___List___clear_t
)(val_t self
);
73 void list___List___clear(val_t self
);
74 #define LOCATE_list___List___clear "list::List::(abstract_collection::RemovableCollection::clear)"
75 typedef void (* list___List___remove_t
)(val_t self
, val_t param0
);
76 void list___List___remove(val_t self
, val_t param0
);
77 #define LOCATE_list___List___remove "list::List::(abstract_collection::RemovableCollection::remove)"
78 typedef void (* list___List_____braeq_t
)(val_t self
, val_t param0
, val_t param1
);
79 void list___List_____braeq(val_t self
, val_t param0
, val_t param1
);
80 #define LOCATE_list___List_____braeq "list::List::(abstract_collection::Map::[]=)"
81 typedef void (* list___List___remove_at_t
)(val_t self
, val_t param0
);
82 void list___List___remove_at(val_t self
, val_t param0
);
83 #define LOCATE_list___List___remove_at "list::List::(abstract_collection::Map::remove_at)"
84 typedef void (* list___List___first__eq_t
)(val_t self
, val_t param0
);
85 void list___List___first__eq(val_t self
, val_t param0
);
86 #define LOCATE_list___List___first__eq "list::List::(abstract_collection::IndexedCollection::first=)"
87 typedef void (* list___List___last__eq_t
)(val_t self
, val_t param0
);
88 void list___List___last__eq(val_t self
, val_t param0
);
89 #define LOCATE_list___List___last__eq "list::List::(abstract_collection::IndexedCollection::last=)"
90 typedef void (* list___List___push_t
)(val_t self
, val_t param0
);
91 void list___List___push(val_t self
, val_t param0
);
92 #define LOCATE_list___List___push "list::List::(abstract_collection::IndexedCollection::push)"
93 typedef val_t (* list___List___pop_t
)(val_t self
);
94 val_t
list___List___pop(val_t self
);
95 #define LOCATE_list___List___pop "list::List::(abstract_collection::IndexedCollection::pop)"
96 typedef void (* list___List___unshift_t
)(val_t self
, val_t param0
);
97 void list___List___unshift(val_t self
, val_t param0
);
98 #define LOCATE_list___List___unshift "list::List::(abstract_collection::IndexedCollection::unshift)"
99 typedef val_t (* list___List___shift_t
)(val_t self
);
100 val_t
list___List___shift(val_t self
);
101 #define LOCATE_list___List___shift "list::List::(abstract_collection::IndexedCollection::shift)"
102 typedef void (* list___List___link_t
)(val_t self
, val_t param0
);
103 void list___List___link(val_t self
, val_t param0
);
104 #define LOCATE_list___List___link "list::List::link"
105 typedef void (* list___List___init_t
)(val_t self
, int* init_table
);
106 void list___List___init(val_t self
, int* init_table
);
107 #define LOCATE_list___List___init "list::List::init"
108 val_t
NEW_List_list___List___init();
109 typedef void (* list___List___from_t
)(val_t self
, val_t param0
, int* init_table
);
110 void list___List___from(val_t self
, val_t param0
, int* init_table
);
111 #define LOCATE_list___List___from "list::List::from"
112 val_t
NEW_List_list___List___from(val_t p0
);
113 typedef val_t (* list___List___get_node_t
)(val_t self
, val_t param0
);
114 val_t
list___List___get_node(val_t self
, val_t param0
);
115 #define LOCATE_list___List___get_node "list::List::get_node"
116 typedef val_t (* list___List___search_node_after_t
)(val_t self
, val_t param0
, val_t param1
);
117 val_t
list___List___search_node_after(val_t self
, val_t param0
, val_t param1
);
118 #define LOCATE_list___List___search_node_after "list::List::search_node_after"
119 typedef void (* list___List___remove_node_t
)(val_t self
, val_t param0
);
120 void list___List___remove_node(val_t self
, val_t param0
);
121 #define LOCATE_list___List___remove_node "list::List::remove_node"
122 typedef void (* list___List___insert_before_t
)(val_t self
, val_t param0
, val_t param1
);
123 void list___List___insert_before(val_t self
, val_t param0
, val_t param1
);
124 #define LOCATE_list___List___insert_before "list::List::insert_before"
125 typedef val_t (* list___ListIterator___item_t
)(val_t self
);
126 val_t
list___ListIterator___item(val_t self
);
127 #define LOCATE_list___ListIterator___item "list::ListIterator::(abstract_collection::Iterator::item)"
128 typedef void (* list___ListIterator___next_t
)(val_t self
);
129 void list___ListIterator___next(val_t self
);
130 #define LOCATE_list___ListIterator___next "list::ListIterator::(abstract_collection::Iterator::next)"
131 typedef val_t (* list___ListIterator___is_ok_t
)(val_t self
);
132 val_t
list___ListIterator___is_ok(val_t self
);
133 #define LOCATE_list___ListIterator___is_ok "list::ListIterator::(abstract_collection::Iterator::is_ok)"
134 typedef val_t (* list___ListIterator___index_t
)(val_t self
);
135 val_t
list___ListIterator___index(val_t self
);
136 #define LOCATE_list___ListIterator___index "list::ListIterator::(abstract_collection::IndexedIterator::index)"
137 typedef void (* list___ListIterator___init_t
)(val_t self
, val_t param0
, int* init_table
);
138 void list___ListIterator___init(val_t self
, val_t param0
, int* init_table
);
139 #define LOCATE_list___ListIterator___init "list::ListIterator::init"
140 val_t
NEW_ListIterator_list___ListIterator___init(val_t p0
);
141 typedef void (* list___ListNode___init_t
)(val_t self
, val_t param0
, int* init_table
);
142 void list___ListNode___init(val_t self
, val_t param0
, int* init_table
);
143 #define LOCATE_list___ListNode___init "list::ListNode::init"
144 val_t
NEW_ListNode_list___ListNode___init(val_t p0
);
145 typedef val_t (* list___ListNode___next_t
)(val_t self
);
146 val_t
list___ListNode___next(val_t self
);
147 #define LOCATE_list___ListNode___next "list::ListNode::next"
148 typedef void (* list___ListNode___next__eq_t
)(val_t self
, val_t param0
);
149 void list___ListNode___next__eq(val_t self
, val_t param0
);
150 #define LOCATE_list___ListNode___next__eq "list::ListNode::next="
151 typedef val_t (* list___ListNode___prev_t
)(val_t self
);
152 val_t
list___ListNode___prev(val_t self
);
153 #define LOCATE_list___ListNode___prev "list::ListNode::prev"
154 typedef void (* list___ListNode___prev__eq_t
)(val_t self
, val_t param0
);
155 void list___ListNode___prev__eq(val_t self
, val_t param0
);
156 #define LOCATE_list___ListNode___prev__eq "list::ListNode::prev="
nitlanguage / nit.git / blob