├── .gitattributes ├── src ├── META-INF │ └── MANIFEST.MF └── com │ └── karatek │ └── deztoletter │ └── Main.java ├── .gitignore ├── DezToLetter.iml ├── README.md └── LICENSE /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /src/META-INF/MANIFEST.MF: -------------------------------------------------------------------------------- 1 | Manifest-Version: 1.0 2 | Main-Class: com.karatek.deztoletter.Main 3 | 4 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled class file 2 | *.class 3 | 4 | # Log file 5 | *.log 6 | 7 | # BlueJ files 8 | *.ctxt 9 | 10 | # Mobile Tools for Java (J2ME) 11 | .mtj.tmp/ 12 | 13 | # Package Files # 14 | *.jar 15 | *.war 16 | *.nar 17 | *.ear 18 | *.zip 19 | *.tar.gz 20 | *.rar 21 | 22 | # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml 23 | hs_err_pid* 24 | -------------------------------------------------------------------------------- /DezToLetter.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # DezToLetter 2 | 3 | ## Example 4 | 5 | ``` 6 | jens@mars:~/data/source/DezToLetter/out/artifacts/DezToLetter_jar> jp DezToLetter.jar file 7 | 8 | ____ _____ _ _ _ 9 | | _ \ ___ ___|_ _|__ | | ___| |_| |_ ___ _ __ 10 | | | | |/ _ \_ / | |/ _ \| | / _ \ __| __/ _ \ '__| 11 | | |_| | __// / | | (_) | |__| __/ |_| || __/ | 12 | |____/ \___/___| |_|\___/|_____\___|\__|\__\___|_| 13 | 14 | V.1.0 by Karatek_HD 15 | You choosed to read the numbers from a file. 16 | Please insert the path to the file: /home/jens/aschoffs.yml 17 | 18 | Contents : 19 | 20 | 01001100 01101001 01100101 21 | 01100010 01100101 01110010 22 | 01001010 01100101 01101110 23 | 01110011 24 | 01000001 01101100 01101100 25 | 01100101 01110011 00100000 26 | 01000111 01110101 01110100 27 | 01100101 00100000 01111010 28 | 01110101 01110010 29 | 01001011 01101111 01101110 30 | 01100110 01101001 01110010 31 | 01101101 01100001 01110100 32 | 01101001 01101111 01101110 33 | 00100000 34 | 35 | 36 | Spliting... 37 | 38 | 01001100 is L. 39 | 01101001 is i. 40 | 01100101 is e. 41 | 01100010 is b. 42 | 01100101 is e. 43 | 01110010 is r. 44 | 01001010 is J. 45 | 01100101 is e. 46 | 01101110 is n. 47 | 01110011 is s. 48 | 01000001 is A. 49 | 01101100 is l. 50 | 01101100 is l. 51 | 01100101 is e. 52 | 01110011 is s. 53 | 01000111 is G. 54 | 01110101 is u. 55 | 01110100 is t. 56 | 01100101 is e. 57 | 01111010 is z. 58 | 01110101 is u. 59 | 01110010 is r. 60 | 01001011 is K. 61 | 01101111 is o. 62 | 01101110 is n. 63 | 01100110 is f. 64 | 01101001 is i. 65 | 01110010 is r. 66 | 01101101 is m. 67 | 01100001 is a. 68 | 01110100 is t. 69 | 01101001 is i. 70 | 01101111 is o. 71 | 01101110 is n. 72 | 73 | Text: 74 | 75 | LieberJensAllesGutezurKonfirmation 76 | 77 | File : /home/jens/aschoffs.yml 78 | 79 | jens@mars:~/data/source/DezToLetter/out/artifacts/DezToLetter_jar> 80 | ``` 81 | 82 | If you just run the file, it will aks you for entering a decimal code. 83 | -------------------------------------------------------------------------------- /src/com/karatek/deztoletter/Main.java: -------------------------------------------------------------------------------- 1 | package com.karatek.deztoletter; 2 | 3 | import java.io.*; 4 | import java.util.HashMap; 5 | import java.util.Scanner; 6 | 7 | public class Main { 8 | public static Console console = System.console(); 9 | public static final String ANSI_RESET = "\u001B[0m"; 10 | public static final String ANSI_BLACK = "\u001B[30m"; 11 | public static final String ANSI_RED = "\u001B[31m"; 12 | public static final String ANSI_GREEN = "\u001B[32m"; 13 | public static final String ANSI_YELLOW = "\u001B[33m"; 14 | public static final String ANSI_BLUE = "\u001B[34m"; 15 | public static final String ANSI_PURPLE = "\u001B[35m"; 16 | public static final String ANSI_CYAN = "\u001B[36m"; 17 | public static final String ANSI_WHITE = "\u001B[37m"; 18 | 19 | public static void main(String[] args) { 20 | if (console == null) { 21 | System.err.println("No Console avaliable!"); 22 | System.exit(1); 23 | } 24 | 25 | System.out.println( 26 | "\n ____ _____ _ _ _ \n" + 27 | "| _ \\ ___ ___|_ _|__ | | ___| |_| |_ ___ _ __ \n" + 28 | "| | | |/ _ \\_ / | |/ _ \\| | / _ \\ __| __/ _ \\ '__|\n" + 29 | "| |_| | __// / | | (_) | |__| __/ |_| || __/ | \n" + 30 | "|____/ \\___/___| |_|\\___/|_____\\___|\\__|\\__\\___|_| \n"); 31 | 32 | System.out.println("V.1.0 by " + ANSI_CYAN + "Karatek_HD" + ANSI_RESET); 33 | if (args[0].equalsIgnoreCase("file")) { 34 | System.out.println("You choosed to read the numbers from a file."); 35 | String file = console.readLine("Please insert the path to the file: "); 36 | try { 37 | InputStream is = new FileInputStream(file); 38 | BufferedReader buf = new BufferedReader(new InputStreamReader(is)); 39 | String line = buf.readLine(); 40 | StringBuilder sb = new StringBuilder(); 41 | while (line != null) { 42 | sb.append(line).append("\n"); 43 | line = buf.readLine(); 44 | } 45 | 46 | String fileAsString = sb.toString(); 47 | System.out.println("\nContents : \n\n" + fileAsString); 48 | } catch (FileNotFoundException e) { 49 | e.printStackTrace(); 50 | } catch (IOException e) { 51 | e.printStackTrace(); 52 | } 53 | System.out.println("Spliting...\n"); 54 | Scanner sc2 = null; 55 | try { 56 | sc2 = new Scanner(new File(file)); 57 | } catch (FileNotFoundException e) { 58 | e.printStackTrace(); 59 | } 60 | while (sc2.hasNextLine()) { 61 | Scanner s2 = new Scanner(sc2.nextLine()); 62 | while (s2.hasNext()) { 63 | String s = s2.next(); 64 | boolean parsed = false; 65 | if (s.equalsIgnoreCase("01000001")) { 66 | parsed = true; 67 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "A" + ANSI_RESET + "."); 68 | } 69 | if (s.equalsIgnoreCase("01000010")) { 70 | parsed = true; 71 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "B" + ANSI_RESET + "."); 72 | } 73 | if (s.equalsIgnoreCase("01000011")) { 74 | parsed = true; 75 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "C" + ANSI_RESET + "."); 76 | } 77 | if (s.equalsIgnoreCase("01000100")) { 78 | parsed = true; 79 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "D" + ANSI_RESET + "."); 80 | } 81 | if (s.equalsIgnoreCase("01000101")) { 82 | parsed = true; 83 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "E" + ANSI_RESET + "."); 84 | } 85 | if (s.equalsIgnoreCase("01000110")) { 86 | parsed = true; 87 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "F" + ANSI_RESET + "."); 88 | } 89 | if (s.equalsIgnoreCase("01000111")) { 90 | parsed = true; 91 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "G" + ANSI_RESET + "."); 92 | } 93 | if (s.equalsIgnoreCase("01001000")) { 94 | parsed = true; 95 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "H" + ANSI_RESET + "."); 96 | } 97 | if (s.equalsIgnoreCase("01001001")) { 98 | parsed = true; 99 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "I" + ANSI_RESET + "."); 100 | } 101 | if (s.equalsIgnoreCase("01001010")) { 102 | parsed = true; 103 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "J" + ANSI_RESET + "."); 104 | } 105 | if (s.equalsIgnoreCase("01001011")) { 106 | parsed = true; 107 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "K" + ANSI_RESET + "."); 108 | } 109 | if (s.equalsIgnoreCase("01001100")) { 110 | parsed = true; 111 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "L" + ANSI_RESET + "."); 112 | } 113 | if (s.equalsIgnoreCase("01001101")) { 114 | parsed = true; 115 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "M" + ANSI_RESET + "."); 116 | } 117 | if (s.equalsIgnoreCase("01001110")) { 118 | parsed = true; 119 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "N" + ANSI_RESET + "."); 120 | } 121 | if (s.equalsIgnoreCase("01001111")) { 122 | parsed = true; 123 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "O" + ANSI_RESET + "."); 124 | } 125 | if (s.equalsIgnoreCase("01010000")) { 126 | parsed = true; 127 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "P" + ANSI_RESET + "."); 128 | } 129 | if (s.equalsIgnoreCase("01010001")) { 130 | parsed = true; 131 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "Q" + ANSI_RESET + "."); 132 | } 133 | if (s.equalsIgnoreCase("01010010")) { 134 | parsed = true; 135 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "R" + ANSI_RESET + "."); 136 | } 137 | if (s.equalsIgnoreCase("01010011")) { 138 | parsed = true; 139 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "S" + ANSI_RESET + "."); 140 | } 141 | if (s.equalsIgnoreCase("01010100")) { 142 | parsed = true; 143 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "T" + ANSI_RESET + "."); 144 | } 145 | if (s.equalsIgnoreCase("01010101")) { 146 | parsed = true; 147 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "U" + ANSI_RESET + "."); 148 | } 149 | if (s.equalsIgnoreCase("01010110")) { 150 | parsed = true; 151 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "V" + ANSI_RESET + "."); 152 | } 153 | if (s.equalsIgnoreCase("01010111")) { 154 | parsed = true; 155 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "W" + ANSI_RESET + "."); 156 | } 157 | if (s.equalsIgnoreCase("01011000")) { 158 | parsed = true; 159 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "X" + ANSI_RESET + "."); 160 | } 161 | if (s.equalsIgnoreCase("01011001")) { 162 | parsed = true; 163 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "Y" + ANSI_RESET + "."); 164 | } 165 | if (s.equalsIgnoreCase("01011010")) { 166 | parsed = true; 167 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "Z" + ANSI_RESET + "."); 168 | } 169 | if (s.equalsIgnoreCase("quit")) { 170 | System.exit(0); 171 | } 172 | if (s.equalsIgnoreCase("01100001")) { 173 | parsed = true; 174 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "a" + ANSI_RESET + "."); 175 | } 176 | if (s.equalsIgnoreCase("01100010")) { 177 | parsed = true; 178 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "b" + ANSI_RESET + "."); 179 | } 180 | if (s.equalsIgnoreCase("01100011")) { 181 | parsed = true; 182 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "c" + ANSI_RESET + "."); 183 | } 184 | if (s.equalsIgnoreCase("01100100")) { 185 | parsed = true; 186 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "d" + ANSI_RESET + "."); 187 | } 188 | if (s.equalsIgnoreCase("01100101")) { 189 | parsed = true; 190 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "e" + ANSI_RESET + "."); 191 | } 192 | if (s.equalsIgnoreCase("01100110")) { 193 | parsed = true; 194 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "f" + ANSI_RESET + "."); 195 | } 196 | if (s.equalsIgnoreCase("01100111")) { 197 | parsed = true; 198 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "g" + ANSI_RESET + "."); 199 | } 200 | if (s.equalsIgnoreCase("01101000")) { 201 | parsed = true; 202 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "h" + ANSI_RESET + "."); 203 | } 204 | if (s.equalsIgnoreCase("01101001")) { 205 | parsed = true; 206 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "i" + ANSI_RESET + "."); 207 | } 208 | if (s.equalsIgnoreCase("01101010")) { 209 | parsed = true; 210 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "j" + ANSI_RESET + "."); 211 | } 212 | if (s.equalsIgnoreCase("01101011")) { 213 | parsed = true; 214 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "k" + ANSI_RESET + "."); 215 | } 216 | if (s.equalsIgnoreCase("01101100")) { 217 | parsed = true; 218 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "l" + ANSI_RESET + "."); 219 | } 220 | if (s.equalsIgnoreCase("01101101")) { 221 | parsed = true; 222 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "m" + ANSI_RESET + "."); 223 | } 224 | if (s.equalsIgnoreCase("01101110")) { 225 | parsed = true; 226 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "n" + ANSI_RESET + "."); 227 | } 228 | if (s.equalsIgnoreCase("01101111")) { 229 | parsed = true; 230 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "o" + ANSI_RESET + "."); 231 | } 232 | if (s.equalsIgnoreCase("01110000")) { 233 | parsed = true; 234 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "p" + ANSI_RESET + "."); 235 | } 236 | if (s.equalsIgnoreCase("01110001")) { 237 | parsed = true; 238 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "q" + ANSI_RESET + "."); 239 | } 240 | if (s.equalsIgnoreCase("01110010")) { 241 | parsed = true; 242 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "r" + ANSI_RESET + "."); 243 | } 244 | if (s.equalsIgnoreCase("01110011")) { 245 | parsed = true; 246 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "s" + ANSI_RESET + "."); 247 | } 248 | if (s.equalsIgnoreCase("01110100")) { 249 | parsed = true; 250 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "t" + ANSI_RESET + "."); 251 | } 252 | if (s.equalsIgnoreCase("01110101")) { 253 | parsed = true; 254 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "u" + ANSI_RESET + "."); 255 | } 256 | if (s.equalsIgnoreCase("01110110")) { 257 | parsed = true; 258 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "v" + ANSI_RESET + "."); 259 | } 260 | if (s.equalsIgnoreCase("01110111")) { 261 | parsed = true; 262 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "w" + ANSI_RESET + "."); 263 | } 264 | if (s.equalsIgnoreCase("01111000")) { 265 | parsed = true; 266 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "x" + ANSI_RESET + "."); 267 | } 268 | if (s.equalsIgnoreCase("01111001")) { 269 | parsed = true; 270 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "y" + ANSI_RESET + "."); 271 | } 272 | if (s.equalsIgnoreCase("01111010")) { 273 | parsed = true; 274 | System.out.println(ANSI_GREEN + s + ANSI_RESET + " is " + ANSI_GREEN + "z" + ANSI_RESET + "."); 275 | } 276 | 277 | 278 | } 279 | 280 | 281 | } 282 | System.out.print("\n"); 283 | //2tes Mal 284 | Scanner sc3 = null; 285 | try { 286 | sc3 = new Scanner(new File(file)); 287 | } catch (FileNotFoundException e) { 288 | e.printStackTrace(); 289 | } 290 | System.out.println("Text: \n"); 291 | while (sc3.hasNextLine()) { 292 | Scanner s3 = new Scanner(sc3.nextLine()); 293 | while (s3.hasNext()) { 294 | String s = s3.next(); 295 | boolean parsed = false; 296 | if (s.equalsIgnoreCase("01000001")) { 297 | parsed = true; 298 | System.out.print("A"); 299 | } 300 | if (s.equalsIgnoreCase("01000010")) { 301 | parsed = true; 302 | System.out.print("B"); 303 | } 304 | if (s.equalsIgnoreCase("01000011")) { 305 | parsed = true; 306 | System.out.print("C"); 307 | } 308 | if (s.equalsIgnoreCase("01000100")) { 309 | parsed = true; 310 | System.out.print("D"); 311 | } 312 | if (s.equalsIgnoreCase("01000101")) { 313 | parsed = true; 314 | System.out.print("E"); 315 | } 316 | if (s.equalsIgnoreCase("01000110")) { 317 | parsed = true; 318 | System.out.print("F"); 319 | } 320 | if (s.equalsIgnoreCase("01000111")) { 321 | parsed = true; 322 | System.out.print("G"); 323 | } 324 | if (s.equalsIgnoreCase("01001000")) { 325 | parsed = true; 326 | System.out.print("H"); 327 | } 328 | if (s.equalsIgnoreCase("01001001")) { 329 | parsed = true; 330 | System.out.print("I"); 331 | } 332 | if (s.equalsIgnoreCase("01001010")) { 333 | parsed = true; 334 | System.out.print("J"); 335 | } 336 | if (s.equalsIgnoreCase("01001011")) { 337 | parsed = true; 338 | System.out.print("K"); 339 | } 340 | if (s.equalsIgnoreCase("01001100")) { 341 | parsed = true; 342 | System.out.print("L"); 343 | } 344 | if (s.equalsIgnoreCase("01001101")) { 345 | parsed = true; 346 | System.out.print("M"); 347 | } 348 | if (s.equalsIgnoreCase("01001110")) { 349 | parsed = true; 350 | System.out.print("N"); 351 | } 352 | if (s.equalsIgnoreCase("01001111")) { 353 | parsed = true; 354 | System.out.print("O"); 355 | } 356 | if (s.equalsIgnoreCase("01010000")) { 357 | parsed = true; 358 | System.out.print("P"); 359 | } 360 | if (s.equalsIgnoreCase("01010001")) { 361 | parsed = true; 362 | System.out.print("Q"); 363 | } 364 | if (s.equalsIgnoreCase("01010010")) { 365 | parsed = true; 366 | System.out.print("R"); 367 | } 368 | if (s.equalsIgnoreCase("01010011")) { 369 | parsed = true; 370 | System.out.print("S"); 371 | } 372 | if (s.equalsIgnoreCase("01010100")) { 373 | parsed = true; 374 | System.out.print("T"); 375 | } 376 | if (s.equalsIgnoreCase("01010101")) { 377 | parsed = true; 378 | System.out.print("U"); 379 | } 380 | if (s.equalsIgnoreCase("01010110")) { 381 | parsed = true; 382 | System.out.print("V"); 383 | } 384 | if (s.equalsIgnoreCase("01010111")) { 385 | parsed = true; 386 | System.out.print("W"); 387 | } 388 | if (s.equalsIgnoreCase("01011000")) { 389 | parsed = true; 390 | System.out.print("X"); 391 | } 392 | if (s.equalsIgnoreCase("01011001")) { 393 | parsed = true; 394 | System.out.print("Y"); 395 | } 396 | if (s.equalsIgnoreCase("01011010")) { 397 | parsed = true; 398 | System.out.print("Z"); 399 | } 400 | 401 | if (s.equalsIgnoreCase("01100001")) { 402 | parsed = true; 403 | System.out.print("a"); 404 | } 405 | if (s.equalsIgnoreCase("01100010")) { 406 | parsed = true; 407 | System.out.print("b"); 408 | } 409 | if (s.equalsIgnoreCase("01100011")) { 410 | parsed = true; 411 | System.out.print("c"); 412 | } 413 | if (s.equalsIgnoreCase("01100100")) { 414 | parsed = true; 415 | System.out.print("d"); 416 | } 417 | if (s.equalsIgnoreCase("01100101")) { 418 | parsed = true; 419 | System.out.print("e"); 420 | } 421 | if (s.equalsIgnoreCase("01100110")) { 422 | parsed = true; 423 | System.out.print("f"); 424 | } 425 | if (s.equalsIgnoreCase("01100111")) { 426 | parsed = true; 427 | System.out.print("g"); 428 | } 429 | if (s.equalsIgnoreCase("01101000")) { 430 | parsed = true; 431 | System.out.print("h"); 432 | } 433 | if (s.equalsIgnoreCase("01101001")) { 434 | parsed = true; 435 | System.out.print("i"); 436 | } 437 | if (s.equalsIgnoreCase("01101010")) { 438 | parsed = true; 439 | System.out.print("j"); 440 | } 441 | if (s.equalsIgnoreCase("01101011")) { 442 | parsed = true; 443 | System.out.print("k"); 444 | } 445 | if (s.equalsIgnoreCase("01101100")) { 446 | parsed = true; 447 | System.out.print("l"); 448 | } 449 | if (s.equalsIgnoreCase("01101101")) { 450 | parsed = true; 451 | System.out.print("m"); 452 | } 453 | if (s.equalsIgnoreCase("01101110")) { 454 | parsed = true; 455 | System.out.print("n"); 456 | } 457 | if (s.equalsIgnoreCase("01101111")) { 458 | parsed = true; 459 | System.out.print("o"); 460 | } 461 | if (s.equalsIgnoreCase("01110000")) { 462 | parsed = true; 463 | System.out.print("p"); 464 | } 465 | if (s.equalsIgnoreCase("01110001")) { 466 | parsed = true; 467 | System.out.print("q"); 468 | } 469 | if (s.equalsIgnoreCase("01110010")) { 470 | parsed = true; 471 | System.out.print("r"); 472 | } 473 | if (s.equalsIgnoreCase("01110011")) { 474 | parsed = true; 475 | System.out.print("s"); 476 | } 477 | if (s.equalsIgnoreCase("01110100")) { 478 | parsed = true; 479 | System.out.print("t"); 480 | } 481 | if (s.equalsIgnoreCase("01110101")) { 482 | parsed = true; 483 | System.out.print("u"); 484 | } 485 | if (s.equalsIgnoreCase("01110110")) { 486 | parsed = true; 487 | System.out.print("v"); 488 | } 489 | if (s.equalsIgnoreCase("01110111")) { 490 | parsed = true; 491 | System.out.print("w"); 492 | } 493 | if (s.equalsIgnoreCase("01111000")) { 494 | parsed = true; 495 | System.out.print("x"); 496 | } 497 | if (s.equalsIgnoreCase("01111001")) { 498 | parsed = true; 499 | System.out.print("y"); 500 | } 501 | if (s.equalsIgnoreCase("01111010")) { 502 | parsed = true; 503 | System.out.print("z"); 504 | } 505 | 506 | 507 | } 508 | } 509 | System.out.println("\n\nFile : " + ANSI_PURPLE + file + ANSI_RESET); 510 | System.out.print("\n"); 511 | //Ende 512 | 513 | 514 | 515 | 516 | } else { 517 | con(); 518 | } 519 | } 520 | 521 | 522 | public static void con() { 523 | String input = console.readLine("Deziamlzahl > "); 524 | calc(input); 525 | } 526 | 527 | public static void calc(String input) { 528 | boolean parsed = false; 529 | if(input.equalsIgnoreCase("01000001")) { 530 | parsed = true; 531 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "A" + ANSI_RESET + "."); 532 | } if(input.equalsIgnoreCase("01000010")) { 533 | parsed = true; 534 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "B" + ANSI_RESET + "."); 535 | } if(input.equalsIgnoreCase("01000011")) { 536 | parsed = true; 537 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "C" + ANSI_RESET + "."); 538 | } if(input.equalsIgnoreCase("01000100")) { 539 | parsed = true; 540 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "D" + ANSI_RESET + "."); 541 | } if(input.equalsIgnoreCase("01000101")) { 542 | parsed = true; 543 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "E" + ANSI_RESET + "."); 544 | } if(input.equalsIgnoreCase("01000110")) { 545 | parsed = true; 546 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "F" + ANSI_RESET + "."); 547 | } if(input.equalsIgnoreCase("01000111")) { 548 | parsed = true; 549 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "G" + ANSI_RESET + "."); 550 | } if(input.equalsIgnoreCase("01001000")) { 551 | parsed = true; 552 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "H" + ANSI_RESET + "."); 553 | } if(input.equalsIgnoreCase("01001001")) { 554 | parsed = true; 555 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "I" + ANSI_RESET + "."); 556 | } if(input.equalsIgnoreCase("01001010")) { 557 | parsed = true; 558 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "J" + ANSI_RESET + "."); 559 | } if(input.equalsIgnoreCase("01001011")) { 560 | parsed = true; 561 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "K" + ANSI_RESET + "."); 562 | } if(input.equalsIgnoreCase("01001100")) { 563 | parsed = true; 564 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "L" + ANSI_RESET + "."); 565 | } if(input.equalsIgnoreCase("01001101")) { 566 | parsed = true; 567 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "M" + ANSI_RESET + "."); 568 | } if(input.equalsIgnoreCase("01001110")) { 569 | parsed = true; 570 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "N" + ANSI_RESET + "."); 571 | } if(input.equalsIgnoreCase("01001111")) { 572 | parsed = true; 573 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "O" + ANSI_RESET + "."); 574 | } if(input.equalsIgnoreCase("01010000")) { 575 | parsed = true; 576 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "P" + ANSI_RESET + "."); 577 | } if(input.equalsIgnoreCase("01010001")) { 578 | parsed = true; 579 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "Q" + ANSI_RESET + "."); 580 | } if(input.equalsIgnoreCase("01010010")) { 581 | parsed = true; 582 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "R" + ANSI_RESET + "."); 583 | } if(input.equalsIgnoreCase("01010011")) { 584 | parsed = true; 585 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "S" + ANSI_RESET + "."); 586 | } if(input.equalsIgnoreCase("01010100")) { 587 | parsed = true; 588 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "T" + ANSI_RESET + "."); 589 | } if(input.equalsIgnoreCase("01010101")) { 590 | parsed = true; 591 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "U" + ANSI_RESET + "."); 592 | } if(input.equalsIgnoreCase("01010110")) { 593 | parsed = true; 594 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "V" + ANSI_RESET + "."); 595 | } if(input.equalsIgnoreCase("01010111")) { 596 | parsed = true; 597 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "W" + ANSI_RESET + "."); 598 | } if(input.equalsIgnoreCase("01011000")) { 599 | parsed = true; 600 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "X" + ANSI_RESET + "."); 601 | } if(input.equalsIgnoreCase("01011001")) { 602 | parsed = true; 603 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "Y" + ANSI_RESET + "."); 604 | } if(input.equalsIgnoreCase("01011010")) { 605 | parsed = true; 606 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "Z" + ANSI_RESET + "."); 607 | } if(input.equalsIgnoreCase("quit")) { 608 | System.exit(0); 609 | } if(input.equalsIgnoreCase("01100001")) { 610 | parsed = true; 611 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "a" + ANSI_RESET + "."); 612 | } 613 | if(input.equalsIgnoreCase("01100010")) { 614 | parsed = true; 615 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "b" + ANSI_RESET + "."); 616 | } 617 | if(input.equalsIgnoreCase("01100011")) { 618 | parsed = true; 619 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "c" + ANSI_RESET + "."); 620 | } 621 | if(input.equalsIgnoreCase("01100100")) { 622 | parsed = true; 623 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "d" + ANSI_RESET + "."); 624 | } 625 | if(input.equalsIgnoreCase("01100101")) { 626 | parsed = true; 627 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "e" + ANSI_RESET + "."); 628 | } 629 | if(input.equalsIgnoreCase("01100110")) { 630 | parsed = true; 631 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "f" + ANSI_RESET + "."); 632 | } 633 | if(input.equalsIgnoreCase("01100111")) { 634 | parsed = true; 635 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "g" + ANSI_RESET + "."); 636 | } 637 | if(input.equalsIgnoreCase("01101000")) { 638 | parsed = true; 639 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "h" + ANSI_RESET + "."); 640 | } 641 | if(input.equalsIgnoreCase("01101001")) { 642 | parsed = true; 643 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "i" + ANSI_RESET + "."); 644 | } 645 | if(input.equalsIgnoreCase("01101010")) { 646 | parsed = true; 647 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "j" + ANSI_RESET + "."); 648 | } 649 | if(input.equalsIgnoreCase("01101011")) { 650 | parsed = true; 651 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "k" + ANSI_RESET + "."); 652 | } 653 | if(input.equalsIgnoreCase("01101100")) { 654 | parsed = true; 655 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "l" + ANSI_RESET + "."); 656 | } 657 | if(input.equalsIgnoreCase("01101101")) { 658 | parsed = true; 659 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "m" + ANSI_RESET + "."); 660 | } 661 | if(input.equalsIgnoreCase("01101110")) { 662 | parsed = true; 663 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "n" + ANSI_RESET + "."); 664 | } 665 | if(input.equalsIgnoreCase("01101111")) { 666 | parsed = true; 667 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "o" + ANSI_RESET + "."); 668 | } 669 | if(input.equalsIgnoreCase("01110000")) { 670 | parsed = true; 671 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "p" + ANSI_RESET + "."); 672 | } 673 | if(input.equalsIgnoreCase("01110001")) { 674 | parsed = true; 675 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "q" + ANSI_RESET + "."); 676 | } 677 | if(input.equalsIgnoreCase("01110010")) { 678 | parsed = true; 679 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "r" + ANSI_RESET + "."); 680 | } 681 | if(input.equalsIgnoreCase("01110011")) { 682 | parsed = true; 683 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "s" + ANSI_RESET + "."); 684 | } 685 | if(input.equalsIgnoreCase("01110100")) { 686 | parsed = true; 687 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "t" + ANSI_RESET + "."); 688 | } 689 | if(input.equalsIgnoreCase("01110101")) { 690 | parsed = true; 691 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "u" + ANSI_RESET + "."); 692 | } 693 | if(input.equalsIgnoreCase("01110110")) { 694 | parsed = true; 695 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "v" + ANSI_RESET + "."); 696 | } 697 | if(input.equalsIgnoreCase("01110111")) { 698 | parsed = true; 699 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "w" + ANSI_RESET + "."); 700 | } 701 | if(input.equalsIgnoreCase("01111000")) { 702 | parsed = true; 703 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "x" + ANSI_RESET + "."); 704 | } 705 | if(input.equalsIgnoreCase("01111001")) { 706 | parsed = true; 707 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "y" + ANSI_RESET + "."); 708 | } 709 | if(input.equalsIgnoreCase("01111010")) { 710 | parsed = true; 711 | System.out.println(ANSI_GREEN + input + ANSI_RESET + " is " + ANSI_GREEN + "z" + ANSI_RESET + "."); 712 | } 713 | 714 | else { 715 | if(!parsed) { 716 | System.err.println("Cannot parse your input."); 717 | } 718 | } 719 | con(); 720 | } 721 | } 722 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . --------------------------------------------------------------------------------