p
/
sdn
1
1
Fork 0
Code Issues 2 Pull Requests Releases Wiki Activity

Compare commits

base: p:4d6999c41563860fbc5a4c03dc6b1720a26ee5ee
Branches Tags
p:master
...
compare: p:acb187c6b17429dfaddbb05d88cffc3b629dc1a2
Branches Tags
p:master

2 Commits
4d6999c415 ... acb187c6b1

Author SHA1 Message Date
Přemysl Eric Janouch acb187c6b1
README.adoc: update package information 2023-07-01 21:58:29 +02:00
Přemysl Eric Janouch 9427df62e7
Fix code formatting, bump copyright years 2023-06-12 14:00:58 +02:00
3 changed files with 9 additions and 7 deletions
Show Stats Expand all files Collapse all files

2
LICENSE
View File

@ -1,4 +1,4 @@
Copyright (c) 2017 - 2022, Přemysl Eric Janouch <p@janouch.name>
Copyright (c) 2017 - 2023, Přemysl Eric Janouch <p@janouch.name>
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted.

6
README.adoc
View File

@ -18,8 +18,10 @@ image::sdn.png[align="center"]
Packages
--------
Regular releases are sporadic. git master should be stable enough. You can get
a package with the latest development version from Archlinux's AUR.
Regular releases are sporadic. git master should be stable enough.
You can get a package with the latest development version using Arch Linux's
https://aur.archlinux.org/packages/sdn-git[AUR],
or as a https://git.janouch.name/p/nixexprs[Nix derivation].
Building
--------

8
sdn.cpp
View File

@ -1,7 +1,7 @@
//
// sdn: simple directory navigator
//
// Copyright (c) 2017 - 2022, Přemysl Eric Janouch <p@janouch.name>
// Copyright (c) 2017 - 2023, Přemysl Eric Janouch <p@janouch.name>
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted.
@ -495,7 +495,7 @@ static const char *g_ls_colors[] = {LS(XX)};
struct stringcaseless {
bool operator () (const string &a, const string &b) const {
const auto &c = locale::classic();
const auto &c = locale::classic ();
return lexicographical_compare (begin (a), end (a), begin (b), end (b),
[&](char m, char n) { return tolower (m, c) < tolower (n, c); });
}
@ -872,7 +872,7 @@ fun reload (bool keep_anchor) {
show_message (strerror (errno));
if (g.cwd != "/") {
struct dirent f = {};
strncpy(f.d_name, "..", sizeof f.d_name);
strncpy (f.d_name, "..", sizeof f.d_name);
f.d_type = DT_DIR;
g.entries.push_back (make_entry (&f));
}
@ -1036,7 +1036,7 @@ fun show_help () {
fun match (const wstring &needle, int push) -> int {
string pattern = to_mb (needle) + "*";
bool jump_to_first = push || fnmatch (pattern.c_str(),
bool jump_to_first = push || fnmatch (pattern.c_str (),
g.entries[g.cursor].filename.c_str (), 0) == FNM_NOMATCH;
int best = g.cursor, matches = 0, step = push + !push;
for (int i = 0, count = g.entries.size (); i < count; i++) {