/*************************************************************************//* *//* Language Technologies Institute *//* Carnegie Mellon University *//* Copyright (c) 2001 *//* All Rights Reserved. *//* *//* Permission is hereby granted, free of charge, to use and distribute *//* this software and its documentation without restriction, including *//* without limitation the rights to use, copy, modify, merge, publish, *//* distribute, sublicense, and/or sell copies of this work, and to *//* permit persons to whom this work is furnished to do so, subject to *//* the following conditions: *//* 1. The code must retain the above copyright notice, this list of *//* conditions and the following disclaimer. *//* 2. Any modifications must be clearly marked as such. *//* 3. Original authors' names are not deleted. *//* 4. The authors' names are not used to endorse or promote products *//* derived from this software without specific prior written *//* permission. *//* *//* CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK *//* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING *//* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT *//* SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE *//* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES *//* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN *//* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, *//* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF *//* THIS SOFTWARE. *//* *//*************************************************************************//* Author: Alan W Black (awb@cs.cmu.edu) *//* Date: January 2001 *//*************************************************************************//* *//* Without a real garbage collector we need some basic constant val *//* to avoid having to create them on the fly *//* *//*************************************************************************/#include "cst_val.h"#include "cst_features.h"#include "cst_string.h" DEF_CONST_VAL_STRING(val_string_0,"0");DEF_CONST_VAL_STRING(val_string_1,"1");DEF_CONST_VAL_STRING(val_string_2,"2");DEF_CONST_VAL_STRING(val_string_3,"3");DEF_CONST_VAL_STRING(val_string_4,"4");DEF_CONST_VAL_STRING(val_string_5,"5");DEF_CONST_VAL_STRING(val_string_6,"6");DEF_CONST_VAL_STRING(val_string_7,"7");DEF_CONST_VAL_STRING(val_string_8,"8");DEF_CONST_VAL_STRING(val_string_9,"9");DEF_CONST_VAL_STRING(val_string_10,"10");DEF_CONST_VAL_STRING(val_string_11,"11");DEF_CONST_VAL_STRING(val_string_12,"12");DEF_CONST_VAL_STRING(val_string_13,"13");DEF_CONST_VAL_STRING(val_string_14,"14");DEF_CONST_VAL_STRING(val_string_15,"15");DEF_CONST_VAL_STRING(val_string_16,"16");DEF_CONST_VAL_STRING(val_string_17,"17");DEF_CONST_VAL_STRING(val_string_18,"18");DEF_CONST_VAL_STRING(val_string_19,"19");DEF_CONST_VAL_STRING(val_string_20,"20");DEF_CONST_VAL_STRING(val_string_21,"21");DEF_CONST_VAL_STRING(val_string_22,"22");DEF_CONST_VAL_STRING(val_string_23,"23");DEF_CONST_VAL_STRING(val_string_24,"24"); DEF_CONST_VAL_INT(val_int_0,0);DEF_CONST_VAL_INT(val_int_1,1);DEF_CONST_VAL_INT(val_int_2,2);DEF_CONST_VAL_INT(val_int_3,3);DEF_CONST_VAL_INT(val_int_4,4);DEF_CONST_VAL_INT(val_int_5,5);DEF_CONST_VAL_INT(val_int_6,6);DEF_CONST_VAL_INT(val_int_7,7);DEF_CONST_VAL_INT(val_int_8,8);DEF_CONST_VAL_INT(val_int_9,9);DEF_CONST_VAL_INT(val_int_10,10);DEF_CONST_VAL_INT(val_int_11,11);DEF_CONST_VAL_INT(val_int_12,12);DEF_CONST_VAL_INT(val_int_13,13);DEF_CONST_VAL_INT(val_int_14,14);DEF_CONST_VAL_INT(val_int_15,15);DEF_CONST_VAL_INT(val_int_16,16);DEF_CONST_VAL_INT(val_int_17,17);DEF_CONST_VAL_INT(val_int_18,18);DEF_CONST_VAL_INT(val_int_19,19);DEF_CONST_VAL_INT(val_int_20,20);DEF_CONST_VAL_INT(val_int_21,21);DEF_CONST_VAL_INT(val_int_22,22);DEF_CONST_VAL_INT(val_int_23,23);DEF_CONST_VAL_INT(val_int_24,24); static const int val_int_const_max = 25;static const cst_val * const val_int_const [] = { VAL_INT_0, VAL_INT_1, VAL_INT_2, VAL_INT_3, VAL_INT_4, VAL_INT_5, VAL_INT_6, VAL_INT_7, VAL_INT_8, VAL_INT_9, VAL_INT_10, VAL_INT_11, VAL_INT_12, VAL_INT_13, VAL_INT_14, VAL_INT_15, VAL_INT_16, VAL_INT_17, VAL_INT_18, VAL_INT_19, VAL_INT_20, VAL_INT_21, VAL_INT_22, VAL_INT_23, VAL_INT_24}; static const cst_val * const val_string_const [] = { VAL_STRING_0, VAL_STRING_1, VAL_STRING_2, VAL_STRING_3, VAL_STRING_4, VAL_STRING_5, VAL_STRING_6, VAL_STRING_7, VAL_STRING_8, VAL_STRING_9, VAL_STRING_10, VAL_STRING_11, VAL_STRING_12, VAL_STRING_13, VAL_STRING_14, VAL_STRING_15, VAL_STRING_16, VAL_STRING_17, VAL_STRING_18, VAL_STRING_19, VAL_STRING_20, VAL_STRING_21, VAL_STRING_22, VAL_STRING_23, VAL_STRING_24}; const cst_val *val_int_n(int n){ if (n < val_int_const_max) return val_int_const[n]; else return val_int_const[val_int_const_max-1];} /* carts are pretty confused about strings/ints, and some features *//* are actually used as floats and as int/strings */const cst_val *val_string_n(int n){ if (n < 0) return val_string_const[0]; else if (n < val_int_const_max) /* yes I mean *int*, its the table size */ return val_string_const[n]; else return val_string_const[val_int_const_max-1];} #if 0/* This technique isn't thread safe, so I replaced it with val_consts */static cst_features *val_string_consts = NULL; const cst_val *val_string_x(const char *n){ const cst_val *v; /* *BUG* This will have to be fixed soon */ if (val_string_consts == NULL) val_string_consts = new_features(); v = feat_val(val_string_consts,n); if (v) return v; else { feat_set_string(val_string_consts,n,n); return feat_val(val_string_consts,n); }}#endif
/*************************************************************************/
/* */
/* Language Technologies Institute */
/* Carnegie Mellon University */
/* Copyright (c) 2001 */
/* All Rights Reserved. */
/* */
/* Permission is hereby granted, free of charge, to use and distribute */
/* this software and its documentation without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, and/or sell copies of this work, and to */
/* permit persons to whom this work is furnished to do so, subject to */
/* the following conditions: */
/* 1. The code must retain the above copyright notice, this list of */
/* conditions and the following disclaimer. */
/* 2. Any modifications must be clearly marked as such. */
/* 3. Original authors' names are not deleted. */
/* 4. The authors' names are not used to endorse or promote products */
/* derived from this software without specific prior written */
/* permission. */
/* */
/* CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK */
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
/* SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE */
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
/* THIS SOFTWARE. */
/* */
/*************************************************************************/
/* Author: Alan W Black (awb@cs.cmu.edu) */
/* Date: January 2001 */
/*************************************************************************/
/* */
/* Without a real garbage collector we need some basic constant val */
/* to avoid having to create them on the fly */
/* */
/*************************************************************************/
#include "cst_val.h"
#include "cst_features.h"
#include "cst_string.h"
DEF_CONST_VAL_STRING(val_string_0,"0");
DEF_CONST_VAL_STRING(val_string_1,"1");
DEF_CONST_VAL_STRING(val_string_2,"2");
DEF_CONST_VAL_STRING(val_string_3,"3");
DEF_CONST_VAL_STRING(val_string_4,"4");
DEF_CONST_VAL_STRING(val_string_5,"5");
DEF_CONST_VAL_STRING(val_string_6,"6");
DEF_CONST_VAL_STRING(val_string_7,"7");
DEF_CONST_VAL_STRING(val_string_8,"8");
DEF_CONST_VAL_STRING(val_string_9,"9");
DEF_CONST_VAL_STRING(val_string_10,"10");
DEF_CONST_VAL_STRING(val_string_11,"11");
DEF_CONST_VAL_STRING(val_string_12,"12");
DEF_CONST_VAL_STRING(val_string_13,"13");
DEF_CONST_VAL_STRING(val_string_14,"14");
DEF_CONST_VAL_STRING(val_string_15,"15");
DEF_CONST_VAL_STRING(val_string_16,"16");
DEF_CONST_VAL_STRING(val_string_17,"17");
DEF_CONST_VAL_STRING(val_string_18,"18");
DEF_CONST_VAL_STRING(val_string_19,"19");
DEF_CONST_VAL_STRING(val_string_20,"20");
DEF_CONST_VAL_STRING(val_string_21,"21");
DEF_CONST_VAL_STRING(val_string_22,"22");
DEF_CONST_VAL_STRING(val_string_23,"23");
DEF_CONST_VAL_STRING(val_string_24,"24");
DEF_CONST_VAL_INT(val_int_0,0);
DEF_CONST_VAL_INT(val_int_1,1);
DEF_CONST_VAL_INT(val_int_2,2);
DEF_CONST_VAL_INT(val_int_3,3);
DEF_CONST_VAL_INT(val_int_4,4);
DEF_CONST_VAL_INT(val_int_5,5);
DEF_CONST_VAL_INT(val_int_6,6);
DEF_CONST_VAL_INT(val_int_7,7);
DEF_CONST_VAL_INT(val_int_8,8);
DEF_CONST_VAL_INT(val_int_9,9);
DEF_CONST_VAL_INT(val_int_10,10);
DEF_CONST_VAL_INT(val_int_11,11);
DEF_CONST_VAL_INT(val_int_12,12);
DEF_CONST_VAL_INT(val_int_13,13);
DEF_CONST_VAL_INT(val_int_14,14);
DEF_CONST_VAL_INT(val_int_15,15);
DEF_CONST_VAL_INT(val_int_16,16);
DEF_CONST_VAL_INT(val_int_17,17);
DEF_CONST_VAL_INT(val_int_18,18);
DEF_CONST_VAL_INT(val_int_19,19);
DEF_CONST_VAL_INT(val_int_20,20);
DEF_CONST_VAL_INT(val_int_21,21);
DEF_CONST_VAL_INT(val_int_22,22);
DEF_CONST_VAL_INT(val_int_23,23);
DEF_CONST_VAL_INT(val_int_24,24);
static const int val_int_const_max = 25;
static const cst_val * const val_int_const [] = {
VAL_INT_0,
VAL_INT_1,
VAL_INT_2,
VAL_INT_3,
VAL_INT_4,
VAL_INT_5,
VAL_INT_6,
VAL_INT_7,
VAL_INT_8,
VAL_INT_9,
VAL_INT_10,
VAL_INT_11,
VAL_INT_12,
VAL_INT_13,
VAL_INT_14,
VAL_INT_15,
VAL_INT_16,
VAL_INT_17,
VAL_INT_18,
VAL_INT_19,
VAL_INT_20,
VAL_INT_21,
VAL_INT_22,
VAL_INT_23,
VAL_INT_24};
static const cst_val * const val_string_const [] = {
VAL_STRING_0,
VAL_STRING_1,
VAL_STRING_2,
VAL_STRING_3,
VAL_STRING_4,
VAL_STRING_5,
VAL_STRING_6,
VAL_STRING_7,
VAL_STRING_8,
VAL_STRING_9,
VAL_STRING_10,
VAL_STRING_11,
VAL_STRING_12,
VAL_STRING_13,
VAL_STRING_14,
VAL_STRING_15,
VAL_STRING_16,
VAL_STRING_17,
VAL_STRING_18,
VAL_STRING_19,
VAL_STRING_20,
VAL_STRING_21,
VAL_STRING_22,
VAL_STRING_23,
VAL_STRING_24};
const cst_val *val_int_n(int n)
{
if (n < val_int_const_max)
return val_int_const[n];
else
return val_int_const[val_int_const_max-1];
}
/* carts are pretty confused about strings/ints, and some features */
/* are actually used as floats and as int/strings */
const cst_val *val_string_n(int n)
{
if (n < 0)
return val_string_const[0];
else if (n < val_int_const_max) /* yes I mean *int*, its the table size */
return val_string_const[n];
else
return val_string_const[val_int_const_max-1];
}
#if 0
/* This technique isn't thread safe, so I replaced it with val_consts */
static cst_features *val_string_consts = NULL;
const cst_val *val_string_x(const char *n)
{
const cst_val *v;
/* *BUG* This will have to be fixed soon */
if (val_string_consts == NULL)
val_string_consts = new_features();
v = feat_val(val_string_consts,n);
if (v)
return v;
else
{
feat_set_string(val_string_consts,n,n);
return feat_val(val_string_consts,n);
}
}
#endif