在 英语 中使用 This data structure 的示例及其翻译为 中文
{-}
-
Political
-
Ecclesiastic
-
Programming
This data structure is called the tree.
有一种数据结构叫做树.For example, if you have this data structure:.
例如，如果您的数据结构设置中有以下结构：.So this data structure is called a queue.
这种数据结构称为队列。We use a Vector of triples to implement this data structure.
我们使用三元组Vector来实现这种数据结构。This data structure is called a priority queue.
这种数据结构叫做优先队列。So I hope you can see that this data structure is very general.
我们可以看到，这种数据结构应用如此广泛。This data structure is called a priority queue.
这种数据结构就叫做优先队列。This data structure is publicly available throughout the kernel layer.
这个数据结构在整个kernel层都可以公共访问。The following program illustrates several of the methods supported by this data structure:.
下面的程序说明这个数据结构支持的几个方法：.This data structure isn't actually executed in the program that we have above.
该数据结构不会在上面我们展示的程序中实际执行。So, when you add a VDF into this data structure, it kind of starts acting like a water clock.
因此,当您将VDF添加到此数据结构时,它开始像水钟一样工作。This data structure is typically called the first-level method lookup cache.
这个数据结构通常称为第一级方法查找缓存（first-levelmethodlookupcache）。Collection of name/value pairs- This Data Structure is supported by different programming languages.
名/值对集合：这一数据结构由不同的编程语言支持。This data structure is a list of lists, just like the one in Chapter 13's Sonar Treasure Hunt game.
这个数据结构是列表的列表，就像第15章的Sonar游戏中的游戏板一样。Collection of name/value pairs- This Data Structure is supported by different programming languages.
名称－值对集合：这一数据结构由不同的编程语言支持。C++ and Java already have built-in PriorityQueue implementations that very likely use this data structure.
C++和Java已经有内置的优先队实现它很有可能用的就是这个数据结构。In this data structure, there are two pieces of“meta-data” stored alongside the actual data values.
在这个数据结构中，有两个元数据与实际数据值一起存储。For a few more interesting questions about this data structure, please practice on BST/AVL training module(no login is required).
有关此数据结构的一些有趣的问题，请在BST/AVL培训模块上练习（无需登录）。This data structure underlies objects in JavaScript(dictionaries in Python and hashes in Ruby).
这个数据结构构成了JavaScript中的对象（Python中的字典，Ruby中的哈希）的基础。For a few more interesting questions about this data structure, please practice on Graph Data Structures training module(no login is required).
有关此数据结构的一些有趣问题，请练习GraphDataStructures培训模块（无需登录）。This data structure underlies objects in JavaScript(dictionaries in Python and hashes in Ruby).
这种数据结构在JavaScript中使用对象表示（Python中是字典，而在Ruby中是哈希）。Forget about the array implementation of any language andask,"Can we abstract out the data type from this data structure?"?
好了，忘掉所有编程语言里实现数组的方法，然后问一个问题：“我们是否可以从这个数据结构中抽象出一种数据类型?Graves adds that this data structure minimizes deployment cost because it minimizes resource consumption.
Graves补充说，这种数据结构将部署成本降到最低，因为它最大限度地减少了资源消耗。Forget about the array implementation of any language and question,Can we abstract out the data type from this data structure?
好了，忘掉所有编程语言里实现数组的方法，然后问一个问题：“我们是否可以从这个数据结构中抽象出一种数据类型?This data structure violates an underlying assumption for usual logistic regression models of independence of the observations.
这种数据结构导致了经典回归分析的独立性假设遭到违反。If you're pulling in another dependency for a data structure, is there an alternativealgorithm you could use which doesn't require this data structure?
如果为了某种数据结构而在拉取另一种依赖项，那么是否存在一种可替代的算法，你可以使用不需要这种数据结构的算法吗？?So, this data structure gets split up and is created all over the place by everyone that's trying to compete to<inaudible>
因此,这个数据结构被分割,由所有试图竞争<到听不见>的人创建。Then you can reference this data structure as needed in your static JavaScript code, knowing it will be available because it's injected in the<head>
然后你可以在静态的JavaScript文件中根据需要参考这个数据结构，能够使用它，是因为它被注入到<head>中。This data structure, with its inclusion of hashes of previous blocks, ensures that the past is preserved and the database is consistent.
这个数据结构包含了以前区块的哈希值，确保过去的数据被保留，数据库是一致的。
