A descriptor is a specialized representation for doing useful tasks on images and other data structures.

描述符是对图像或是其他数做有用处理的一种专门的表述。

So the question immediately arises: what kind of data structure should be used for the output?

应该在输出中采用哪种数？

In China and Singapore the data structure for doing this is highly centralized.

在中国和新加坡，这样做的数是高度集中的。

And between the language models, we exchange suitable data structures not English - Mm-hmm.

在语言模型之间，我们交换合适的数，而不是英语 - 嗯嗯。

But, the struct data structure can be used for building more complicated data structures that avoid these restrictions.

但是，struct 数可用于建更杂的数，从而避免这些限制。

For data that links arbitrarily, that include things like loops, we can use a graph data structure instead.

对于任意链接的数，包括循环之类的东西，我们可以改用图数。

Fortunately, most programming languages come with libraries packed full of ready-made data structures.

幸运的是，大多数编程语言都带有充满现成数的库。

Using this struct, we can create a linked list, which is a flexible data structure that can store many nodes.

使用这，我们可以创建一链表，它是一种灵活的数，可以存储很多节点。

So that's a whirlwind overview of pretty much all of the fundamental data structures used in computer science.

所以这是对几乎所有计算机科学中使用的基本数的快速概述。

In this case, let's imagine all the users' data is stored in a data structure called a table labeled " users" .

在这种情况下，让我们假设所有用户的数都存储在一名为“用户”的表的数中。

These different data structures have properties that are useful for particular computations.

这些不同的数具有对特定计算有用的属性。

Now we can create variables that aren't just single numbers, but are compound data structures, able to store several pieces of data at once.

现在我们可以创建不仅仅是单数字的变量，而是合数，能够一次存储多数。

UAP or airborne objects that when encountered cannot be immediately identified, however it is the department's contention that by combining appropriately structured collected data with rigorous scientific analysis.

当遇到无法立即识别的UAP或空中物体时，然而，该部门的论点是，通过将适当的收集数与严格的科学分析相合。

Arrays are extremely versatile data structures, used all the time, and so there are many functions that can handle them to do useful things.

数组是极其通用的数，一直在使用，因此有许多函数可以处理它们来做有用的事情。

But you could just as easily have trees with three, four or any number of children by modifying the data structure accordingly.

但是通过相应地修改数，你可以很容易地拥有三、四或任意数量的孩子的树。

In our example, nodes can have up to two children, and for that reason, this particular data structure is called a binary tree.

在我们的示例中，节点最多可以有两子节点，因此，这种特殊的数称为二叉树。

Over the past few episodes, we've been building up our understanding of computer science fundamentals, such as functions, algorithms and data structures.

在过去的几集中，我们一直在加深对计算机科学基础知识的理解，例如函数、算法和数。

Owing to this flexibility, many more-complex data structures are built on top of linked lists The most famous and universal are queues and stacks.

由于这种灵活性，许多更杂的数都建立在链表之上，最著名和最普遍的是队列和堆栈。

An important property of trees – both in real life and in data structures – is that there's a one-way path from roots to leaves.

树的一重要属性——无论是在现实生活中还是在数中——都是从根到叶的单向路径。

There's over 300 million registered domain names, so to make that DNS Lookup a little more manageable, it's not stored as one gigantically long list, but rather in a tree data structure.

有超过 3 亿注册域名，因此为了使 DNS 查找更易于管理，它没有存储为一巨大的长列表，而是存储在树状数中。