The other rose tree had red flowers.
另一棵玫瑰树有红花。
It was fine, coming through the snow as the red sun was rising and showing against the black tree-trunks!
从雪地里钻出来的时候，红日冉冉升起，映着黑黝黝的树干，天气真不错！
The red rose asked the pine tree what the birds were doing.
红玫瑰问松树，鸟儿在干什么。
The Red-Black tree is a compromise between space and time.
红黑树在时间和空间之间达成了妥协。
Cedar Creek Treehouse is 80 miles south of Seattle and is set 50 feet up in a 200-year-old western red cedar tree, right in the canopy of a lush temperate rainforest on the base of Mount Rainier.
树屋旅馆位于西雅图以南80英里处草木苍翠的雷尼尔山雨林中，建在50英尺高处的一棵200岁的红香柏树上。
The text of the element is what appears in the tree as the red node, as shown in Figure 2.
这个元素的文字在树中作为红色节点出现，如图2所示。
These are called the four prerequisites of a red-black tree. Figure 4 shows an example of a red-black tree.
这些称为红黑树的四个先决条件。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
为了公平，调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
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.
第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
The tree nodes that were removed or dropped are styled with red-strikethrough, and the tree nodes that were renamed are shown in blue.
删除或是丢弃的那些树节点用红色的删除线进行样式化，重命名的那些树节点则显示为蓝色。
The above tree is the first to start changing its colors to an apple-red in this English garden.
上面的这张照片中，英国花园里的树木首次开始改变它的颜色成为苹果红。
As a result, the green chlorophyll is slowly leached away, revealing the yellow and orange hues seen in some tree species come autumn. Red leaves are another story.
其结果是，绿色的叶绿素是慢慢地被过滤了出来，在某些树种中，从它们所展现的黄色和橙色的色调里可以看到秋天的到来。可是红叶却是另外一件事。
At this moment, the Goddess became a tree with red trunk, green leaves and golden olives. Everyone felt its peace and love.
这时候正义女神变成了一棵树，这棵树有着红褐色的树干，苍翠的绿叶以及金色的橄榄，任何人看了都感受到爱与和平。
The state flower is the red clover and the tree is the sugar maple.
它的州花是红花苜宿，而它的州树是糖枫树。
Down the wide, tree-lined boulevards, rows of nearly identical red-roofed villas sit side by side.
沿着宽阔的林荫大道一排排近乎相同的红顶别墅比肩坐落。
With the sun shining on tree-shaded campus and red school buildings, Tagore International School was extraordinarily beautiful.
绿树掩映的校园、红色的教学楼，夕阳映照下的泰戈尔国际学校显得格外美丽。
Repeat this process with the red, orange, purple and more yellow paint until the branches of the tree are filled with autumn leaves.
用红、橙、紫和更多的黄色重复上一步骤，直到叶满枝头。
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 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调用(通过调度类)返回到红黑树。
The leaves of this tree are red.
这棵树的叶子是红色的。
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。
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年前，如果你走在荷兰的海岸边，从菩提树上取下一只双斑瓢虫，你会发现这只瓢虫的颜色是红色黑斑的；
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 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)。
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)。
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表示，它只包含子引用和父对象的颜色。
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位字段），它表示任务运行的时间量，并作为红黑树的索引。
This function simply picks the left-most task from the red-black tree and returns the associated sched_entity.
此函数只是从红黑树中获取最左端的任务并返回相关 sched_entity。
This function simply picks the left-most task from the red-black tree and returns the associated sched_entity.
此函数只是从红黑树中获取最左端的任务并返回相关 sched_entity。
应用推荐