Remove list.ha and refactor scrolllist

1 files changed, 6 insertions, 6 deletions

diff --git a/cmd/il.ha b/cmd/il.ha
index e0b5f3a..4e611da 100644
--- a/cmd/il.ha
+++ b/cmd/il.ha
@@ -80,18 +80,18 @@ export fn main() void = {
 
 	const state = tui::init()!;
 	defer tui::finish(&state);
-	//let li = list::newscrolllist(
+	//let li = list::newlist(
 	//	&state,
 	//	(1, 1),
 	//	void,
 	//	&list::DEFAULTSTYLE,
 	//	items...
 	//)!;
-	let li = list::newscrolllist(
+	let li = list::newlist(
 		&state,
 		(1, 1),
 		void,
-		&list::liststyle {
+		&list::style {
 			style = &widget::style {
 				border = border,
 			},
@@ -168,7 +168,7 @@ export fn main() void = {
 	};
 };
 
-fn search(state: *tui::tui, li: *list::scrolllist, prefix: (str | rune) = '/') (str | void) = {
+fn search(state: *tui::tui, li: *list::list, prefix: (str | rune) = '/') (str | void) = {
 	tui::unraw(state);
 	defer tui::raw(state)!;
 	fmt::fprint(state.out, prefix)!;
@@ -182,7 +182,7 @@ fn search(state: *tui::tui, li: *list::scrolllist, prefix: (str | rune) = '/') (
 	return strings::dup(strings::fromutf8(uline)!);
 };
 
-fn nextsearch(li: *list::scrolllist, term: (str | void)) void = {
+fn nextsearch(li: *list::list, term: (str | void)) void = {
 	const term = match (term) {
 	case let term: str =>
 		yield term;
@@ -197,7 +197,7 @@ fn nextsearch(li: *list::scrolllist, term: (str | void)) void = {
 	};
 };
 
-fn prevsearch(li: *list::scrolllist, term: (str | void)) void = {
+fn prevsearch(li: *list::list, term: (str | void)) void = {
 	const term = match (term) {
 	case let term: str =>
 		yield term;