它以类为基础,并根据类的层次结构和继承关系用链表来构造规则库。
On the basis of class and in accordance with the level structure and the inheritance relation of class, a rule base is constructed by using linked lists.
所以,要构建一个非阻塞的链表、树或哈希表,需要找到一种方式,可以用CAS更新多个指针,同时不会让数据结构处于不一致的状态。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
一开始看来,用这种方法表示一个空链表使代码简单。
It may at first appear that representing empty lists in this way makes the code simpler.
And we're having a difference of opinion as to whether we should use a tuple or a list here, right?
可以“是结果,明白了吗?我们队在这里是应该用数组,还是链表还有一些不同意见对吧?
When you think about an int or a float or a dictionary or a list, you knew that there were functions that operated on them.
当你想到整型,浮点型,或者链表时,你知道可以用函数去处理他们,但是当你传递一个参数,例如链表。
应用推荐