ADT
        aaron-thesis
        arm-eh
        ast-experimental
        cleanup-dtors
        ctor
        deferred_resn
        demangler
        enum
        forall-pointer-decay
        gc_noraii
        jacob/cs343-translation
        jenkins-sandbox
        memory
        new-ast
        new-ast-unique-expr
        new-env
        no_list
        persistent-indexer
        pthread-emulation
        qualifiedEnum
        resolv-new
        string
        with_gc
      
      
        
          | Last change
 on this file since 4067aa8 was             86bd7c1f, checked in by Peter A. Buhr <pabuhr@…>, 10 years ago | 
        
          | 
licencing: eighth groups of files
 | 
        
          | 
              
Property                 mode
 set to                 100644 | 
        
          | File size:
            1.4 KB | 
      
      
| Line |  | 
|---|
| 1 | // | 
|---|
| 2 | // Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo | 
|---|
| 3 | // | 
|---|
| 4 | // The contents of this file are covered under the licence agreement in the | 
|---|
| 5 | // file "LICENCE" distributed with Cforall. | 
|---|
| 6 | // | 
|---|
| 7 | // vector_int.h -- | 
|---|
| 8 | // | 
|---|
| 9 | // Author           : Richard C. Bilson | 
|---|
| 10 | // Created On       : Wed May 27 17:56:53 2015 | 
|---|
| 11 | // Last Modified By : Peter A. Buhr | 
|---|
| 12 | // Last Modified On : Wed May 27 18:39:05 2015 | 
|---|
| 13 | // Update Count     : 2 | 
|---|
| 14 | // | 
|---|
| 15 |  | 
|---|
| 16 | #ifndef VECTOR_INT_H | 
|---|
| 17 | #define VECTOR_INT_H | 
|---|
| 18 |  | 
|---|
| 19 | // A flexible array, similar to a C++ vector, that holds integers and can be resized dynamically | 
|---|
| 20 |  | 
|---|
| 21 | typedef struct vector_int { | 
|---|
| 22 | int last;                                                                                       // last used index | 
|---|
| 23 | int capacity;                                                                           // last possible index before reallocation | 
|---|
| 24 | int *data;                                                                                      // array | 
|---|
| 25 | } vector_int; | 
|---|
| 26 |  | 
|---|
| 27 | vector_int vector_int_allocate();                                               // allocate vector with default capacity | 
|---|
| 28 | vector_int vector_int_allocate( int reserve );                  // allocate vector with specified capacity | 
|---|
| 29 | void vector_int_deallocate( vector_int );                               // deallocate vector's storage | 
|---|
| 30 |  | 
|---|
| 31 | void reserve( vector_int *vec, int reserve );                   // reserve more capacity | 
|---|
| 32 | void append( vector_int *vec, int element );                    // add element to end of vector, resizing as necessary | 
|---|
| 33 |  | 
|---|
| 34 | // implement bounded_array | 
|---|
| 35 |  | 
|---|
| 36 | lvalue int ?[?]( vector_int vec, int index );                   // access to arbitrary element (does not resize) | 
|---|
| 37 | int last( vector_int vec );                                                             // return last element | 
|---|
| 38 |  | 
|---|
| 39 | #endif // VECTOR_INT_H | 
|---|
| 40 |  | 
|---|
| 41 | // Local Variables: // | 
|---|
| 42 | // tab-width: 4 // | 
|---|
| 43 | // compile-command: "cfa vector_int.c" // | 
|---|
| 44 | // End: // | 
|---|
       
      
  Note:
 See   
TracBrowser
 for help on using the repository browser.