FilesExpand file tree

master

/

DoublyLinkedArray.h

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

96 lines (84 loc) · 1.65 KB

master

/

DoublyLinkedArray.h

Copy path

Top

File metadata and controls

• Code
• Blame

96 lines (84 loc) · 1.65 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

/////////////////////////////////////////////////////////////////////////////

// Filename: DoublyLinkedArray.h

// Author: Sameh Khamis

//

// Description: Algorithm-specific data structure - a doubly linked list

// embedded in an array

/////////////////////////////////////////////////////////////////////////////

#ifndef _DOUBLY_LINKED_ARRAY

#define _DOUBLY_LINKED_ARRAY

template <typename Type>

class DoublyLinkedArray

{

private:

typedef pair<Type, Type> Node;

Type first, last;

Node *nodes;

Type size, count;

public:

DoublyLinkedArray(Type size)

{

this->size = size;

nodes = new Node[size];

for (unsigned i = 0; i < size; i++)

{

nodes[i].first = size;

nodes[i].second = size;

}

first = last = size;

count = 0;

}

~DoublyLinkedArray()

{

delete[] nodes;

}

unsigned get_count()

{

return count;

}

bool empty()

{

return first == size;

}

void push_back(const Type& id)

{

if (!empty())

{

nodes[last].second = id;

nodes[id].first = last;

}

else

first = id;

last = id;

count++;

}

Type pop_front()

{

Type old_first = first;

first = nodes[first].second;

nodes[old_first].second = size;

if (!empty())

nodes[first].first = size;

else

last = size;

count--;

return old_first;

}

void remove(Type id)

{

if (id == first)

pop_front();

else

{

if (id == last)

last = nodes[id].first;

else

nodes[nodes[id].second].first = nodes[id].first;

nodes[nodes[id].first].second = nodes[id].second;

nodes[id].first = size;

nodes[id].second = size;

count--;

}

}

};

#endif