this.cpp

std::deque<std::vector<int>> AuncheckedQ;
std::deque<std::vector<int>> AcheckedQ;
std::deque<std::vector<int>> AuncheckedQ2;
std::deque<std::vector<int>> AcheckedQ2;
std::deque<std::vector<int>> AsPath;
std::deque<std::vector<int>> AsPath2;
std::deque<std::vector<int>> AmovePath;
std::deque<std::vector<int>> AgoalPath;
std::deque<std::vector<int>> AHPath;
std::deque<std::vector<int>> AgoalPath2;
std::deque<std::vector<int>> AHPath2;
bool seenThis(vector<int> &newArray1,vector<int> &lol,int location, int gg) {
	bool theyAreEqual = true;
	bool theyAreEqual2 = true;
	vector<int> pathForA;
	vector<int> ggA;
	ggA.push_back(gg);
	vector<int> thisHasNothing;
	printf(".");
	while (!AcheckedQ.empty() && theyAreEqual) {
		thisHasNothing = AcheckedQ.front();
		AcheckedQ2.push_back(thisHasNothing);
		AcheckedQ.pop_front();
		printf(" \n the problem might be inhere?2");
		if (thisHasNothing == newArray1) {
			while (!AcheckedQ.empty()) {
				thisHasNothing = AcheckedQ.front();
				AcheckedQ2.push_back(thisHasNothing);
				AcheckedQ.pop_front();
			}
			theyAreEqual = false;
		}
	}
	printf(" \n the problem might be inhere?3");
	while (!AcheckedQ2.empty()) {
		thisHasNothing = AcheckedQ2.front();
		AcheckedQ.push_back(thisHasNothing);
		AcheckedQ2.pop_front();
	}
	printf(" \n the problem might be inhere?4");
	theyAreEqual2 = true;
	while (!AuncheckedQ.empty() && theyAreEqual2) {
		thisHasNothing = AuncheckedQ.front();
		AuncheckedQ2.push_back(thisHasNothing);
		AuncheckedQ.pop_front();
		if (thisHasNothing == newArray1) {
			while (!AuncheckedQ.empty()) {
				thisHasNothing = AuncheckedQ.front();
				AuncheckedQ2.push_back(thisHasNothing);
				AuncheckedQ.pop_front();
			}
			theyAreEqual2 = false;
		}
	}
	printf(" \n the problem might be inhere?5");
	while (!AuncheckedQ2.empty()) {
		thisHasNothing = AuncheckedQ2.front();
		AuncheckedQ.push_back(thisHasNothing);
		AuncheckedQ2.pop_front();
	}
	if (theyAreEqual && theyAreEqual2) {
		printf(" \n the problem might be inhere?6");
		AuncheckedQ.push_back(newArray1);
		printf(" \n the problem might be inhere?6");

		pathForA = AsPath.front();
		printf(" \n the problem might be inhere?6");
		AHPath.push_back(lol);
		printf(" \n the problem might be inhere?6");
		pathForA.push_back(location);
		printf(" \n the problem might be inhere?6");
		AgoalPath.push_back(ggA);
		printf(" \n the problem might be inhere?6");
		AsPath.push_back(pathForA);
		printf(" \n the problem might be inhere?6");
		return true;
	}
	return false;
}