FilesExpand file tree

master

/

c_array.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

145 lines (133 loc) · 3.84 KB

master

/

c_array.c

Copy path

Top

File metadata and controls

• Code
• Blame

145 lines (133 loc) · 3.84 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

/*

Copyright (c) 2013-2014, Cong Xu

All rights reserved.

Redistribution and use in source and binary forms, with or without

modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this

list of conditions and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice,

this list of conditions and the following disclaimer in the documentation

and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE

LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

POSSIBILITY OF SUCH DAMAGE.

*/

#include "c_array.h"

#include <stdlib.h>

#include <string.h>

#include "utils.h"

void CArrayInit(CArray *a, size_t elemSize)

{

a->data = NULL;

a->elemSize = elemSize;

a->size = 0;

a->capacity = 0;

CArrayReserve(a, 1);

}

void CArrayReserve(CArray *a, size_t capacity)

{

if (a->capacity == capacity)

{

return;

}

a->capacity = capacity;

CREALLOC(a->data, a->capacity * a->elemSize);

}

void CArrayCopy(CArray *dst, const CArray *src)

{

CArrayTerminate(dst);

CArrayInit(dst, src->elemSize);

CArrayReserve(dst, (int)src->size);

for (int i = 0; i < (int)src->size; i++)

{

CArrayPushBack(dst, CArrayGet(src, i));

}

}

void CArrayPushBack(CArray *a, const void *elem)

{

CASSERT(a->elemSize > 0, "array has not been initialised");

if (a->size == a->capacity)

{

CArrayReserve(a, a->capacity * 2);

}

a->size++;

memcpy(CArrayGet(a, a->size - 1), elem, a->elemSize);

}

void CArrayInsert(CArray *a, int idx, void *elem)

{

CASSERT(a->elemSize > 0, "array has not been initialised");

if (a->size == a->capacity)

{

CArrayReserve(a, a->capacity * 2);

}

a->size++;

if (idx < (int)a->size - 1)

{

memmove(

CArrayGet(a, idx + 1),

CArrayGet(a, idx),

a->elemSize * ((int)a->size - 1 - idx));

}

memcpy(CArrayGet(a, idx), elem, a->elemSize);

}

void CArrayDelete(CArray *a, int idx)

{

CASSERT(a->size != 0, "Cannot delete from empty array");

CASSERT(a->elemSize > 0, "array has not been initialised");

CASSERT(idx >= 0 && idx < (int)a->size, "array index out of bounds");

if (idx < (int)a->size - 1)

{

memmove(

CArrayGet(a, idx),

CArrayGet(a, idx + 1),

a->elemSize * ((int)a->size - 1 - idx));

}

a->size--;

}

void *CArrayGet(const CArray *a, int idx)

{

CASSERT(a->elemSize > 0, "array has not been initialised");

CASSERT(idx >= 0 && idx < (int)a->size, "array index out of bounds");

return &((char *)a->data)[idx * a->elemSize];

}

void CArrayClear(CArray *a)

{

a->size = 0;

}

void CArrayRemoveIf(CArray *a, bool (*removeIf)(const void *))

{

// Note: this is the erase-remove idiom

// Check all elements to see if they need to be removed

// Move all the elements that don't need to be removed to the head

void *dst = a->data;

size_t shrunkSize = 0;

for (int i = 0; i < (int)a->size; i++)

{

const void *elem = CArrayGet(a, i);

if (!removeIf(elem))

{

memmove(dst, elem, a->elemSize);

dst = (char *)dst + a->elemSize;

shrunkSize++;

}

}

// Shrink the array to fit

a->size = shrunkSize;

}

void CArrayTerminate(CArray *a)

{

if (!a)

{

return;

}

CFREE(a->data);

memset(a, 0, sizeof *a);

}