-
Notifications
You must be signed in to change notification settings - Fork 4
/
argsort.cc
41 lines (30 loc) · 665 Bytes
/
argsort.cc
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
#include <cstdlib>
#include <iostream>
#include <unistd.h>
#include "heap.h"
struct node {
const char * value;
node(const char * v) : value(v) { }
lite::heap_link<node> heap_link;
bool
bound() const {
return false
|| heap_link.bound()
;;
}
typedef lite::heap<node, &node::heap_link, typeof(node::value), &node::value> heap_t;
};
int
main(int argc, char* argv[]) {
node::heap_t heap;
for (int i = 1 ; i < argc ; ++i)
heap.inhume(new node(argv[i]));
while (!heap.empty()) {
node* x = heap.exhume();
std::cout << x->value << std::endl;
if (!x->bound())
delete x;
}
return EXIT_SUCCESS;
}
//