about summary refs log tree commit diff
path: root/nixpkgs/pkgs/development/libraries/tllist/default.nix
blob: ed957f95776c8ed014d7834d540bc690615199d1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
{ stdenv
, lib
, fetchFromGitea
, meson
, ninja
}:

stdenv.mkDerivation rec {
  pname = "tllist";
  version = "1.0.5";

  src = fetchFromGitea {
    domain = "codeberg.org";
    owner = "dnkl";
    repo = "tllist";
    rev = version;
    sha256 = "wJEW7haQBtCR2rffKOFyqH3aq0eBr6H8T6gnBs2bNRg=";
  };

  nativeBuildInputs = [ meson ninja ];

  mesonBuildType = "release";

  doCheck = true;

  meta = with lib; {
    homepage = "https://codeberg.org/dnkl/tllist";
    changelog = "https://codeberg.org/dnkl/tllist/releases/tag/${version}";
    description = "C header file only implementation of a typed linked list";
    longDescription = ''
      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.
    '';

    license = licenses.mit;
    maintainers = with maintainers; [ fionera AndersonTorres ];
    platforms = platforms.all;
  };
}