Приклади вживання The data structure Англійська мовою та їх переклад на Українською
{-}
- 
                        Colloquial
                    
 - 
                        Ecclesiastic
                    
 - 
                        Computer
                    
 
The data structure of thought.
Design and implement the data structure"stack".
The data structure of the  equipment can be of any depth(a tree).
Instead they're processing the data structure of thought.
The data structure becomes an object that includes both data  and functions.
Now by analyzing the  problem, store its input if it's new(or not in the data structure) with its respective output.
The data structure is fully persistent if every version can be both accessed and modified.
(In the  following comparisons,it is assumed that the  keys are of length k and the data structure contains n members.).
This tool will extract the data structure and generate the  table creation SQL script.
For simplicity of illustration, data structures  may be shown tohave fields that are related through location in the data structure.
The data structure of a three-level hardware, making it difficult to use in large organizations.
An event is considered external if the  property maintained by the data structure changes when the  event occurs.
The data structure used for a particular algorithm can greatly impact its performance.
If there is also a meld or merge operation that cancreate a new version from two previous versions, the data structure is called confluently persistent.
If the data structure is changed, all of the  modules accessing them have to be rewritten.
For simplicity of illustration,data structures  having fields that are set by arrangement in the data structure can be shown.
Beside this, we support the data structure, if it is necessary to expand the  class range.
Instead, we need to answer a query in the same fashion as the  triangulation refinement approach, but the data structure is constructed top-down.
In this way, the data structure becomes an object that includes both function and data. .
For example, data structures  often store information redundantly,or have identical sections regardless of the  information in the data structure.
The data structure can be defined as the  interpretation of logical relationship existing between the  solitary elements of data. .
OPC-UA Part 4 on page 141 contains a description of the data structure signatures, where first goes the data  signature, and then the  string algorithm.
It could be problematic simply to naively propagate a change using a stack,because of potential exponential update complexity if the data structure has a certain shape.
This language is focused on the data structure in the  form of a list and allows you to organize the  effective processing of large amounts of text information.
For instance it is often the  case that data structures  store information redundantly,or have sections that are always the  same regardless of the  information in the data structure.
These changes must then be cascaded back through the data structure: all nodes that pointed to the  old node must be modified to point to the  new node instead.
Because the data structure in the  secondary data  source must matchthe  way that data  is stored in the  database, you cannot modify existing fields or groups in the  secondary data  source.
Because the data structure in the  secondary data  source must matchthe  way that data  is stored in the  database tables, you cannot modify the  fields or groups in the  secondary data  source.
Many details are omitted below,usually the  most important part of the  implementation is the data structure used for storing the  candidate sets, and counting their frequencies.