<commit_before>package general;

import java.util.concurrent.ThreadLocalRandom;

public class Main {

	public static Tutee[] removeTutee(Tutee[] tutees, int index) {
		Tutee[] result = new Tutee[tutees.length - 1];
		int counter = 0;
		for (int i = 0; i < tutees.length; i++) {
			if (i != index) {
				result[counter] = tutees[i];
				counter++;
			}
		}
		return result;
	}

	public static void main(String[] args) {

		// Creating instance of FileReader
		FileReader read = new FileReader();
		// Initializing and loading a master Array of Tutee
		Tutee[] tuteesMaster = read.initTuteeArr();
		// Initializing a copy of tuteesMaster
		Tutee[] tutees = tuteesMaster;
		// Initializing and loading an Array of Tutors
		Tutor[] tutors = read.initTutorArr();
		// Creating instance of Compatibility
		Compatibility compatible = new Compatibility();
		// Creating instance of FileWriter
		FileWriter write = new FileWriter();

		// Boolean to run main while loop
		Boolean run = true;
		// Precondition check to see if it is possible to run the main program
		if (tutees.length == 0 || tutors.length == 0)
			run = false;

		/* !Note! -Look into the below later- */

		// Integer assigned a random number within possible tutees index values to
		// randomly select a tutee
		int targetTutee = ThreadLocalRandom.current().nextInt(0, tutees.length);
		// Main while loop
		while (run) {
			// For loop to check the compatibility between each tutor and the target tutee
			for (int i = 0; i < tutors.length; i++) {
				// If a match is found, add the tutor's name to the list of possible tutors for
				// this tutee
				if (compatible.checkCompatible(tutees[targetTutee], tutors[i])) {
					tutees[targetTutee].addPossibleTutor(tutors[i].getName());
				}
			}

			// If the tutee has no possible tutors, print a non-assignment statement and
			// remove the tutee from the Array
			if (tutees[targetTutee].possibleTutorsSize() == 0) {
				write.writeNonAssignment(tutees[targetTutee].getName(), tutees[targetTutee].getCourse(0));
				tutees = removeTutee(tutees, targetTutee);
			}

		}

	}

}<commit_msg>Seventh addition to main<commit_after>package general;

import java.util.ArrayList;
import java.util.concurrent.ThreadLocalRandom;

public class Main {

	public static Tutee[] removeTutee(Tutee[] tutees, int index) {
		Tutee[] result = new Tutee[tutees.length - 1];
		int counter = 0;
		for (int i = 0; i < tutees.length; i++) {
			if (i != index) {
				result[counter] = tutees[i];
				counter++;
			}
		}
		return result;
	}

	public static void main(String[] args) {

		// Creating instance of FileReader
		FileReader read = new FileReader();
		// Initializing and loading an Array of Tutee
		Tutee[] tutees = read.initTuteeArr();
		// Initializing and loading an Array of Tutors
		Tutor[] tutors = read.initTutorArr();
		// Creating instance of Compatibility
		Compatibility compatible = new Compatibility();
		// Creating instance of FileWriter
		FileWriter write = new FileWriter();

		// Boolean to run main while loop
		Boolean run = true;
		// Precondition check to see if it is possible to run the main program
		if (tutees.length == 0 || tutors.length == 0)
			run = false;
		// List of tutees' names which have not been checked for compatible tutors
		ArrayList<String> unchecked = new ArrayList<String>(tutees.length);
		// Adding all the tutee's names to the list
		for (int i = 0; i < tutees.length; i++) {
			unchecked.add(tutees[i].getName());
		}

		/* !Note! -Look into the below later- */

		// Integer assigned a random number within possible unchecked index values to
		// randomly select a tutee
		int targetTutee = ThreadLocalRandom.current().nextInt(0, unchecked.size());
		// Boolean to mark whether the current tutee is able to be assigned
		boolean canAssign;
		ArrayList<String> oneMatch = new ArrayList<String>();
		// Main while loop
		while (run) {
			// Compatibility checking loop
			while (true) {
				canAssign = false;
				// For loop to check the compatibility between each tutor and the target tutee
				for (int i = 0; i < tutors.length; i++) {
					// If a match is found, add the tutor's name to the list of possible tutors for
					// this tutee and mark the tutee as possible to assign
					if (compatible.checkCompatible(tutees[targetTutee], tutors[i])) {
						tutees[targetTutee].addPossibleTutor(tutors[i].getName());
						canAssign = true;
					}
				}
				
				// If the tutee can not be assigned, print a non-assignment statement
				if (!canAssign)
					write.writeNonAssignment(tutees[targetTutee].getName(), tutees[targetTutee].getCourse(0));

				// Remove the tutee from the unchecked list
				unchecked.remove(targetTutee);
				
				// If the size of unchecked is not zero, find a new target tutee
				if (unchecked.size() != 0)
					targetTutee = ThreadLocalRandom.current().nextInt(0, unchecked.size());
				// Else, break this compatibility checking loop
				else
					break;
			}
			
			
			for (int i = 0; i < tutees.length; i++) {
				
			}
		}
		
	}

}
{'fraction_non_alphanumeric': 0.10779039649332536, 'fraction_numerical': 0.0041841004184100415, 'mean_word_length': 3.2362869198312234, 'pattern_counts': {'":': 0, '<': 13, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '499570', 'n_tokens_mistral': 1862, 'n_tokens_neox': 1576, 'n_words': 538}