Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。
That's why the red-black rules keep the tree balanced.
这就是为什么红-黑规则能保证树是平衡的。
The Red-Black tree is a compromise between space and time.
红黑树在时间和空间之间达成了妥协。
You can find the implementation of red-black trees in the kernel at ./lib/rbtree.c.
您可以在./lib/rbtree.c 中找到 “红-黑”树的这个实现。
We'll use the red-black tree structure to provide priority-based message processing because.
我们将使用红黑树结构来提供基于优先级的消息处理，因为。
It puts the scheduling entity (process) into the red-black tree and increments the nr_running variable.
它将调度实体(进程)放入红黑树中，并对nr_running变量加1。
The Watson allocation policy maintains free space in the heap as nodes in two separate "red-black trees"
Watson分配策略在两个单独的 “红黑树” 中以节点的形式维护堆中的空闲空间
These are called the four prerequisites of a red-black tree. Figure 4 shows an example of a red-black tree.
这些称为红黑树的四个先决条件。
This function simply picks the left-most task from the red-black tree and returns the associated sched_entity.
此函数只是从红黑树中获取最左端的任务并返回相关 sched_entity。
You can find red-black trees used in a variety of applications, including the construction of associative arrays.
“红-黑”树广泛应用于各种应用程序，其中包括关联数组的构造。
Leaves in a red-black tree contain no information, but internal nodes represent one or more tasks that are runnable.
红黑树的叶子不包含信息，但是内部节点代表一个或多个可运行的任务。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
为了公平，调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
First, we'll introduce red-black tree technology to show the internal operations of the message queue framework in this article.
首先，我们介绍红黑树(red - black tree)技术以显示本文中消息队列框架的内部操作。
The currently running task (now preempted) is returned to the red-black tree through a call to put_prev_task (via the scheduling class).
当前运行任务(现在被抢占的任务)通过对put _ prev_task调用(通过调度类)返回到红黑树。
Each node in the red-black tree is represented by an rb_node, which contains nothing more than the child references and the color of the parent.
红黑树的每个节点都由rb _ node表示，它只包含子引用和父对象的颜色。
But rather than maintain the tasks in a run queue, as has been done in prior Linux schedulers, the CFS maintains a time-ordered red-black tree (see Figure 1).
但是与之前的Linux调度器不同，它没有将任务维护在运行队列中，CFS维护了一个以时间为顺序的红黑树(参见图1)。
The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.
对于大多数操作，红黑树的执行时间为O(logn)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
The data structure used is a red-black tree, which is ideal for performance-focused applications (and happens to be available generically as a library within the kernel).
这个数据结构是一个“红-黑”树，对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list.
第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
Most importantly, the sched_entity contains the vruntime (64-bit field), which indicates the amount of time the task has run and serves as the index for the red-black tree.
最重要的是， sched_entity包含vruntime（64位字段），它表示任务运行的时间量，并作为红黑树的索引。
Dequeue_task: When a task is no longer runnable, this function is called to keep the corresponding scheduling entity out of the red-black tree. It decrements the nr_running variable.
dequeue _ task：当某个任务退出可运行状态时调用该函数，它将从红黑树中去掉对应的调度实体，并从nr_running变量中减1。
This dress comes in black and red.
这款连衣裙有黑、红两种颜色。
She put on a red petticoat first, then a black dress, and a white veil over the dress.
她先穿上一件红色的衬裙，然后一件黑色的连衣裙，裙子外面套上一件白色的薄纱裙。
In preparation for the celebration, a straw mat is placed on the table, along with a candle holder with seven candles, one black, three red, and three green.
在准备庆祝活动时，桌子上放着一张草席，还有一个蜡烛架，上面有七支蜡烛——一支黑的，三支红的，还有三支绿的。
Some are brown, some are black, some are orange and some are red.
有的是棕色的，有的是黑色的，有的是桔、红两色的。
There was so much blood on her red petticoat, blood on her black dress and her white veil, blood on the executioner's shoes, blood all over the floor.
有这么多血鲜血渗到她红色的衬裙上，渗到她黑色的连衣裙和她那白色的纱裙上，鲜血流到了刽子手的鞋上，地板上到处是血。
Although this is the average, people with red hair have around 80,000 strands, black or brown hair 100,000 and blondes have about 120,000.
尽管这是平均水平，但红头发的人大约有8万根头发，黑发或棕发的人大约有10万根，金发的人大约有12万根。
It's the female black widow spider that is venomous and displays a menacing red dot on her abdomen.
在雌性毒蜘蛛“黑寡妇”的腹部可以看到有威慑作用的红点。
The hall is decorated in bright orangey-red with black and gold woodwork.
整个大厅用鲜艳的橘红色装饰，木建部分漆成黑色和金色。
The ladybird is red and black.
七星瓢虫是红黑色的。
应用推荐