p
/
tdv
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity
tdv/src/utils.h

46 lines
2.0 KiB
C
Raw Normal View History

Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
/*
* utils.h: miscellaneous utilities
*
tools: clean up error message printing
2020-09-03 23:54:12 +02:00
* Copyright (c) 2013 - 2020, Přemysl Eric Janouch <p@janouch.name>
Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
*
* Permission to use, copy, modify, and/or distribute this software for any
Relicense to 0BSD, update mail address I've come to the conclusion that copyright mostly just stands in the way of software development. In my jurisdiction I cannot give up my own copyright and 0BSD seems to be the closest thing to public domain. The updated mail address, also used in my author/committer lines, is shorter and looks nicer. People rarely interact anyway.
2018-06-24 05:23:31 +02:00
* purpose with or without fee is hereby granted.
Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#ifndef UTILS_H
#define UTILS_H
Formatting
2015-02-26 23:26:52 +01:00
/// After this statement, the element has been found and its index is stored
/// in the variable "imid".
Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
#define BINARY_SEARCH_BEGIN(max, compare) \
gint imin = 0, imax = max, imid; \
while (imin <= imax) { \
imid = imin + (imax - imin) / 2; \
gint cmp = compare; \
if (cmp > 0) imin = imid + 1; \
else if (cmp < 0) imax = imid - 1; \
else {
Formatting
2015-02-26 23:26:52 +01:00
/// After this statement, the binary search has failed and "imin" stores
/// the position where the element can be inserted.
Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
#define BINARY_SEARCH_END \
} \
}
gboolean stream_read_all (GByteArray *ba, GInputStream *is, GError **error);
gchar *stream_read_string (GDataInputStream *dis, GError **error);
Make more use of xstrtoul()
2015-02-07 22:10:43 +01:00
gboolean xstrtoul (unsigned long *out, const char *s, int base);
Avoid flicker while resizing
2014-10-15 00:51:05 +02:00
void update_curses_terminal_size (void);
tools: clean up error message printing
2020-09-03 23:54:12 +02:00
void fatal (const gchar *format, ...) G_GNUC_PRINTF (1, 2) G_GNUC_NORETURN;
Add a class to handle dictzip files Provides pseudo-random access to dictionary files compressed using dictzip. It doesn't implement a cache, it just loads missing chunks until it has the whole file. I'm not sure if discarding not recently used chunks is really a useful feature. If there _was_ a way to get noticed when system memory is low, I think the best way to handle that event would be to simply release it all. All in all, this is pretty useless. But it was interesting to write. This has yet to be integrated into the application proper.
2013-07-14 20:40:58 +02:00
Formatting
2015-02-26 23:26:52 +01:00
#endif // ! UTILS_H