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
|
/*
* Aiksaurus - An English-language thesaurus library
* Copyright (C) 2001-2002 by Jared Davis
*
* This program 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 2
* of the License, or (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*
*/
#include "AiksaurusC.h"
#include "Aiksaurus.h"
#include <new>
static Aiksaurus *instance = 0;
int Aiksaurus_init()
{
if (!instance)
instance = new(std::nothrow) Aiksaurus;
return (instance != 0);
}
void Aiksaurus_destroy()
{
delete instance;
instance = 0;
}
const char* Aiksaurus_error()
{
if (instance)
return instance->error();
else
return "Error: Aiksaurus_error() called before Aiksaurus_init()";
}
const char* Aiksaurus_word()
{
return((instance) ? (instance->word()) : (""));
}
int Aiksaurus_find(const char* word)
{
return((instance) ? (instance->find(word)) : (0));
}
const char* Aiksaurus_next(int* meaning)
{
return((instance) ? (instance->next(*meaning)) : (""));
}
const char* Aiksaurus_similar()
{
return((instance) ? (instance->similar()) : (""));
}
|
