This file contains 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
| #!/bin/bash | |
| if [[ $# != 1 ]]; then | |
| echo "Usage: `basename $0` <ClassName>" | |
| exit 1 | |
| fi | |
| find -name "*.jar" |
junkdog
/ gist:5011625
Created
February 22, 2013 07:56
Find common prefix for a list of strings. Slightly modified version of http://tianrunhe.wordpress.com/2012/07/29/find-the-longest-common-prefix-in-an-array-of-strings-longest-common-prefix/
This file contains 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 static String findCommonPrefix(List<String> strings) | |
| { | |
| if (strings.size() == 0) | |
| return ""; | |
| String prefix = strings.get(0); | |
| for (int i = 1, s = strings.size(); s > i; i++) | |
| { | |
| String str = strings.get(i); | |
| for (int j = 0, l = Math.min(prefix.length(), str.length()); l > j; j++) |
This file contains 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
| #/bin/bash | |
| function full_path() | |
| { | |
| if [[ $1 == /* ]]; then | |
| echo $1 | |
| else | |
| echo `pwd`/$1 | |
| fi | |
| } |
NewerOlder