Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for encodeSimilarDocHash (0.09 seconds)

  1. src/main/java/org/codelibs/fess/helper/DocumentHelper.java

            }
        }
    
        /**
         * Decodes a similar document hash from its compressed and encoded form.
         * Reverses the encoding process applied by encodeSimilarDocHash.
         *
         * @param hash the encoded hash string to decode
         * @return the decoded hash string, or the original hash if decoding fails
         */
        public String decodeSimilarDocHash(final String hash) {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Mar 30 14:27:04 GMT 2026
    - 17.4K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/fess/taglib/FessFunctions.java

         */
        public static String sdh(final String input) {
            if (StringUtil.isBlank(input)) {
                return input;
            }
            return ComponentUtil.getDocumentHelper().encodeSimilarDocHash(input);
        }
    
        /**
         * Joins array or list elements into a single space-separated string.
         *
         * @param input the input object (String[], List, or String)
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 25.4K bytes
    - Click Count (1)
  3. src/test/java/org/codelibs/fess/helper/DocumentHelperTest.java

            assertEquals(value, documentHelper.encodeSimilarDocHash(hash));
            hash = "$H4sIAAAAAAAAAAMAAAAAAAAAAAA";
            value = "$H4sIAAAAAAAAAAMAAAAAAAAAAAA";
            assertEquals(value, documentHelper.encodeSimilarDocHash(hash));
    
            assertNull(documentHelper.encodeSimilarDocHash(null));
        }
    
        @Test
        public void test_decodeSimilarDocHash() {
            DocumentHelper documentHelper = new DocumentHelper();
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Wed Jan 14 14:29:07 GMT 2026
    - 13.2K bytes
    - Click Count (0)
Back to Top