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
|
/**
* Copyright (c) 2007-2012, Timothy Stack
*
* 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.
* * Neither the name of Timothy Stack nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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 "config.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "listview_curses.hh"
using namespace std;
static listview_curses lv;
class my_source : public list_data_source {
public:
my_source() : ms_rows(2) { };
size_t listview_rows(const listview_curses &lv) {
return this->ms_rows;
};
void listview_value_for_row(const listview_curses &lv,
vis_line_t row,
attr_line_t &value_out) {
if (row == 0) {
value_out = "Hello";
}
else if (row == 1) {
value_out = "World!";
}
else if (row < this->ms_rows) {
char buffer[32];
snprintf(buffer, sizeof(buffer), "%d", (int)row);
value_out = string(buffer);
}
else {
assert(0);
}
};
size_t listview_size_for_row(const listview_curses &lv, vis_line_t row) {
return 100;
};
bool attrline_next_token(const view_curses &vc,
int line,
struct line_range &lr,
int &attrs_out) {
return false;
};
int ms_rows;
};
int main(int argc, char *argv[])
{
int c, retval = EXIT_SUCCESS;
bool wait_for_input = false;
my_source ms;
WINDOW *win;
win = initscr();
lv.set_data_source(&ms);
lv.set_window(win);
noecho();
while ((c = getopt(argc, argv, "y:t:l:r:h:w")) != -1) {
switch (c) {
case 'y':
lv.set_y(atoi(optarg));
break;
case 'h':
lv.set_height(vis_line_t(atoi(optarg)));
break;
case 't':
lv.set_top(vis_line_t(atoi(optarg)));
break;
case 'l':
lv.set_left(atoi(optarg));
break;
case 'w':
wait_for_input = true;
break;
case 'r':
ms.ms_rows = atoi(optarg);
break;
}
}
lv.do_update();
refresh();
if (wait_for_input)
getch();
endwin();
return retval;
}
|
