aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPřemysl Eric Janouch <p@janouch.name>2023-06-12 14:00:58 +0200
committerPřemysl Eric Janouch <p@janouch.name>2023-06-12 14:00:58 +0200
commit9427df62e7f51ee3d2e089423979fbbcc5232fe5 (patch)
treeb5a463be9f93a732b59904e0dca79c50dbb81910
parent4d6999c41563860fbc5a4c03dc6b1720a26ee5ee (diff)
downloadsdn-9427df62e7f51ee3d2e089423979fbbcc5232fe5.tar.gz
sdn-9427df62e7f51ee3d2e089423979fbbcc5232fe5.tar.xz
sdn-9427df62e7f51ee3d2e089423979fbbcc5232fe5.zip
Fix code formatting, bump copyright years
-rw-r--r--LICENSE2
-rw-r--r--sdn.cpp8
2 files changed, 5 insertions, 5 deletions
diff --git a/LICENSE b/LICENSE
index 6448106..75713d6 100644
--- a/LICENSE
+++ b/LICENSE
@@ -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.
diff --git a/sdn.cpp b/sdn.cpp
index da907d7..b8191a8 100644
--- a/sdn.cpp
+++ b/sdn.cpp
@@ -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++) {