gnulib - GNU portability library - Summary
This software is part of the GNU Project.
Gnulib is intended to be the canonical source for most of the important "portability" and/or common files for GNU projects. These are files intended to be shared at the source level; Gnulib is not a library meant to be installed and linked against.
While portability across operating systems is not one of GNU's primary goals, it has helped introduce many people to the GNU system, and is worthwhile when it can be achieved at a low cost. This collection helps lower that cost.
There is no distribution tarball; developers should just grab source files from the repository. Please see <http://www.gnu.org/software/gnulib/> for more details.
Registration Date: Wed 17 Oct 2001 05:49:50 PM UTC
License: GNU General Public License v2 or later
Development Status: 5 - Production/Stable
posted by haible, Sun 20 Nov 2022 04:27:43 PM UTC - 0 replies
Spawning a new process has traditionally been coded by a fork() call, followed by an execv/execl/execlp/execvp call in the child process. This is often referred to as the fork + exec idiom.
In 90% of the cases, there is something better: the posix_spawn/posix_spawnp functions.
...
[Read more]
posted by akim, Wed 13 Jan 2021 12:17:37 PM UTC - 0 replies
Gnulib features bitset, a module to support operations on lists of bits.
Its API is rich, and includes:
- all the expected operations on single bit (set, toggle, test, etc.);
- all the traditional binary bitwise operators (and, or, xor), often in two flavors (return new values, or perform in place); ...
[Read more]
posted by haible, Wed 30 Dec 2020 03:10:08 PM UTC - 0 replies
There are three main motivations for using multiple threads in a program:
- To get computational tasks done is less time, by using more than one CPU core at once.
- For event handling. The older approach with signals and/or file descriptors in ...
[Read more]
posted by haible, Wed 23 Dec 2020 01:42:02 PM UTC - 0 replies
When writing algorithmic code, the classical approach is to define the data structures, write the algorithm, debug it, and then profile it. It often occurs that you notice that a certain list, set, or map can get large and that this costs CPU time. ...
[Read more]
[Submit News]
[8 news in archive]