mirrors/nano
1
0
Fork 0
mirror of git://git.sv.gnu.org/nano.git synced 2024-11-25 22:29:42 +03:00
Code Issues Packages Projects Releases Wiki Activity

tweaks: improve a couple of comments

Browse Source
This commit is contained in:
Benno Schulenberg 2016-06-02 12:07:08 +02:00
parent 56f067a284
commit 0172cb0e83
1 changed files with 7 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/search.c
View File

@ -1202,8 +1202,8 @@ filestruct *find_history(const filestruct *h_start, const filestruct
return NULL; return NULL;
} }
/* Update a history list. h should be the current position in the /* Update a history list (the one in which h is the current position)
* list. */ * with a fresh string s. That is: add s, or move it to the end. */
void update_history(filestruct **h, const char *s) void update_history(filestruct **h, const char *s)
{ {
filestruct **hage = NULL, **hbot = NULL, *thesame; filestruct **hage = NULL, **hbot = NULL, *thesame;
@ -1220,7 +1220,7 @@ void update_history(filestruct **h, const char *s)
assert(hage != NULL && hbot != NULL); assert(hage != NULL && hbot != NULL);
/* See if this string is already in the history. */ /* See if the string is already in the history. */
thesame = find_history(*hbot, *hage, s, HIGHEST_POSITIVE); thesame = find_history(*hbot, *hage, s, HIGHEST_POSITIVE);
/* If an identical string was found, delete that item. */ /* If an identical string was found, delete that item. */
@ -1235,9 +1235,8 @@ void update_history(filestruct **h, const char *s)
renumber(after); renumber(after);
} }
/* If the history is full, delete the beginning entry to make room /* If the history is full, delete the oldest item (the one at the
* for the new entry at the end. We assume that MAX_SEARCH_HISTORY * head of the list), to make room for a new item at the end. */
* is greater than zero. */
if ((*hbot)->lineno == MAX_SEARCH_HISTORY + 1) { if ((*hbot)->lineno == MAX_SEARCH_HISTORY + 1) {
filestruct *foo = *hage; filestruct *foo = *hage;
@ -1246,13 +1245,13 @@ void update_history(filestruct **h, const char *s)
renumber(*hage); renumber(*hage);
} }
/* Add the new entry to the end. */ /* Store the fresh string in the last item, then create a new item. */
(*hbot)->data = mallocstrcpy((*hbot)->data, s); (*hbot)->data = mallocstrcpy((*hbot)->data, s);
splice_node(*hbot, make_new_node(*hbot)); splice_node(*hbot, make_new_node(*hbot));
*hbot = (*hbot)->next; *hbot = (*hbot)->next;
(*hbot)->data = mallocstrcpy(NULL, ""); (*hbot)->data = mallocstrcpy(NULL, "");
/* Indicate that the history's been changed. */ /* Indicate that the history needs to be saved on exit. */
history_changed = TRUE; history_changed = TRUE;
/* Set the current position in the list to the bottom. */ /* Set the current position in the list to the bottom. */