Lines Matching +full:python +full:- +full:version

1 version: 0.25
4 - support (type safe) user object on id in bindings
5 - more exports to (templated C++) bindings
6 - add some convenience functions
7 ---
8 version: 0.24
11 - improved (C++) bindings (inherit methods, renamed exports)
12 - initial templated C++ bindings
13 - detect bounds on constant polynomials as tight
14 ---
15 version: 0.23
18 - minor improvements to coalescing
19 - use build compiler to build extract_interface
20 - add some convenience functions
21 - ignore parameters in isl_union_* hash tables
22 ---
23 version: 0.22.1
26 - fix error handling
27 ---
28 version: 0.22
31 - require C++11 to generate bindings
32 - improved bindings
33 - scheduler fix involving fixed dimensions
34 - accept ranges in tuples during parsing
35 - add some convenience functions
36 ---
37 version: 0.21
40 - preliminary C++ bindings
41 - use incremental scheduler by default
42 - introduce isl_size type
43 - rename isl_ast_op_type to isl_ast_expr_op_type
44 - fix coalescing bugs
45 - use isl_bool to return extra boolean argument
46 ---
47 version: 0.20
50 - keep track of domain in 0D isl_multi_pw_aff and isl_multi_union_pw_aff
51 - add isl_aff_eval and isl_pw_aff_eval
52 - add fixed-size rectangular box hull
53 ---
54 version: 0.19
57 - minor improvements to coalescing
58 - minor improvement to parametric integer programming
59 - try harder to avoid large coefficients in scheduler
60 - support kill accesses in dependence analysis
61 - drop deprecated isl_int
62 - drop deprecated band forests
63 - drop deprecated functions
64 ---
65 version: 0.18
68 - improve elimination of redundant existentially quantified variables
69 - improve coalescing
70 - improve parametric integer programming
71 - preserve isolate option in isl_schedule_node_band_split
72 - print AST nodes in YAML format
73 - minor improvements to Python bindings
74 ---
75 version: 0.17.1
78 - fix bug in coalescing treatment
79 ---
80 version: 0.17
83 - optionally combine SCCs incrementally in scheduler
84 - optionally maximize coincidence in scheduler
85 - optionally avoid loop coalescing in scheduler
86 - fix handling of nested integer divisions
87 - optionally detect min/max expressions during AST generation
88 - minor AST generator improvements
89 - simplify stride constraints
90 - improve support for expansions in schedule trees
91 ---
92 version: 0.16.1
95 - fix bug in simplification
96 ---
97 version: 0.16
100 - add 32 bit integer optimization for IMath
101 - minor AST generator improvements
102 - add isl_union_flow_get_full_{may,must}_dependence
103 - minor improvements to Python bindings
104 - minor improvements to set and map printing
105 ---
106 version: 0.15
109 - improve coalescing
110 - add isl_union_access_info_compute_flow
111 - add mark nodes in AST
112 - add isl_union_pw_aff and isl_multi_union_pw_aff
113 - add schedule trees
114 - deprecate band forests
115 - deprecate separation_class AST generation option
116 - introduce isl_bool and isl_stat types
117 ---
118 version: 0.14.1
121 - fix bug in affine expression normalization
122 - fix handling of conditional validity constraints
123 ---
124 version: 0.14
127 - support IMath as an optional replacement for GMP
128 - minor AST generator improvements
129 ---
130 version: 0.13
133 - deprecate isl_int
134 - improved support for multi piecewise quasi-affine expressions
135 - allow the user to impose a bound on the number of low-level operations
136 - add isl_id_to_ast_expr and isl_id_to_pw_aff
137 - add isl_schedule_constraints
138 - hide internal structure of isl_vec
139 - remove support for piplib
140 ---
141 version: 0.12.2
144 - MinGW-w64 build fix
145 - fix simplification bug
146 ---
147 version: 0.12.1
150 - handle malloc returning NULL on zero-size allocation
151 - fix regression in AST generator
152 ---
153 version: 0.12
156 - add isl_val abstraction
157 ---
158 version: 0.11.2
161 - make code generation output the same on Solaris
162 - fix some hard to trigger bugs
163 ---
164 version: 0.11.1
167 - add LICENSE file to distribution
168 - make code generation output independent of endianness
169 ---
170 version: 0.11
173 - change license from LGPL 2.1 to MIT
174 - add support for multi piecewise quasi-affine expressions
175 - add code generation
176 - various minor bug fixes
177 ---
178 version: 0.10
181 - support for interaction with dependence analysis
182 - add public API for vectors
183 - improved support for (piecewise) multi quasi-affine expressions
184 - various minor bug fixes
185 ---
186 version: 0.09
189 - improved argument parsing
190 - hide internal structure of isl_options
191 - improved support for parameter sets
192 - configurable scheduling
193 ---
194 version: 0.08
197 - improved parsing
198 - drop isl_div abstraction
199 - rename isl_dim to isl_space
200 - |-
203 - add support for identifiers
204 - add support for (piecewise) multi quasi-affine expressions
205 - preliminary Python bindings
206 ---
207 version: 0.07
210 - hide internal structures of isl_div and isl_constraint
211 - preliminary scheduling
212 - add support for local spaces and (piecewise) quasi-affine expressions
213 ---
214 version: 0.06
217 - improved parsing
218 - consistency changes in API
219 - hide internal structure of isl_ctx
220 ---
221 version: 0.05.1
224 - fix simple symmetry detection in parametric integer programming
225 ---
226 version: 0.05
229 - rename header files from isl_header.h to isl/header.h
230 - add higher level interface for dependence analysis
231 - improved argument parsing
232 - optionally triangulate domains during Bernstein expansion
233 - support extended PolyLib format
234 - hide internal structure of some data types
235 - improved coalescing
236 - add simple symmetry detection in parametric integer programming
237 ---
238 version: 0.04
241 - rename isl_pw_qpolynomial_fold_add
242 - add isl_map_apply_pw_qpolynomial_fold
243 - support named and nested spaces
244 - support union sets and maps
245 - add public API for matrices
246 ---
247 version: 0.03
250 - new printing functions
251 - support for "may" accesses in dependence analysis
252 - improved coalescing
253 - improved transitive closure
254 - fix several hard to trigger bugs
255 - improved argument parsing
256 - support parametric vertex enumeration for barvinok
257 - optionally use Bernstein expansion to compute bounds