<commit_before>
import java.util.Map;

public class PathFinding{
	
	//Il faut vérifier les mouvements
	//Il faut finir la méthode getAdjacentSquare()
	
	private Map<Coordinates,Square> shortReachableSquare;
	private Map<Coordinates,Square> longReachableSquare;
		
	
	public PathFinding(){
		this.shortReachableSquare = new HashMap<>();
		this.longReachableSquare = new HashMap<>();
	}
	
	
	public Map<Coordinates,Square> getAdjacentSquare(Coordinates c){
		Map<Coordinates,Square> adjacentSquare = new HashMap<>();
		//A terminer
		
		
	}
	
	public void getFirstReachableSquare(Coordinates c){
		Map<Coordinates,Square> adjacentSquare1 = getAdjacentSquare(c);
		for(Coordinates c1 : adjacentSquare1){
			if(adjacentSquare1.get(c1).isFree)
				this.shortReachableSquare.put(c1,adjacentSquare1.get(c1));
			else if(!adjacentSquare.get(c1).isFree){
				Map<Coordinates,Square> adjacentSquare2 = getAdjacentSquare(c1);
				for(Coordinates c2 : adjacentSquare2){
					if(adjacentSquare2.get(c2).isFree)
						this.longReachableSquare.put(c2,adjacentSquare2.get(c2));
				}				
			}	
		}		
	}
	
	public void getLongReachableSquare(Coordinates c){
		//this.longReachableSquare.clear(); si on clear on fera case par case sinon on aura toutes les cases.
		Map<Coordinates,Square> adjacentSquare1 = getAdjacentSquare(c);
		for(Coordinates c1 : adjacentSquare1){
			Map<Coordinates,Square> adjacentSquare2 = getAdjacentSquare(c1);
			for(Coordinates c2 : adjacentSquare2) = getAdjacentSquare(c2){
				if(adjacentSquare2.get(c2).isFree)
					this.longReachableSquare.put(c2,adjacentSquare2.get(c2));			
			}		
		
		}	
		
		
	}
	
}<commit_msg>Pour que le jeu compile sans que pathFinding marche<commit_after>
import java.util.Map;

public class PathFinding{
/**	
	//Il faut vérifier les mouvements
	//Il faut finir la méthode getAdjacentSquare()
	
	private Map<Coordinates,Square> shortReachableSquare;
	private Map<Coordinates,Square> longReachableSquare;
		
	
	public PathFinding(){
		this.shortReachableSquare = new HashMap<>();
		this.longReachableSquare = new HashMap<>();
	}
	
	
	public Map<Coordinates,Square> getAdjacentSquare(Coordinates c){
		Map<Coordinates,Square> adjacentSquare = new HashMap<>();
		
		//A terminer
		
		
	}
	
	public void getFirstReachableSquare(Coordinates c){
		Map<Coordinates,Square> adjacentSquare1 = getAdjacentSquare(c);
		for(Coordinates c1 : adjacentSquare1){
			if(adjacentSquare1.get(c1).isFree)
				this.shortReachableSquare.put(c1,adjacentSquare1.get(c1));
			else if(!adjacentSquare.get(c1).isFree){
				Map<Coordinates,Square> adjacentSquare2 = getAdjacentSquare(c1);
				for(Coordinates c2 : adjacentSquare2){
					if(adjacentSquare2.get(c2).isFree)
						this.longReachableSquare.put(c2,adjacentSquare2.get(c2));
				}				
			}	
		}		
	}
	
	public void getLongReachableSquare(Coordinates c){
		//this.longReachableSquare.clear(); si on clear on fera case par case sinon on aura toutes les cases.
		Map<Coordinates,Square> adjacentSquare1 = getAdjacentSquare(c);
		for(Coordinates c1 : adjacentSquare1){
			Map<Coordinates,Square> adjacentSquare2 = getAdjacentSquare(c1);
			for(Coordinates c2 : adjacentSquare2){
				if(adjacentSquare2.get(c2).isFree)
					this.longReachableSquare.put(c2,adjacentSquare2.get(c2));			
			}		
		
		}	
		
		
	}
**/	
}
{'fraction_non_alphanumeric': 0.10996040207127628, 'fraction_numerical': 0.0185805665549802, 'mean_word_length': 4.623287671232877, 'pattern_counts': {'":': 0, '<': 25, '<?xml version=': 0, '>': 25, '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': '4247416', 'n_tokens_mistral': 1370, 'n_tokens_neox': 1189, 'n_words': 201}