ADT
        aaron-thesis
        arm-eh
        ast-experimental
        cleanup-dtors
        deferred_resn
        demangler
        enum
        forall-pointer-decay
        jacob/cs343-translation
        jenkins-sandbox
        new-ast
        new-ast-unique-expr
        new-env
        no_list
        persistent-indexer
        pthread-emulation
        qualifiedEnum
        resolv-new
        with_gc
      
      
        
          | Last change
 on this file since ab16fc5 was             4a9ccc3, checked in by Rob Schluntz <rschlunt@…>, 9 years ago | 
        
          | 
propagate sized status through trait instances
 | 
        
          | 
              
Property                 mode
 set to                 100644 | 
        
          | File size:
            1.6 KB | 
      
      
| Rev | Line |  | 
|---|
| [86bd7c1f] | 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 | // | 
|---|
| [1ad1c99e] | 7 | // array.h -- | 
|---|
| [86bd7c1f] | 8 | // | 
|---|
|  | 9 | // Author           : Richard C. Bilson | 
|---|
|  | 10 | // Created On       : Wed May 27 17:56:53 2015 | 
|---|
| [1ad1c99e] | 11 | // Last Modified By : Rob Schluntz | 
|---|
|  | 12 | // Last Modified On : Wed Apr 27 17:26:04 2016 | 
|---|
| [4040425] | 13 | // Update Count     : 5 | 
|---|
| [86bd7c1f] | 14 | // | 
|---|
|  | 15 |  | 
|---|
| [51b73452] | 16 | #ifndef ARRAY_H | 
|---|
|  | 17 | #define ARRAY_H | 
|---|
|  | 18 |  | 
|---|
| [d3b7937] | 19 | //#include <iterator> | 
|---|
| [51b73452] | 20 |  | 
|---|
| [134b86a] | 21 | // An array has contiguous elements accessible in any order using integer indicies. The first | 
|---|
|  | 22 | // element has index 0. | 
|---|
| [4040425] | 23 | trait array( otype array_type, otype elt_type ) { | 
|---|
| [86bd7c1f] | 24 | lvalue elt_type ?[?]( array_type, int ); | 
|---|
| [51b73452] | 25 | }; | 
|---|
|  | 26 |  | 
|---|
| [134b86a] | 27 | // A bounded array is an array that carries its maximum index with it. | 
|---|
| [1ad1c99e] | 28 | trait bounded_array( otype array_type, otype elt_type | array( array_type *, elt_type ) ) { | 
|---|
|  | 29 | int last( array_type * ); | 
|---|
| [51b73452] | 30 | }; | 
|---|
|  | 31 |  | 
|---|
|  | 32 | // implement iterator_for | 
|---|
|  | 33 |  | 
|---|
| [4a9ccc3] | 34 | forall( otype array_type, otype elt_type | bounded_array( array_type, elt_type ) ) | 
|---|
|  | 35 | [ elt_type * begin, elt_type * end ] get_iterators( array_type * ); | 
|---|
| [134b86a] | 36 |  | 
|---|
|  | 37 |  | 
|---|
|  | 38 | // A bounded array can be iterated over by using a pointer to the element type. These functions | 
|---|
|  | 39 | // return iterators corresponding to the first element and the one-past-the-end element, STL-style. | 
|---|
| [4040425] | 40 | forall( otype array_type, otype elt_type | bounded_array( array_type, elt_type ) ) | 
|---|
| [1ad1c99e] | 41 | elt_type * begin( array_type * array ); | 
|---|
| [134b86a] | 42 |  | 
|---|
| [1ad1c99e] | 43 | // The end iterator should point one past the last element. | 
|---|
| [4040425] | 44 | forall( otype array_type, otype elt_type | bounded_array( array_type, elt_type ) ) | 
|---|
| [1ad1c99e] | 45 | elt_type * end( array_type * array ); | 
|---|
| [51b73452] | 46 |  | 
|---|
| [134b86a] | 47 | #endif // ARRAY_H | 
|---|
| [86bd7c1f] | 48 |  | 
|---|
|  | 49 | // Local Variables: // | 
|---|
|  | 50 | // tab-width: 4 // | 
|---|
|  | 51 | // compile-command: "cfa array.c" // | 
|---|
|  | 52 | // End: // | 
|---|
       
      
  Note:
 See   
TracBrowser
 for help on using the repository browser.