fzy.git - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Collapse)	Author	Age
...
*	Remove unused and uninitialized worker struct var	John Hawthorn	2017-01-08
\|
*	Fix tty_interface clear for num_lines=0	John Hawthorn	2016-12-28
\|
*	Fix a problem that the cursor position shifted upward	momotaro	2016-12-21
\|
*	Fix segfault when encountering utf-8 characters	John Hawthorn	2016-08-03
\|
*	Add sys/select.h to fix building with musl libc	Duncaen	2016-07-31
\|
*	Add a few missing static declarations	John Hawthorn	2016-07-12
\|
*	Fix segfault when autocompleting on no matches	John Hawthorn	2016-07-12
\|
*	Use macros to help with bonus tables	John Hawthorn	2016-07-12
\|
*	Use standards-compliant lookup table	John Hawthorn	2016-07-12
\|
*	Use a lookup table for precompute_bonuses	John Hawthorn	2016-07-10
\|
*	Use score_t instead of double	John Hawthorn	2016-07-10
\|
*	Don't consider numbers word separators	John Hawthorn	2016-07-10
\| \| \| \| \| \|	This made sense on paper when deciding what was a "word". However in reality this is rarely an indication of a separate word. I've found that this caused hexadecimal or base64 strings to be favoured in matches.
*	Split bonus computation into own method	John Hawthorn	2016-07-10
\|
*	Store result of getopt_long in an int	John Hawthorn	2016-06-22
\| \| \| \|	This fixes issues on ARM, where char is unsigned.
*	Use number of processors as worker count	John Hawthorn	2016-06-22
\| \| \| \| \| \| \|	Since we're dividing the search set equally between processors, we want to run with the same number of workers that we have CPU execution threads. This avoids having a worker which is starved until the end of execution.
*	Store worker_count on choices_t	John Hawthorn	2016-06-22
\|
*	Use threading when matching/scoring	John Hawthorn	2016-06-22
\|
*	Use threading when matching/scoring	John Hawthorn	2016-06-22
\|
*	Change match into if/else	John Hawthorn	2016-06-22
\| \| \| \| \|	This is marginally faster and I still think it reads very well (maybe better).
*	Add tests for exact scores	John Hawthorn	2016-06-22
\| \| \| \|	Preparing for some changes to the match method
*	Batch together input for searches	John Hawthorn	2016-06-22
\|
*	Add pageup and pagedown	John Hawthorn	2016-06-22
\|
*	Use a struct to store keybindings	John Hawthorn	2016-06-22
\|
*	Extract append_search method	John Hawthorn	2016-06-22
\|
*	Move all action into their own functions	John Hawthorn	2016-06-20
\|
*	Track last search	John Hawthorn	2016-06-20
\| \| \| \|	This allows us to avoid explicitly calling out to choices_search
*	Use tty_interface_t to communicate exit	John Hawthorn	2016-06-20
\|
*	Return exit code from run	John Hawthorn	2016-06-20
\|
*	Use tty_interface_t throughout	John Hawthorn	2016-06-19
\|
*	Remove options global variable	John Hawthorn	2016-06-19
\|
*	Store state in tty_interface_t	John Hawthorn	2016-06-19
\|
*	Extract tty interface to own file	John Hawthorn	2016-06-19
\|
*	Ensure options is passed as a pointer	John Hawthorn	2016-06-19
\|
*	Extract option parsing to separate file	John Hawthorn	2016-06-19
\|
*	Remove calculate_score (same as match_positions)	John Hawthorn	2016-06-08
\|
*	Move equality detection within calculate_score	John Hawthorn	2016-06-08
\|
*	Skip sorting on empty search string	John Hawthorn	2016-06-08
\| \| \| \| \| \| \| \| \|	For the empty query, sorting can be the slowest part of the search. Since the empty query gives no scores, and we've now made our sort stable, in this case we can simply skip sorting. A sort of 250000 entries took about ~10ms on my laptop, which is not a huge amount. However it's not 0 and is free to skip.
*	Make sorting stable	John Hawthorn	2016-06-08
\| \| \| \| \|	C's stdlib's qsort isn't a stable sort. We want it to be so that any equivalent matches are stored in the order they came in.
*	Move fzytest into test/ directory	John Hawthorn	2016-05-21
\|
*	Move sources into src directory	John Hawthorn	2016-05-21