数据结构；资料结构

data structure───[计]数据结构

deep structures───深层结构；基底结构

pay structures───工资结构

capital structures───[经]资本结构

aerostructures───n.飞机结构构件（aerostructure的复数形式）

bone structures───骨架；骨结构

deep structure───深层结构；基底结构

Variables are used to store values of data structures.───变量是用来存储数据结构内容的.

Practice information hiding: Separate the application of data structures from their implementation.───使用信息隐藏: 将数据结构的应用与它的执行分开考虑.

Exclusivity of data structures.───数据结构的排外性。

In data structures, a collection of trees.───数据结构中的一种树型结构的集合.

Recursive algorithms in a data structures course are both important and difficult.───数据结构课程中的递归算法的教学既是重点又是难点.

His doctoral thesis was on Algorithms and Data Structures for Dynamic Graphs.───他的博士论文是动态图表的算法和数据结构.

Content for the C language to describe data structures courseware.───内容为C语言描述的数据结构课件.

The internal data structures are based on annotation graphs.───其内部数据结构建立在注释图表的基础上.

Data structures are reusable because they tend to be modular and context - free.───因为数据结构趋向于模块化并和环境无关,所以数据结构是可以复用的.

Business data structures.───业务数据结构。

Back in the 1970 s, we created a methodology built on data structures.───70年代, 我们建立了一种基于数据结构的方法学.

Data structures is a very important basic course for the computer science.───资料结构是资讯科学中非常重要的一门基础课程.

Relative kernel service routines and basic data structures are carefully designed.───给出了相关内核服务例程和基本的数据结构的设计.

Three reasons for using data structures are efficiency, abstraction, and reusability.───使用数据结构的三个原因是效率 、 抽象性和复用性.

Three reasons for using data structures are efficiency, abstraction, reusability.───高效 、 抽象 、 可再用是使用数据结构的三大理由.

These are universal data structures.───这些都是常见的数据结构.

Table 5 - 1 . Functions, macros, variables, and data structures related to system.───表5-1是本章所涉及到的一些函数, 宏, 变量以及数据结构.

Document data structures in the model.───在模型中文档化数据结构。

Data structures accessed by assembler code.

Chapter 2 contains a discussion of alternative data structures for spatial data.

Many real-world data structures fit into the hierarchical pattern, however, and they are also readily understood.

For rigid object, the data structures that most collision detection algorithms on end in the - processing phase.

Topics include control structures, built-in data structures, simple sorting and searching procedural abstraction, and paradigm-specific concepts and constructs.

Similarly, Linux kernel data structures can also be logged and even modified non-disruptively, as well.

As the flow of information was fixed, data structures could be tailored to the specific knowledge bases using them.

The only available collection data structures are vectors, stacks, enumerations, and hash tables.

Two data structures are used: an active node stack and a three-cell constituent buffer.