This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class JavaUtil { | |
| // This implementation is much faster than Levenshtein method in my testing. | |
| // These variables will determine the probability of a false-positive | |
| // Set as needed | |
| private static final int BLOOM_FILTER_SIZE = 1024; | |
| private static final int NUM_HASH_FUNCTIONS = 7; | |
| // Note this function will only check the length of "match" (checking the end of "text", adjust as is needed) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/system/bin/sh | |
| PATH=/system/bin:/system/xbin | |
| houdini_bin=0 | |
| dest_dir=/system/lib$1/arm$1 | |
| binfmt_misc_dir=/proc/sys/fs/binfmt_misc | |
| if [ -z "$1" ]; then | |
| if [ "`uname -m`" = "x86_64" ]; then |