16:29 Jan Beich (jbeich) 

devel/tllist: update to 1.1.0

Changes:	https://codeberg.org/dnkl/tllist/releases/tag/1.1.0
Reported by:	upstream (via email)

    f661aa8

22:37 jbeich 

devel/tllist: update to 1.0.5

Changes:	https://codeberg.org/dnkl/tllist/releases/tag/1.0.5
Reported by:	Repology

 

18:34 jbeich 

devel/tllist: update to 1.0.4

- Take maintainership
- Make distfile more unique
- Define LICENSE_FILE
- Allow GNU extensions to C99 for better compatibility
- Remove excessive newlines
- Simplify PLIST_FILES via PORTNAME

Changes:	https://codeberg.org/dnkl/tllist/releases/tag/1.0.3
Changes:	https://codeberg.org/dnkl/tllist/releases/tag/1.0.4
PR:		251998
Approved by:	Alexander Sieg <ports@xanderio.de> (previous maintainer)

 

11:27 fernape 

devel/tllist: update to 1.0.2

From ChangeLog: https://codeberg.org/dnkl/tllist/releases/tag/1.0.2

 * LICENSE and README.md are now installed to ${datadir}/doc/tllist
 * PKBUILD now indicates support for aarch64
 * Bad year in LICENSE fixed

PR:	248406
Submitted by:	ports@xanderio.de (maintainer)

 

21:46 salvadore 

Most C implementations of linked list are untyped. That is, their data carriers
are typically void *. This is error prone since your compiler will not be able
to help you correct your mistakes (oh, was it a pointer-to-a-pointer... I
thought it was just a pointer...).

tllist addresses this by using pre-processor macros to implement dynamic types,
where the data carrier is typed to whatever you want; both primitive data types
are supported as well as aggregated ones such as structs, enums and unions.

Being a double-linked list, most operations are constant in time (including
pushing and popping both to/from front and back).

The memory overhead is fairly small; each item carries, besides its data, a
prev and next pointer (i.e. a constant 16 byte overhead per item on 64-bit
architectures).

(Only the first 15 lines of the commit message are shown above )