AOS_MUTEX/LexiQueue.cpp at master · kaushik/AOS_MUTEX · GitHub

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
#include "LexiQueue.h"


LexiQueue::LexiQueue(void)
{

}


LexiQueue::~LexiQueue(void)
{

}

Packet LexiQueue::remove(int origin){
	tempq = pq;
	Packet top;
	Packet ret;
	ret.TYPE = -1;
	bool removed = false;
	while(!tempq.empty())
		tempq.pop();
	while(!pq.empty()){
		top = pq.top();
		pq.pop();
		if(top.ORIGIN == origin && removed == false){
			ret =top;
			removed = true;
		}else
			tempq.push(top);
	}
	pq = tempq;

	return ret;
}

Packet LexiQueue::remove(int origin, long seq){
	tempq = pq;
	Packet top;
	Packet ret;
	ret.TYPE = -1;
	while(!tempq.empty())
		tempq.pop();
	while(!pq.empty()){
		top = pq.top();
		pq.pop();
		if(top.ORIGIN == origin && top.SEQ == seq){
			ret =top;
		}else
			tempq.push(top);
	}
	pq = tempq;

	return ret;
}

Packet LexiQueue::top(){
	Packet top;
	top.TYPE = -1;
	if(!pq.empty()){
		top = pq.top();
		return top;
	}
	return top;
}

/* adds to the queue
 * handles duplicate entries by checking before adding
 */
bool LexiQueue::add(Packet in){
	/*if(pq.empty()){
			pq.push(in);
			return true;
	}*/
	Packet temp = remove(in.ORIGIN,in.SEQ);//if element already there remove it and then replace
	pq.push(in);
	return true;
}

bool LexiQueue::updateTorumQ(int **quorum,int qsize,int ID){


	while(!pq.empty()){
		Packet top = pq.top();
		pq.pop();
		for(int j=0;j<qsize;j++){
			if(quorum[top.ORIGIN][j] == ID){
				tempq.push(top);
				break;
			}
		}

	}
	pq = tempq;
	return true;
}

bool LexiQueue::contains(int origin,long seq){

	Packet p = remove(origin,seq);
	if(p.TYPE == -1){
		return false;
	}else{
		add(p);
		return true;
	}
}
int LexiQueue::size(){
	int ret = pq.size();
	return ret;
}

bool LexiQueue::isEmpty(){
	return pq.empty();
}

bool LexiQueue::equalsTo(Packet m1, Packet m2){
    if(m1.ORIGIN == m2.ORIGIN && m1.SEQ == m2.SEQ && m1.TYPE == m2.TYPE)
        return true;
    else
        return false;
   }

void LexiQueue::displayContents(){
	tempq = pq;
	printf("Queue:");
	while(!tempq.empty()){
		printf("%d(%d,s:%d),",(tempq.top()).ORIGIN,(tempq.top()).sender,(tempq.top()).SEQ);
		tempq.pop();
	}
	printf("\n");
}