/
VdmProduct.c
78 lines (64 loc) · 1.78 KB
/
VdmProduct.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
* #%~
* The VDM to C Code Generator
* %%
* Copyright (C) 2015 - 2016 Overture
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/gpl-3.0.html>.
* #~%
*/
/*
* VdmProduct.c
*
* Created on: Dec 2, 2015
* Author: kel
*/
#include "VdmProduct.h"
#define ASSERT_CHECK(s) assert(s->type == VDM_PRODUCT && "Value is not a product")
struct TypedValue* newProduct(size_t size)
{
return newCollection(size, VDM_PRODUCT);
}
struct TypedValue* newProductWithValues(size_t size,TVP* elements)
{
return newCollectionWithValues(VDM_PRODUCT,size,elements);
}
TVP productGet(TVP product, int index)
{
ASSERT_CHECK(product);
UNWRAP_PRODUCT(col,product);
assert(index-1>=0 && index-1<col->size && "invalid index");
return vdmClone(col->value[index-1]);
}
void productSet(TVP product, int index, TVP val)
{
ASSERT_CHECK(product);
UNWRAP_PRODUCT(col,product);
assert(index-1>=0 && index-1<col->size && "invalid index");
TVP old = col->value[index-1];
if(old !=NULL)
{
recursiveFree(old);
}
col->value[index-1]=vdmClone(val);
}
//TVP productEqual(TVP product,TVP product2)
//{
//
// ASSERT_CHECK(product);
// ASSERT_CHECK(product2);
//
// return newBool(collectionEqual(product,product2));
//}