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