source: src/examples/vector_int.c @ 1ad1c99

aaron-thesisarm-ehcleanup-dtorsctordeferred_resndemanglerenumforall-pointer-decaygc_noraiijacob/cs343-translationjenkins-sandboxmemorynew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since 1ad1c99 was 1ad1c99, checked in by Rob Schluntz <rschlunt@…>, 6 years ago

modified vector_test to use constructors and destructors

  • Property mode set to 100644
File size: 1.6 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.c --
8//
9// Author           : Richard C. Bilson
10// Created On       : Wed May 27 17:56:53 2015
11// Last Modified By : Rob Schluntz
12// Last Modified On : Wed Apr 27 17:27:12 2016
13// Update Count     : 3
14//
15
16#include "vector_int.h"
17extern "C" {
18#include <stdlib.h>
19#include <assert.h>
20}
21
22#define DEFAULT_CAPACITY 20
23
24void ?{}( vector_int * vec ) {
25        vec { DEFAULT_CAPACITY };
26}
27
28void ?{}( vector_int * vec, int reserve ) {
29        vec->last = -1;
30        vec->capacity = reserve;
31        vec->data = malloc( sizeof( int ) * reserve );
32}
33
34void ?{}( vector_int * vec, vector_int other ) {
35        vec->last = other.last;
36        vec->capacity = other.capacity;
37        vec->data = malloc( sizeof( int ) * other.capacity );
38        for (int i = 0; i < vec->last; i++) {
39                vec->data[i] = other.data[i];
40        }
41}
42
43void ^?{}( vector_int * vec ) {
44        free( vec->data );
45}
46
47void reserve( vector_int *vec, int reserve ) {
48        if ( reserve > vec->capacity ) {
49                vec->data = realloc( vec->data, sizeof( int ) * reserve );
50                vec->capacity = reserve;
51        }
52}
53
54void append( vector_int *vec, int element ) {
55        vec->last++;
56        if ( vec->last == vec->capacity ) {
57                vec->capacity *= 2;
58                vec->data = realloc( vec->data, sizeof( int ) * vec->capacity );
59        }
60        vec->data[ vec->last ] = element;
61}
62
63// implement bounded_array
64
65lvalue int ?[?]( vector_int * vec, int index ) {
66        return vec->data[ index ];
67}
68
69int last( vector_int * vec ) {
70        return vec->last;
71}
72
73
74// Local Variables: //
75// tab-width: 4 //
76// compile-command: "cfa vector_int.c" //
77// End: //
Note: See TracBrowser for help on using the repository browser.