1 /* Find near-matches for identifiers.
2 Copyright (C) 2015-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #ifndef GCC_SPELLCHECK_TREE_H
21 #define GCC_SPELLCHECK_TREE_H
23 #include "spellcheck.h"
25 /* spellcheck-tree.c */
27 extern edit_distance_t
28 levenshtein_distance (tree ident_s
, tree ident_t
);
31 find_closest_identifier (tree target
, const auto_vec
<tree
> *candidates
);
33 /* Specialization of edit_distance_traits for identifiers. */
36 struct edit_distance_traits
<tree
>
38 static size_t get_length (tree id
)
40 gcc_assert (TREE_CODE (id
) == IDENTIFIER_NODE
);
41 return IDENTIFIER_LENGTH (id
);
44 static const char *get_string (tree id
)
46 gcc_assert (TREE_CODE (id
) == IDENTIFIER_NODE
);
47 return IDENTIFIER_POINTER (id
);
51 #endif /* GCC_SPELLCHECK_TREE_H */