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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
// bibiman - a TUI for managing BibLaTeX databases
// Copyright (C) 2024 lukeflo
//
// 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 3 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, see <https://www.gnu.org/licenses/>.
/////
use super::app::App;
use super::tui::Tui;
use crate::backend::search::BibiSearch;
use color_eyre::eyre::Result;
use editor_command::EditorBuilder;
use itertools::Itertools;
use ratatui::widgets::TableState;
use std::process::Command;
impl FromIterator<Vec<String>> for EntryTable {
fn from_iter<T: IntoIterator<Item = Vec<String>>>(iter: T) -> Self {
let entry_table_items = iter
.into_iter()
.sorted()
.map(|i| EntryTableItem::new(&i[0], &i[1], &i[2], &i[3], &i[4], &i[5]))
.collect();
let entry_table_state = TableState::default().with_selected(0);
Self {
entry_table_items,
entry_table_state,
}
}
}
// Define list containing entries as table
#[derive(Debug)]
pub struct EntryTable {
pub entry_table_items: Vec<EntryTableItem>,
pub entry_table_state: TableState,
}
// Define contents of each entry table row
#[derive(Debug)]
pub struct EntryTableItem {
pub authors: String,
pub title: String,
pub year: String,
pub pubtype: String,
pub keywords: String,
pub citekey: String,
}
impl EntryTableItem {
pub fn new(
authors: &str,
title: &str,
year: &str,
pubtype: &str,
keywords: &str,
citekey: &str,
) -> Self {
Self {
authors: authors.to_string(),
title: title.to_string(),
year: year.to_string(),
pubtype: pubtype.to_string(),
keywords: keywords.to_string(),
citekey: citekey.to_string(),
}
}
// This functions decides which fields are rendered in the entry table
// Fields which should be usable but not visible can be left out
pub fn ref_vec(&self) -> Vec<&String> {
vec![&self.authors, &self.title, &self.year, &self.pubtype]
}
pub fn authors(&self) -> &str {
&self.authors
}
pub fn title(&self) -> &str {
&self.title
}
pub fn year(&self) -> &str {
&self.year
}
pub fn pubtype(&self) -> &str {
&self.pubtype
}
pub fn citekey(&self) -> &str {
&self.citekey
}
}
impl App {
// Entry Table commands
// Movement
pub fn select_next_entry(&mut self) {
self.scroll_info = 0;
self.entry_table.entry_table_state.select_next();
}
pub fn select_previous_entry(&mut self) {
self.scroll_info = 0;
self.entry_table.entry_table_state.select_previous();
}
pub fn select_first_entry(&mut self) {
self.scroll_info = 0;
self.entry_table.entry_table_state.select_first();
}
pub fn select_last_entry(&mut self) {
self.scroll_info = 0;
self.entry_table.entry_table_state.select_last();
}
// Get the citekey of the selected entry
pub fn get_selected_citekey(&self) -> &str {
let idx = self.entry_table.entry_table_state.selected().unwrap();
let citekey = &self.entry_table.entry_table_items[idx].citekey;
citekey
}
pub fn run_editor(&mut self, tui: &mut Tui) -> Result<()> {
// get filecontent and citekey for calculating line number
let citekey = self.get_selected_citekey();
let filepath = self.main_biblio.bibfile.display().to_string();
let filecontent = self.main_biblio.bibfilestring.clone();
let mut line_count = 0;
for line in filecontent.lines() {
line_count = line_count + 1;
// if reaching the citekey break the loop
// if reaching end of lines without match, reset to 0
if line.contains(&citekey) {
break;
} else if line_count == filecontent.len() {
eprintln!(
"Citekey {} not found, opening file {} at line 1",
&citekey, &filepath
);
line_count = 0;
break;
}
}
// Exit TUI to enter editor
tui.exit()?;
// Use VISUAL or EDITOR. Set "vi" as last fallback
let mut cmd: Command = EditorBuilder::new()
.environment()
.source(Some("vi"))
.build()
.unwrap();
// Prepare arguments to open file at specific line
let args: Vec<String> = vec![format!("+{}", line_count), filepath];
let status = cmd.args(&args).status()?;
if !status.success() {
eprintln!("Spawning editor failed with status {}", status);
}
// Enter TUI again
tui.enter()?;
tui.terminal.clear()?;
// Update the database and the lists to show changes
self.update_lists();
Ok(())
}
// Search entry list
pub fn search_entries(&mut self) {
let orig_list = {
if self.search_struct.inner_search {
let orig_list = &self.search_struct.filtered_entry_list;
orig_list
} else {
let orig_list = &self.biblio_data.entry_list.bibentries;
orig_list
}
};
let filtered_list =
BibiSearch::search_entry_list(&mut self.search_struct.search_string, orig_list.clone());
//search::search_entry_list(&self.search_string, orig_list.clone());
self.entry_table = EntryTable::from_iter(filtered_list)
}
}
|
