kc3-lang/kc3/libkc3/alist.c

Branch - branch -callablemasterconfigurefnfractionsfractions-rebaselinuxratio-rebasev0.1- tag -v0.1.9v0.1.8v0.1.7v0.1.6v0.1.5v0.1.4v0.1.3v0.1.2v0.1.13v0.1.12v0.1.11v0.1.10v0.1.1v0.1.0v0HTTPd-v0.1.1HTTPd-v0.1.0

• Show log

  Commit

• Hash : 54eeee39
  Author : Thomas de Grivel
  Date : 2024-09-11T01:42:51
  

  alist_access

Download

• libkc3/alist.c

• /* kc3
   * Copyright 2022,2023,2024 kmx.io <contact@kmx.io>
   *
   * Permission is hereby granted to use this software granted the above
   * copyright notice and this permission paragraph are included in all
   * copies and substantial portions of this software.
   *
   * THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
   * PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
   * AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
   * THIS SOFTWARE.
   */
  #include <string.h>
  #include "alist.h"
  #include "alloc.h"
  #include "assert.h"
  #include "array.h"
  #include "buf.h"
  #include "buf_inspect.h"
  #include "buf_parse.h"
  #include "compare.h"
  #include "data.h"
  #include "kc3_main.h"
  #include "list.h"
  #include "sym.h"
  #include "tag.h"
  #include "tuple.h"
  
  s_tag * alist_access (const s_list * const *alist,
                        const s_list * const *key,
                        s_tag *dest)
  {
    const s_tag *first;
    const s_list *next;
    s_tag *r;
    s_tag tag;
    assert(alist);
    assert(key);
    assert(dest);
    if (! list_is_alist(alist)) {
      err_puts("alist_access: not an associative list");
      assert(! "alist_access: not an associative list");
      return NULL;
    }
    first = &(*key)->tag;
    next = list_next(*key);
    if (! next)
      return alist_get(alist, first, dest);
    if (! alist_get(alist, first, &tag)) {
      err_write_1("alist_access: alist_get(");
      err_inspect_list(alist);
      err_write_1(", ");
      err_inspect_tag(first);
      err_write_1(")\n");
      assert(! "alist_access: alist_get");
      return NULL;
    }
    r = kc3_access(&tag, &next, dest);
    tag_clean(&tag);
    return r;
  }
  
  s_tag * alist_get (const s_list * const *alist, const s_tag *key,
                     s_tag *dest)
  {
    const s_list *l;
    assert(alist);
    assert(list_is_alist(alist));
    assert(key);
    assert(dest);
    l = *alist;
    while (l) {
      if (! compare_tag(&l->tag.data.tuple.tag[0], key))
        return tag_init_copy(dest, l->tag.data.tuple.tag + 1);
      l = list_next(l);
    }
    return NULL;
  }
  

Download