Lock-free data structures and algorithms.
无锁(lock - free)数据结构和算法。
In this article, you use the GCC built-ins in your implementation of lock-free data structures. Here's a look at the built-ins.
在本文中，我们要在无锁数据结构的实现中使用GCC内置函数。
Because the basic data structures in the allocator permit coalescing at any time, in any of malloc, free, or realloc, corresponding caching heuristics are easy to apply.
因为分配器中的基本数据结构允许在malloc,free或realloc的任何一个中任意时刻进行合并，相应的高速缓冲探索都很容易应用。
Data structures are reusable because they tend to be modular and context-free.
因为数据结构趋向于模块化并和环境无关，所以数据结构是可以复用的。
Is the code free of data structures whose elements are accessed both globally as well as through access routines?
程序是不是与既可以通过全局公用的数据也可以通过专用的存取数据的程序读取数据的数据类型无关？
Is the code free of data structures whose elements are accessed both globally as well as through access routines?
程序是不是与既可以通过全局公用的数据也可以通过专用的存取数据的程序读取数据的数据类型无关？
应用推荐