summaryrefslogtreecommitdiff
path: root/key_value_storage.c
blob: 7f4b5845585122718582b64f860d75f6bde967f1 (plain)
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
 *  rhctl
 *
 *  Copyright (C) 2009 Christian Pointner <equinox@spreadspace.org>
 *
 *  This file is part of rhctl.
 *
 *  rhctl is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  any later version.
 *
 *  rhctl is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with rhctl. If not, see <http://www.gnu.org/licenses/>.
 */

#include <stdio.h>
#include <string.h>

#include "key_value_storage.h"

void key_value_storage_init(key_value_storage_t* stor)
{
  if(!stor)
    return;

  string_list_init(&(stor->keys_));
  string_list_init(&(stor->values_));
}

void key_value_storage_clear(key_value_storage_t* stor)
{
  if(!stor)
    return;

  string_list_clear(&(stor->keys_));
  string_list_clear(&(stor->values_));
}

int key_value_storage_add(key_value_storage_t* stor, const char* key, const char* value)
{
  if(!stor || !key || !value)
    return -1;

  int ret = string_list_add(&(stor->keys_), key);
  if(ret!=0) 
    return ret;

  ret = string_list_add(&(stor->values_), value);
  if(ret!=0) 
    return ret;

  return 0;
}

char* key_value_storage_find(key_value_storage_t* stor, const char* key)
{
  if(!stor || !key)
    return NULL;

  string_list_element_t* k = stor->keys_.first_;
  string_list_element_t* v = stor->values_.first_;
  while(v && k) {
    if(!strcmp(k->string_, key))
      return v->string_;
    
    k = k->next_;
    v = v->next_;
  }

  return NULL;
}

void key_value_storage_print(key_value_storage_t* stor, const char* head, const char* sep, const char* tail)
{
  if(!stor)
    return;

  string_list_element_t* k = stor->keys_.first_;
  string_list_element_t* v = stor->values_.first_;
  while(v && k) {
    printf("%s%s%s%s%s", head, k->string_, sep, v->string_, tail);
    k = k->next_;
    v = v->next_;
  }
  printf("\n");
}