aboutsummaryrefslogtreecommitdiff
path: root/doc/remembering.5
blob: 9404225ec6560a2fda5ae5bb16b047b99208ab0f (plain) (blame)
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
.TH REMEMBERING 5 @DATE@ "remembering @VERSION@"
.
.
.SH NAME
remembering - format of \fIPROFILE\fB text file.
.
.
.SH PROFILE
The \fIPROFILE\fR is a text file, stored on $XDG_DATA_HOME/profile-name
if $XDG_DATA_HOME is defined.
Otherwise, it lives in ~/.local/share/remembering/profile-name.
.P
Each line of the \fIPROFILE\fR contains two pieces of information: the \fBrank\fR of the current entry, and the \fBentry\fR itself.
.
.P
The \fBrank\fR is a number that, and the \fBentry\fR is all the text until the end of the line:

.nf
	0:an entry
	0:banana
	0:entry
	0:something
	0:zzz
.fi
.P
Above is an example of a \fIPROFILE\fR file where all the entries have the default
\fBrank\fR value: \fB0\fR.
.P
If the \fICOMMAND\fR runs and chooses "banana", the new \fIPROFILE\fR will be:

.nf
	0:an entry
	1:banana
	0:entry
	0:something
	0:zzz
.fi
.P
The entries of the \fIPROFILE\fR are created and kept sorted.
\fBremembering\fR(1) expects to always find sorted entries in the \fIPROFILE\fR.
.P
The current raking algorithm increments entries as a simple counter.
Every time an entry is picked, its ranked is incremented in the \fIPROFILE\fR.
.
.
.SH SEE ALSO
.P
\fBremembering\fR(1)
.
.
.SH AUTHORS
.P
.MT eu@euandre.org
EuAndreh
.ME
and contributors.
.
.
.SH BUGS
Report bugs to the
.MT ~euandreh/public-inbox@lists.sr.ht
mailing list
.ME .
.br
Browse bugs
.UR https://euandreh.xyz/remembering/TODOs.html
online
.UE .
.br
.UR https://euandreh.xyz/remembering/
Home page
.UE .
.br
.UR https://lists.sr.ht/~euandreh/public-inbox?search=[remembering]
Comments and discussions
.UE .