Comments (3)
Okey now i get it why it is not work i have to define :
_Bool cmp(node_s n1, node_s n2) {
return (n1.w == n2.w && n1.h == n2.h);
}
ARRAY_DEF(arr_node, node_s, (CMP(cmp)))
to know how to compare two custom data. thx anyway :)
from mlib.
By default, ARRAY_DEF expects to work on integer/float types, whereas a struct is used. Some operations are not possible on structures in C. So, the solution is to give the oplist responsible to handle POD struct to ARRAY_DEF:
ARRAY_DEF(arr_node, node_s, M_POD_OPLIST)
This will use the C function memcmp to compare your structure.
Alternatively, you can also register globally the oplist of your node by defining the macro M_OPL_node_s:
#define M_OPL_node_s() M_POD_OPLIST
ARRAY_DEF(arr_node, node_s)
This generates the same code.
_Bool cmp(node_s n1, node_s n2) {
return (n1.w == n2.w && n1.h == n2.h);
}
ARRAY_DEF(arr_node, node_s, (CMP(cmp)))
There is an issue with this solution: the provided function is a matching method for the EQUAL operator, not for the CMP operator. The CMP operator expects a total order of the elements, like this:
int cmp(node_s n1, node_s n2) {
return (n1.w < n2.w ? -1 : n1.w > n2.w ? 1 : n1.h < n2.h ? -1 : n1.h > n2.h);
}
ARRAY_DEF(arr_node, node_s, (CMP(cmp)))
from mlib.
hmmm very nice explanation,i see right now, thank you very much! :)
from mlib.
Related Issues (20)
- README example not work HOT 3
- Add EMPLACE_TYPE support for B+TREE, DICT, RB-TREE, BUFFER, CONCURRENT HOT 3
- bitset: function for getting minimum index with bit set HOT 3
- Memory leak HOT 5
- Proper way to share generated container accross multiple .c files HOT 15
- Overflow issue in bit set HOT 1
- Naming Critique HOT 20
- _previous in m-rbtree.h is actually next HOT 2
- Possible issue in m-core.h HOT 2
- Possible assertion error HOT 6
- Wrong implementation for set_cstr for bounded strings HOT 16
- M_EMPTY_P(max) doesn't work HOT 4
- BPTREEI_OPLIST2_P4 missing push definition?
- Is it actually possible to create a fixed-size looping buffer? HOT 10
- BUFFER_DEF / BUFFER_THREAD_UNSAFE: performance issue HOT 1
- RB-tree _it_from on root node HOT 1
- Memory issue with _pop_at function while using 2d arrays HOT 1
- string_t: extremely confusing methods names: string_clean and string_clear HOT 5
- Change _str suffix HOT 2
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from mlib.