1 /* 2 * Copyright (c) 2004 The DragonFly Project. All rights reserved. 3 * 4 * This code is derived from software contributed to The DragonFly Project 5 * by Chris Pressey <cpressey@catseye.mine.nu>. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in 15 * the documentation and/or other materials provided with the 16 * distribution. 17 * 3. Neither the name of The DragonFly Project nor the names of its 18 * contributors may be used to endorse or promote products derived 19 * from this software without specific, prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, 27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35 /* 36 * test.c 37 * Test some libaura functions. 38 * $Id: test.c,v 1.4 2005/01/06 23:50:17 cpressey Exp $ 39 */ 40 41 #include <stdio.h> 42 43 #include "dict.h" 44 #include "fspred.h" 45 46 int main(int argc, char **argv) 47 { 48 struct aura_dict *d; 49 char k[256], v[256]; 50 void *rv, *rk; 51 size_t rv_len, rk_len; 52 53 d = aura_dict_new(1, AURA_DICT_SORTED_LIST); 54 /* d = aura_dict_new(23, AURA_DICT_HASH); */ 55 56 while (!feof(stdin)) { 57 printf("key> "); 58 fgets(k, 255, stdin); 59 if (strlen(k) > 0) 60 k[strlen(k) - 1] = '\0'; 61 if (k[0] == '?') { 62 printf("%s %s a file\n", &k[1], 63 is_file("%s", &k[1]) ? "IS" : "IS NOT"); 64 } else if (strcmp(k, "@list") == 0) { 65 /* List all values in dictionary. */ 66 aura_dict_rewind(d); 67 while (!aura_dict_eof(d)) { 68 aura_dict_get_current_key(d, &rk, &rk_len), 69 aura_dict_fetch(d, rk, rk_len, &rv, &rv_len); 70 printf("+ %s -> %s\n", (char *)rk, (char *)rv); 71 aura_dict_next(d); 72 } 73 } else { 74 printf("value> "); 75 fgets(v, 255, stdin); 76 if (strlen(v) > 0) 77 v[strlen(v) - 1] = '\0'; 78 aura_dict_fetch(d, k, strlen(k) + 1, &rv, &rv_len); 79 if (rv == NULL) { 80 printf("*NOT FOUND*\n"); 81 } else { 82 printf("%s -> %s\n", k, (char *)rv); 83 } 84 aura_dict_store(d, k, strlen(k) + 1, v, strlen(v) + 1); 85 } 86 } 87 88 aura_dict_free(d); 89 90 return(0); 91 } 92