You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
92 lines
3.3 KiB
92 lines
3.3 KiB
/*
|
|
** This module uses code from the NIST implementation of FIPS-181,
|
|
** but the algorythm is CHANGED and I think that I CAN
|
|
** copyright it. See copiright notes below.
|
|
*/
|
|
|
|
/*
|
|
** Copyright (c) 1999, 2000, 2001, 2002, 2003
|
|
** Adel I. Mirzazhanov. All rights reserved
|
|
**
|
|
** Redistribution and use in source and binary forms, with or without
|
|
** modification, are permitted provided that the following conditions
|
|
** are met:
|
|
**
|
|
** 1.Redistributions of source code must retain the above copyright notice,
|
|
** this list of conditions and the following disclaimer.
|
|
** 2.Redistributions in binary form must reproduce the above copyright
|
|
** notice, this list of conditions and the following disclaimer in the
|
|
** documentation and/or other materials provided with the distribution.
|
|
** 3.The name of the author may not be used to endorse or promote products
|
|
** derived from this software without specific prior written permission.
|
|
**
|
|
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
|
|
** OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
** WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
|
** DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
|
|
** GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
** INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
** NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
** SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
|
|
#ifndef APG_PRONPASS_H
|
|
#define APG_PRONPASS_H 1
|
|
|
|
#ifndef APG_OWN_TYPES_H
|
|
#include "owntypes.h"
|
|
#endif /* APG_OWN_TYPES_H */
|
|
|
|
//#ifndef APG_RND_H
|
|
//#include "rnd.h"
|
|
//#endif /* APG_RND_H */
|
|
|
|
#define RULE_SIZE (sizeof(rules)/sizeof(struct unit))
|
|
#define ALLOWED(flag) (digram[units_in_syllable[current_unit -1]][unit] & (flag))
|
|
|
|
#define MAX_UNACCEPTABLE 20
|
|
#define MAX_RETRIES (4 * (int) pwlen + RULE_SIZE)
|
|
|
|
#define NOT_BEGIN_SYLLABLE 010
|
|
#define NO_FINAL_SPLIT 04
|
|
#define VOWEL 02
|
|
#define ALTERNATE_VOWEL 01
|
|
#define NO_SPECIAL_RULE 0
|
|
|
|
#define BEGIN 0200
|
|
#define NOT_BEGIN 0100
|
|
#define BREAK 040
|
|
#define PREFIX 020
|
|
#define ILLEGAL_PAIR 010
|
|
#define SUFFIX 04
|
|
#define END 02
|
|
#define NOT_END 01
|
|
#define ANY_COMBINATION 0
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
extern int gen_pron_pass (char *word, char *hyphenated_word, USHORT minlen,
|
|
USHORT maxlen, unsigned int pass_mode);
|
|
|
|
USHORT random_unit (USHORT type);
|
|
USHORT get_random (USHORT minlen, USHORT maxlen);
|
|
boolean have_initial_y (USHORT *units, USHORT unit_size);
|
|
boolean illegal_placement (USHORT *units, USHORT pwlen);
|
|
boolean improper_word (USHORT *units, USHORT word_size);
|
|
boolean have_final_split (USHORT *units, USHORT unit_size);
|
|
int gen_word (char *word, char *hyphenated_word, USHORT pwlen,
|
|
unsigned int pass_mode);
|
|
char *gen_syllable(char *syllable, USHORT pwlen, USHORT *units_in_syllable,
|
|
USHORT *syllable_length);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* APG_PRONPASS_H */
|
|
|