Data Structure

Data Structure

1. Stacks

   • A stack is a special list in which all elements are inserted or removed at one end of the list.
     • In a stack entering the last element is the first out .
       • The basic operations performed on a stack usually the following :
         • Initialize a stack
         • Removing a component of the stack
         • Enter an item on the stack
         • Checks if the stack is empty .

2. TAILS

   • Is another special queue list in which all the elements are inserted at one end and removed at the other end of the list
     • The basic operations with the tail are very similar to those of the stacks:
       • Initialize a stack
       • Removing a component of the stack
       • Enter an item on the stack
         • The items are stored in a linked list
           • The queue has a pointer to the beginning and at the end
             • the elements are inserted at the end and are extracted from the beginning
               • You can perform an implementation of the queue in an array in a very efficient manner.
                 • considering the array as a circular structure, which can be covered so that if you reach the end it starts again at the beginning.
       • Checks if the stack is empty ..

3. VECTORS

   • A vector is an ordered sequence of objects , in which there is random access to the same
     • Unlike arrays, allows resizing
       • Major operations
         • obtain and resize
         • delete elements and whether they are deleted
         • obtain or modify items in any position
           • The vector is a pointer to an array created on the heap :
             • if necessary resize a new array is created and the old elements are moved to the new Each box has a boolean indicating if it is deleted or not
     • They are a generalization of the array, with the fundamental difference in power resized. The size (length ) can check and change .

4. LISTS

   • A list is an ordered sequence of objects , in which it can:
     • insert or delete elements in any position
     • navigate through the list and optionally forward , backward
       • usually one by one by the primer_elemento and following operations (last and earlier)
         • Each object is located at a position in the list , which will be of abstract type " Position " . This guy is not necessarily a number.
           • enters the main Funcines lists are :
             • forward through the items .
               • The list of cells simply linked with pointers
                 • the first element is empty, the position of an element is a pointer to the previous .
             • tour the elemenos backwards.
               • The list is represented by an array in which each element stores a box ,
                 • items are sorted according to the index of the box.
             • insert a new element to princio or end.
             • remove an element from the beginning or end among others.
     • also allow us to find specific item in the list

5. CLASS or ADT

   • A class or abstract data type ( ADT ) is:
     • a data type with a given structure
       • plus a set of operations to handle such data.
         • Enables all the operations using the data structure .
           • programs using the class are independent of the way it is implemented
             • The data type of a variable is the set of values ​​that can make that variable.
               • The operations of the class allow the program that uses it is independent of the way the class is implemented
                 • but not thus is independent of Goods Yard
               • The classes encapsulate a data type with all operations performed with such data .
                 • This implies that all the elements of the class have their own storage space within the program, which saves all its details.
   • The Ada language defines a set of packets within the standard that implements some abstract data types.
     • These packages are grouped into several packages Ada.Containers generic child
       • Some of them are:
         • Vectors: Ada.Containers.Vectors
         • Linked Lists : Ada.Containers.Doubly_Linked_Lists
         • Maps: Ada.Containers.Hashed_Maps , Ada.Containers.Ordered_Maps
         • Sets: Ada.Containers.Hashed_Sets , Ada.Containers.Ordered_Sets