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
|
/* $calcurse: apoint.h,v 1.5 2007/02/24 17:35:00 culot Exp $ */
/*
* Calcurse - text-based organizer
* Copyright (c) 2004-2007 Frederic Culot
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*
* Send your feedback or comments to : calcurse@culot.org
* Calcurse home page : http://culot.org/calcurse
*
*/
#ifndef CALCURSE_APOINT_H
#define CALCURSE_APOINT_H
#include <ncurses.h>
#include "notify.h"
#define HRMIN_SIZE 6
#define MESG_MAXSIZE 256
#define APOINT_NULL 0x0
#define APOINT_NOTIFY 0x1 /* Item needs to be notified */
#define APOINT_NOTIFIED 0x2 /* Item was already notified */
typedef struct apoint_llist_node {
struct apoint_llist_node *next;
long start; /* seconds since 1 jan 1970 */
long dur; /* duration of the appointment in seconds */
char state; /* 8 bits to store item state */
char *mesg;
} apoint_llist_node_t;
typedef struct apoint_llist {
apoint_llist_node_t *root;
pthread_mutex_t mutex;
} apoint_llist_t;
extern apoint_llist_t *alist_p;
int apoint_llist_init(void);
apoint_llist_node_t *apoint_new(char *, long, long, char state);
unsigned apoint_inday(apoint_llist_node_t *o, long start);
void apoint_sec2str(apoint_llist_node_t *o,
int type, long day, char *start, char *end);
void apoint_write(apoint_llist_node_t *o, FILE * f);
apoint_llist_node_t *apoint_scan(FILE * f, struct tm start, struct tm end,
char state);
void apoint_delete_bynum(long start, unsigned num);
void display_item_date(WINDOW *win, int color, apoint_llist_node_t *i,
int type, long date, int y, int x);
int get_item_line(int item_nb, int nb_events_inday);
void scroll_pad_down(int item_nb, int nb_events_inday, int win_length);
void scroll_pad_up(int item_nb, int nb_events_inday);
struct notify_app_s *apoint_check_next(struct notify_app_s *app, long start);
apoint_llist_node_t *apoint_recur_s2apoint_s(recur_apoint_llist_node_t *p);
void apoint_switch_notify(int year, int month, int day, int item_num);
#endif /* CALCURSE_APOINT_H */
|
