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
<?php | |
/* | |
* PHP: Recursively Backup Files & Folders to ZIP-File | |
* MIT-License - 2012-2018 Marvin Menzerath | |
*/ | |
// Make sure the script can handle large folders/files | |
ini_set('max_execution_time', 600); | |
ini_set('memory_limit', '1024M'); |
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
package de.menzerath.util; | |
import java.io.File; | |
import java.text.DecimalFormat; | |
import java.util.HashMap; | |
public class FileManager { | |
private static HashMap<String, String> mimeTypes = new HashMap<>(); | |
private static boolean mimeTypesInitCompleted = false; |
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
echo oracle-java8-installer shared/accepted-oracle-license-v1-1 select true | /usr/bin/debconf-set-selections | |
add-apt-repository -y ppa:webupd8team/java | |
apt-get update | |
apt-get dist-upgrade -y | |
apt-get autoremove -y | |
apt-get install -y oracle-java8-installer oracle-java8-set-default | |
java -version |
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
package abiturklassen.baumklassen; | |
/** | |
* <p>Materialien zu den zentralen | |
* Abiturpruefungen im Fach Informatik ab 2012 in | |
* Nordrhein-Westfalen.</p> | |
* <p>Klasse BinarySearchTree</p> | |
* <p>In einem Objekt der Klasse BinarySearchTree werden beliebig viele Objekte in einem Binaerbaum (binaerer Suchbaum) | |
* entsprechend einer Ordnungsrelation verwaltet. Ein Objekt der Klasse stellt entweder einen leeren Baum dar oder | |
* verwaltet ein Inhaltsobjekt sowie einen linken und einen rechten Teilbaum, die ebenfalls Objekte der Klasse BinarySearchTree sind. |