Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。
The Red-Black tree is a compromise between space and time.
红黑树在时间和空间之间达成了妥协。
Largest and smallest number of internal nodes in red-black tree?
在红黑树的内部节点的最大和最小的号码吗？
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。
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。
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)技术以显示本文中消息队列框架的内部操作。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
The third, the Real-Time Memory Database based on the red-black tree and the querying optimization program are mainly researched.
第三，着重研究了基于红黑树的实时内存数据库数据组织结构及其查询优化方案。
This article is an introduction to templates, iterators, and temporary classes illustrated by an implementation of a 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)。
You can say that a 3-node in a 2-3-4 tree is equivalent to a parent with a red child in a red-black tree, and a 4-node is equivalent to a parent with two red children.
可以说，2-3-4树中的3 -节点等价于红-黑树中有一个红色子节点的父节点，4 -节点等价于有两个红色子节点的父节点。
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。
It was fine, coming through the snow as the red sun was rising and showing against the black tree-trunks!
从雪地里钻出来的时候，红日冉冉升起，映着黑黝黝的树干，天气真不错！
Thirty years ago, if you were walking along the coast of the Netherlands and picked a two-spot ladybug off the leaf of a European lime tree, chances were that the bug would be red with black spots.
30年前，如果你走在荷兰的海岸边，从菩提树上取下一只双斑瓢虫，你会发现这只瓢虫的颜色是红色黑斑的；
Red and black tree algorithm test operation.
红黑树的算法试验作业。
That's why the red-black rules keep the tree balanced.
这就是为什么红-黑规则能保证树是平衡的。
I have watered the red huckleberry, the sand cherry and the nettle-tree, the red pine and the black ash, the white grape and the yellow violet, which might have withered else in dry seasons.
我还浇灌红色的越橘树、沙色的樱桃树和荨麻树、红色的松树和黑色的白蜡树，还有白色的葡萄树和枯黄的紫罗兰，不然它们会在干旱的季节里枯萎的。
I have watered the red huckleberry, the sand cherry and the nettle-tree, the red pine and the black ash, the white grape and the yellow violet, which might have withered else in dry seasons.
我给红色的越橘，沙地上的樱桃树和荨麻，红松和黑愕，白葡萄藤和黄色的紫罗兰花都浇过水，否则在天气干燥的季节中，它们可能会枯萎的。
It ensures that one or two rotations will restore red-black correctness in the entire tree.
这保证了一次或两次旋转可以使整棵树再次成为正确的红-黑树。
Suppose that performing a rotation and appropriate color changes caused other violations of the red-black rules to appear further up the tree.
假设执行旋转和适当颜色改变造成了在树的上方出现其他红-黑规则违规的情况。
应用推荐