1 /*
 2  * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
 3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 4  *
 5  * This code is free software; you can redistribute it and/or modify it
 6  * under the terms of the GNU General Public License version 2 only, as
 7  * published by the Free Software Foundation.
 8  *
 9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  *
23  */
24 
25 #include "precompiled.hpp"
26 #include "utilities/debug.hpp"
27 #include "utilities/stringUtils.hpp"
28 
29 #include <string.h>
30 
31 int StringUtils::replace_no_expand(char* string, const char* from, const char* to) {
32   int replace_count = 0;
33   size_t from_len = strlen(from);
34   size_t to_len = strlen(to);
35   assert(from_len >= to_len, "must not expand input");
36 
37   for (char* dst = string; *dst && (dst = strstr(dst, from)) != NULL;) {
38     char* left_over = dst + from_len;
39     memmove(dst, to, to_len);                       // does not copy trailing 0 of <to>
40     dst += to_len;                                  // skip over the replacement.
41     memmove(dst, left_over, strlen(left_over) + 1); // copies the trailing 0 of <left_over>
42     ++ replace_count;
43   }
44 
45   return replace_count;
46 }
47 
48 double StringUtils::similarity(const char* str1, size_t len1, const char* str2, size_t len2) {
49   assert(str1 != NULL && str2 != NULL, "sanity");
50 
51   // filter out zero-length strings else we will underflow on len-1 below
52   if (len1 == 0 || len2 == 0) {
53     return 0.0;
54   }
55 
56   size_t total = len1 + len2;
57   size_t hit = 0;
58 
59   for (size_t i = 0; i < len1 - 1; i++) {
60     for (size_t j = 0; j < len2 - 1; j++) {
61       if ((str1[i] == str2[j]) && (str1[i+1] == str2[j+1])) {
62         ++hit;
63         break;
64       }
65     }
66   }
67 
68   return 2.0 * (double) hit / (double) total;
69 }