// Use this for initialization
void Start()
{
GameEngine = gameObject.GetComponent <game_engine> ();
objDick = gameObject.GetComponent <objectDictionary> ();
compareScript = this;
newPostIDs = new List <string> ();
}
static void Main(string[] args)
{
Name[] names = new Name[5] {
new Name()
{
firstName = "Akhilesh", lastName = "NS"
},
new Name()
{
firstName = "Akhilesh", lastName = "NS"
},
new Name()
{
firstName = "Aniruddha", lastName = "MN"
},
new Name()
{
firstName = "Anirban", lastName = "G"
},
new Name()
{
firstName = "Anirban", lastName = "D"
},
};
compare Compare = new compare(nameComparer);
Console.WriteLine(Compare(names[0], names[1]));
Console.WriteLine(Compare(names[2], names[3]));
Console.WriteLine(Compare(names[3], names[4]));
}
static void Main(string[] args)
{
List <string> fruits = new List <string> {
"apple", "pear", "banana", "strawberry", "lemon"
};
transform transform = x => x.ToUpper();
Console.WriteLine("Oefening 1");
foreach (string fruit in fruits)
{
Console.WriteLine(transform(fruit));
}
Console.WriteLine("Oefening 2");
count count = x => x.Length;
foreach (string fruit in fruits)
{
Console.WriteLine($"{fruit} telt {count(fruit)} tekens");
}
Console.WriteLine("Oefening 3");
compare compare = (x, y) => x.Length > y.Length;
for (int i = 1; i < fruits.Count; i++)
{
Console.WriteLine($"{fruits[i-1]} contains more characters than {fruits[i]} : {compare(fruits[i-1],fruits[i])}");
}
Console.ReadKey();
}
void Start()
{
GameEngine = gameObject.GetComponent <game_engine> ();
objDick = gameObject.GetComponent <objectDictionary> ();
compareScript = gameObject.GetComponent <compare> ();
Instance = this;
}
static int findExtremum(int[] arr, compare comp)
{
int extremum = arr[0];
for (int i = 1; i < arr.Length; ++i)
{
extremum = comp(extremum, arr[i]);
}
return(extremum);
}
public bool[,] GetPossibleMovements(int fromX, int fromY, IPawn[,] gameBoardPositions)
{
bool[,] possiblePositionsOnGameBoard = new bool[10, 9];
PlayerSide currentSide = gameBoardPositions[fromX, fromY].GetPlayerSide();
int riverRow = currentSide == PlayerSide.BLACK ? 4 : 5;
compare myDelegate = null;
compare2 myDelegate2 = null;
compare3 myDelegate3 = null;
if (currentSide == PlayerSide.BLACK)
{
myDelegate = (i, j) => i > j;
myDelegate2 = (k) => k + 1;
myDelegate3 = (i) => i < 10;
}
else if (currentSide == PlayerSide.RED)
{
myDelegate = (i, j) => i < j;
myDelegate2 = (k) => k - 1;
myDelegate3 = (i) => i > -1;
}
bool passedRiver = myDelegate(fromX, riverRow);
// Check down or up.
if (myDelegate3(myDelegate2(fromX)))
{
possiblePositionsOnGameBoard[myDelegate2(fromX), fromY] = true;
}
if (passedRiver)
{
// Check right.
if ((fromY + 1) < 9)
{
possiblePositionsOnGameBoard[fromX, (fromY + 1)] = true;
}
// Check left.
if ((fromY - 1) > -1)
{
possiblePositionsOnGameBoard[fromX, (fromY - 1)] = true;
}
}
return(possiblePositionsOnGameBoard);
}
static void Main(string[] args)
{
StudentData sd = new StudentData();
List <Student> students = sd.GetFilteredStudents();
foreach (Student student in students)
{
Console.WriteLine($"{student.FirstName} {student.LastName}");
}
Console.WriteLine();
Console.WriteLine("Oefening 1");
transform transform = x => x.ToUpper();
foreach (string fruit in fruits)
{
Console.WriteLine(transform(fruit));
}
Console.WriteLine();
Console.WriteLine("Oefening 2");
count count = x => x.Length;
foreach (string fruit in fruits)
{
Console.WriteLine($"{fruit} telt {count(fruit)} tekens");
}
Console.WriteLine();
Console.WriteLine("Oefening 3");
compare compare = (x, y) => x.Length > y.Length;
for (int i = 1; i < fruits.Count; i++)
{
Console.WriteLine($"{fruits[i - 1]} contains more characters than {fruits[i]} : {compare(fruits[i - 1], fruits[i])}");
}
Console.WriteLine();
Console.WriteLine("Oefening 4");
//checkAge checkAge = (x, y) => { if (x < y) return "not"; else return ""; };
checkAge checkAge = (x, y) => (x < y)? "NOT": "";
foreach (Student s in sd.GetAllStudents())
{
Console.WriteLine($"{s.FirstName} {s.LastName} is {checkAge(s.Age,21)} old enough.");
}
Console.ReadKey();
}
public static void SortData(this List <string> list, compare <string> action)
{
for (int j = 0; j < list.Count; j++)
{
for (int i = 1; i < list.Count; i++)
{
if (action(list[i - 1], list[i]) > 0)
{
string s = list[i];
list[i] = list[i - 1];
list[i - 1] = s;
}
}
}
}
public static void QuickSort(List <T> v, int esq, int dir, compare <T> method)
{
int esq2 = esq;
int dir2 = dir;
Partition(v, ref esq2, ref dir2, method);
if (dir > esq2)
{
QuickSort(v, esq2, dir, method);
}
if (esq < dir2)
{
QuickSort(v, esq, dir2, method);
}
}
static void sort(List <int> list, compare fn = null, int?left = null, int?right = null)
{
var compareFunction = fn ?? decCompare;
var initLeft = left ?? 0;
var initRight = right ?? list.Count - 1;
if (initLeft >= initRight)
{
return; // done
}
int idx = partition(list, compareFunction, initLeft, initRight);
sort(list, compareFunction, initLeft, idx - 1);
sort(list, compareFunction, idx + 1, initRight);
}
static void Bubblesort(int[] arr, compare compare)
{
int i, j, tmp = 0;
for (i = 0; i < arr.Length - 1; i++)
{
for (j = 0; j < arr.Length - (i + 1); j++)
{
if (compare(arr[j], arr[j + 1]) > 0)
{
tmp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = tmp;
}
}
}
}
public static void selectionSort <T>(List <T> _list, Compare _order, compare _compare)
{
int max_min;
for (int i = 0; i < _list.Count - 1; i++)
{
max_min = i;
for (int index = i + 1; index < _list.Count; index++)
{
if (_compare(_list[index], _list[max_min]) == _order)
{
max_min = index;
}
}
swap <T>(_list, i, max_min);
}
}
internal override void load_syntax(settings_as_string sett, ref string error) {
base.load_syntax(sett, ref error);
var where = sett.get("where");
if (where != "") {
int delim = where.IndexOf("*");
if (delim >= 0) {
before_ = where.Substring(0, delim);
after_ = where.Substring(delim + 1);
} else
before_ = where;
}
var value_type = sett.get("value", "int");
is_int_ = value_type != "double";
for (int idx = 0;; ++idx) {
var compare_str = sett.get("compare" + (idx > 0 ? "" + (idx + 1) : ""));
if (compare_str == "")
break;
var compare_parts = compare_str.Split(',');
if (compare_parts.Length != 4) {
error = "Invalid compare string: " + compare_str;
break;
}
compare comp = new compare();
// read the number
bool ok1 = double.TryParse(compare_parts[0], out comp.compare_double);
bool ok2 = long.TryParse(compare_parts[0], out comp.compare_int);
if (!ok1 && !ok2) {
error = "Invalid compare string: " + compare_str;
break;
}
if (ok1 && !ok2)
try {
comp.compare_int = (long) comp.compare_double;
} catch {}
if ( compare_parts[1] != "-")
comp.less = text_part.from_friendly_string(compare_parts[1]);
if ( compare_parts[2] != "-")
comp.equal = text_part.from_friendly_string(compare_parts[2]);
if ( compare_parts[3] != "-")
comp.greater = text_part.from_friendly_string(compare_parts[3]);
compare_.Add(comp);
}
}
bool PatternMatch(ref Sensor_data[,] s_data, int row, int col)
{
int[] dirX = new int[] { -1, 0, 1, -1, 1, -1, 0, 1 };
int[] dirY = new int[] { -1, -1, -1, 0, 0, 1, 1, 1 };
compare[] com = new compare[] { compare.more_equal, compare.more_equal, compare.more_equal, compare.more, compare.more_equal, compare.more, compare.more, compare.more };
short mid = get_date(ref s_data, row, col).value;
if (mid < peak)
{
return(false);
}
for (int d = 0; d < dirX.Length; ++d)
{
int tr = row + dirY[d];
int tc = col + dirX[d];
if (!Sensor_data.BoundaryCheck(tr, tc))
{
continue;
}
switch (com[d])
{
case compare.more:
if (get_date(ref s_data, tr, tc).value > mid || get_date(ref s_data, tr, tc).is_peak)
{
return(false);
}
break;
case compare.more_equal:
if (get_date(ref s_data, tr, tc).value >= mid || get_date(ref s_data, tr, tc).is_peak)
{
return(false);
}
break;
default:
break;
}
}
get_date(ref s_data, row, col).is_peak = true;
return(true);
}
public static void bubble(int[] dataset, compare compare)
{
int i = 0;
int j = 0;
int temp = 0;
for (i = 0; i < dataset.Length - 1; i++)
{
for (j = 0; j < dataset.Length - (i + 1); j++)
{
if (compare(dataset[j], dataset[j + 1]) > 0)
{
temp = dataset[j + 1];
dataset[j + 1] = dataset[j];
dataset[j] = temp;
}
}
}
}
static int partition(List <int> list, compare fn, int left, int right)
{
var baseNum = list[left];
while (left < right)
{
while (left < right && fn(baseNum, list[right]) <= 0)
{
right--;
}
list[left] = list[right];
while (left < right && fn(list[left], baseNum) <= 0)
{
left++;
}
list[right] = list[left];
}
// leftIdx equals rightIdx
list[left] = baseNum;
return(left);
}
private static void Partition(List <T> v, ref int esq, ref int dir, compare <T> method)
{
T pivot = v[(esq + dir) / 2];
do
{
while (method(pivot, v[esq]))
{
esq++;
}
while (method(v[dir], pivot))
{
dir--;
}
if (esq <= dir)
{
T aux = v[esq];
v[esq] = v[dir];
v[dir] = aux;
esq++; dir--;
}
} while (esq < dir);
}
internal override void load_syntax(settings_as_string sett, ref string error)
{
base.load_syntax(sett, ref error);
var where = sett.get("where");
if (where != "")
{
int delim = where.IndexOf("*");
if (delim >= 0)
{
before_ = where.Substring(0, delim);
after_ = where.Substring(delim + 1);
}
else
{
before_ = where;
}
}
var value_type = sett.get("value", "int");
is_int_ = value_type != "double";
for (int idx = 0;; ++idx)
{
var compare_str = sett.get("compare" + (idx > 0 ? "" + (idx + 1) : ""));
if (compare_str == "")
{
break;
}
var compare_parts = compare_str.Split(',');
if (compare_parts.Length != 4)
{
error = "Invalid compare string: " + compare_str;
break;
}
compare comp = new compare();
// read the number
bool ok1 = double.TryParse(compare_parts[0], out comp.compare_double);
bool ok2 = long.TryParse(compare_parts[0], out comp.compare_int);
if (!ok1 && !ok2)
{
error = "Invalid compare string: " + compare_str;
break;
}
if (ok1 && !ok2)
{
try {
comp.compare_int = (long)comp.compare_double;
} catch {}
}
if (compare_parts[1] != "-")
{
comp.less = text_part.from_friendly_string(compare_parts[1]);
}
if (compare_parts[2] != "-")
{
comp.equal = text_part.from_friendly_string(compare_parts[2]);
}
if (compare_parts[3] != "-")
{
comp.greater = text_part.from_friendly_string(compare_parts[3]);
}
compare_.Add(comp);
}
}
public void comparararObjetosDelegate(compare comp)
{
comparararObjetos = comp;
}
public void compareNodesDelegate(compare <K> cmp)
{
compareElements = cmp;
}
static async Task<Tuple<long, string>> GetPullRequestBaselineRunSetId (Product product, string pullRequestURL, compare.Repository repository, Config config)
{
var gitHubClient = GitHubInterface.GitHubClient;
var match = Regex.Match (pullRequestURL, product.PullRequestRegexp);
if (match == null) {
Console.Error.WriteLine ("Error: Cannot parse pull request URL.");
Environment.Exit (1);
}
var pullRequestNumber = Int32.Parse (match.Groups [1].Value);
Console.WriteLine ("pull request {0}", pullRequestNumber);
var pullRequest = await gitHubClient.PullRequest.Get ("mono", "mono", pullRequestNumber);
var prRepo = pullRequest.Head.Repository.CloneUrl;
var prBranch = pullRequest.Head.Ref;
var prSha = repository.Fetch (prRepo, prBranch);
if (prSha == null) {
Console.Error.WriteLine ("Error: Could not fetch pull request branch {0} from repo {1}", prBranch, prRepo);
Environment.Exit (1);
}
var masterSha = repository.Fetch (product.GitRepositoryUrl, "master");
if (masterSha == null) {
Console.Error.WriteLine ("Error: Could not fetch master.");
Environment.Exit (1);
}
var baseSha = repository.MergeBase (prSha, masterSha);
if (baseSha == null) {
Console.Error.WriteLine ("Error: Could not determine merge base of pull request.");
Environment.Exit (1);
}
Console.WriteLine ("Merge base sha is {0}", baseSha);
var revList = repository.RevList (baseSha);
if (revList == null) {
Console.Error.WriteLine ("Error: Could not get rev-list for merge base {0}.", baseSha);
Environment.Exit (1);
}
Console.WriteLine ("{0} commits in rev-list", revList.Length);
// FIXME: also support `--machine`
var hostarch = compare.Utils.LocalHostnameAndArch ();
var machine = new Machine { Name = hostarch.Item1, Architecture = hostarch.Item2 };
JArray runsets = await HttpApi.GetRunsets (machine.Name, config.Name);
if (runsets == null) {
Console.Error.WriteLine ("Error: Could not get run sets.");
Environment.Exit (1);
}
var runSetIdsByCommits = new Dictionary<string, long> ();
foreach (var rs in runsets) {
var id = rs ["ID"].ToObject<long> ();
var commit = rs ["MainProduct"] ["Commit"].ToObject<string> ();
runSetIdsByCommits [commit] = id;
}
Console.WriteLine ("{0} run sets", runSetIdsByCommits.Count);
foreach (var sha in revList) {
if (runSetIdsByCommits.ContainsKey (sha)) {
Console.WriteLine ("tested base commit is {0}", sha);
return Tuple.Create (runSetIdsByCommits [sha], baseSha);
}
}
return null;
}
public static void StartQuickSort(List <T> v, compare <T> compareMethod)
{
QuickSort(v, 0, v.Count - 1, compareMethod);
}
public void compareElementsDelegate(compare cmp)
{
compareElements = cmp;
}
public bool CheckMovement(int fromX, int fromY, int toX, int toY, IPawn[,] gameBoardPositions)
{
PlayerSide currentSide = gameBoardPositions[fromX, fromY].GetPlayerSide();
int riverRow = currentSide == PlayerSide.BLACK ? 5 : 4;
compare myDelegate = null;
if (currentSide == PlayerSide.BLACK)
{
myDelegate = (i, j) => i < j;
}
else if (currentSide == PlayerSide.RED)
{
myDelegate = (i, j) => i > j;
}
if (myDelegate(toX, riverRow)) // Check if movement on row is not over the river.
{
// Check top right.
int posX = fromX - 1;
int posY = fromY + 1;
if (posX > -1 && posY < 9)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if ((posX - 1) == toX && (posY + 1) == toY)
{
return(true);
}
}
}
// Check top left.
posX = fromX - 1;
posY = fromY - 1;
if (posX > -1 && posY > -1)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if ((posX - 1) == toX && (posY - 1) == toY)
{
return(true);
}
}
}
// Check bottom right.
posX = fromX + 1;
posY = fromY + 1;
if (posX < 10 && posY < 9)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if ((posX + 1) == toX && (posY + 1) == toY)
{
return(true);
}
}
}
// Check bottom left.
posX = fromX + 1;
posY = fromY - 1;
if (posX < 10 && posY > -1)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if ((posX + 1) == toX && (posY - 1) == toY)
{
return(true);
}
}
}
}
return(false);
}
public bool[,] GetPossibleMovements(int fromX, int fromY, IPawn[,] gameBoardPositions)
{
bool[,] possiblePositionsOnGameBoard = new bool[10, 9];
PlayerSide currentSide = gameBoardPositions[fromX, fromY].GetPlayerSide();
int riverRow = currentSide == PlayerSide.BLACK ? 5 : 4;
compare myDelegate = null;
if (currentSide == PlayerSide.BLACK)
{
myDelegate = (i, j) => i < j;
}
else if (currentSide == PlayerSide.RED)
{
myDelegate = (i, j) => i > j;
}
// Check top right.
int posX = fromX - 1;
int posY = fromY + 1;
if (posX > -1 && posY < 9)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if (gameBoardPositions[(posX - 1), (posY + 1)].GetPlayerSide() != currentSide && myDelegate((posX - 1), riverRow))
{
possiblePositionsOnGameBoard[(posX - 1), (posY + 1)] = true;
}
}
}
// Check top left.
posX = fromX - 1;
posY = fromY - 1;
if (posX > -1 && posY > -1)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if (gameBoardPositions[(posX - 1), (posY - 1)].GetPlayerSide() != currentSide && myDelegate((posX - 1), riverRow))
{
possiblePositionsOnGameBoard[(posX - 1), (posY - 1)] = true;
}
}
}
// Check bottom right.
posX = fromX + 1;
posY = fromY + 1;
if (posX < 10 && posY < 9)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if (gameBoardPositions[(posX + 1), (posY + 1)].GetPlayerSide() != currentSide && myDelegate((posX + 1), riverRow))
{
possiblePositionsOnGameBoard[(posX + 1), (posY + 1)] = true;
}
}
}
// Check bottom left.
posX = fromX + 1;
posY = fromY - 1;
if (posX < 10 && posY > -1)
{
if (gameBoardPositions[posX, posY].GetPlayerSide() == PlayerSide.EMPTY)
{
if (gameBoardPositions[(posX + 1), (posY - 1)].GetPlayerSide() != currentSide && myDelegate((posX + 1), riverRow))
{
possiblePositionsOnGameBoard[(posX + 1), (posY - 1)] = true;
}
}
}
return(possiblePositionsOnGameBoard);
}
string GenerateTheBoard(int size)
{
int[,] array = new int[size, size];
for (int i = 0; i < size; i++)
{
for (int j = 0; j < size; j++)
{
array[i, j] = i;
}
}
compare[] newCompare = new compare[0];
int buff;
int last;
int n = size;
int randomTo = size;
int randomNumber;
var knownNumbers = new HashSet <int>();
string result = "";
for (int j = 0; j < size; j++)
{
// MessageBox.Show(j.ToString());
knownNumbers.Clear();
Array.Resize(ref newCompare, newCompare.Length + 1);
newCompare[j] = new compare();
randomNumber = rand.Next(0, randomTo);
buff = array[randomNumber, j];// заносим в буфер ферзя
newCompare[j].aNumber = buff;
newCompare[j].bNumber = j;
bool exit = false;
if (newCompare.Length > 1)
{
do
{
exit = false;
for (int t = newCompare.Length - 1; t > -1; t--)
{
if (t == j)
{
continue;
}
else
if ((newCompare[t].aNumber - newCompare[j].aNumber) == (newCompare[t].bNumber - newCompare[j].bNumber) ||
(newCompare[t].aNumber - newCompare[j].aNumber) * -1 == (newCompare[t].bNumber - newCompare[j].bNumber) ||
(newCompare[t].aNumber - newCompare[j].aNumber) == (newCompare[t].bNumber - newCompare[j].bNumber) * -1)
{
exit = true;
do
{
randomNumber = rand.Next(0, randomTo);
} while (!knownNumbers.Add(randomNumber));
buff = array[randomNumber, j];// заносим в буфер ферзя
newCompare[j].aNumber = buff;
// MessageBox.Show("СТОЛБЕЦ " +j+" сколько сгенерировано "+ knownNumbers.Count +"сколько можно: "+ randomTo);
if (knownNumbers.Count == randomTo && j != size - 1)
{
// knownNumbers.Clear();
WriteToFile(patch, GenerateTheBoard(10));
//MessageBox.Show("вызов");
}
if (j == size - 1)
{
MessageBox.Show("выход");
exit = false;
break;
}
}
// MessageBox.Show(newCompare[j].aNumber + " - " + newCompare[t].aNumber + " = " + (newCompare[j].aNumber - newCompare[t].aNumber).ToString() + "\n"
// + newCompare[j].bNumber + " - " + newCompare[t].bNumber + " = " + (newCompare[j].bNumber - newCompare[t].bNumber).ToString());
}
} while (exit == true);
}
last = array[n - 1, j];
for (int k = j; k < size; k++)
{
array[randomNumber, k] = last;// помещаем вместо ферзя последний элемент со столбца
}
array[n - 1, j] = buff;
n = n - 1;
if (randomTo > 1)
{
randomTo--;
}
}
for (int i = size - 1; i >= 0; i--)
{
for (int j = 0; j < size; j++)
{
result += "(" + array[i, j].ToString() + ", " + j + ");";
--i;
}
}
//resultLog.Text += result + "\r\n";
return(result);
}
public static void quickSort <T>(List <T> _list, Compare _order, compare _compare)
{
quickSort(_list, 0, _list.Count - 1, _order, _compare);
}
public static UserProfileModel MomoUser()
{
User momo = new User
{
Id = new Guid(),
Address = "Stains, France",
Birth = new DateTime(1994, 05, 25),
Description = "Je suis actuellement en master 2 Science et Technologie du Logiciel à la Sorbonne Université (anciennement Université Pierre et Marie Curie), " +
"et stagiaire en tant que développeur logiciel chez Sopra Steria.",
Facebook = "https://www.facebook.com/mohamed.diallo.752",
FirstName = "Mohamed",
Github = "https://github.com/mohamessi",
Image = "https://media.licdn.com/mpr/mpr/shrinknp_400_400/AAIA_wDGAAAAAQAAAAAAAAreAAAAJDhiZTI3MmU0LTYzZGEtNGJiNi1hMWIxLTBlOGZlYTUwYjBiOQ.jpg",
Login = "******",
Mail = "*****@*****.**",
Name = "DIALLO",
Password = "******",
Phone = "06 69 54 68 76"
};
List <Experience> experiences = new List <Experience>();
experiences.Add(new Experience
{
Start = new DateTime(2017, 09, 07),
End = new DateTime(2018, 02, 09),
Description = "Amelioration du moteur de recherche de zenpark",
Enterprise = "Zenpark",
IfEnd = true,
Job = "Developpeur Full Stack",
UserId = momo.Id
});
experiences.Add(new Experience
{
Start = new DateTime(2018, 03, 12),
End = new DateTime(2018, 09, 07),
Description = "",
Enterprise = "Sopra Steria",
IfEnd = true,
Job = "Developpeur Full Stack",
UserId = momo.Id
});
experiences.Add(new Experience
{
Start = new DateTime(2017, 01, 01),
End = new DateTime(2017, 05, 01),
Description = "Logiciel de Planification de tache de maintenace d'avion sous la direction de Karim Tekkal",
Enterprise = "Universite Paris Diderot",
IfEnd = true,
Job = "Developpeur Full Stack et Chef de project",
UserId = momo.Id
});
List <Education> educations = new List <Education>();
educations.Add(new Education
{
Deegree = "Licence Informatique",
Description = "Licence generale",
End = new DateTime(2016, 05, 01),
IfEnd = true,
Mention = "Assez Bien",
Place = "Universite Paris Diderot",
Start = new DateTime(2012, 09, 01),
UserId = momo.Id,
});
educations.Add(new Education
{
Deegree = "Baccalaureat Economique et Social",
Description = "",
End = new DateTime(2012, 05, 01),
IfEnd = true,
Mention = "",
Place = "Lycee Maurice Ravel",
Start = new DateTime(2012, 05, 01),
UserId = momo.Id,
});
educations.Add(new Education
{
Deegree = "Master 1 Informatique",
Description = "Specialite Langage et Programmation",
End = new DateTime(2017, 05, 30),
IfEnd = true,
Mention = "Assez Bien",
Place = "Universite Paris Diderot",
Start = new DateTime(2016, 09, 01),
UserId = momo.Id,
});
educations.Add(new Education
{
Deegree = "Master 2 Informatique",
Description = "Specialite Science et Technologie du Logiciel",
End = new DateTime(2018, 09, 07),
IfEnd = true,
Mention = "Assez Bien",
Place = "Sorbonne Université (Université Pierre et Marie Curie)",
Start = new DateTime(2017, 09, 01),
UserId = momo.Id,
});
List <SkillModel> skillModels = new List <SkillModel>();
Random r = new Random();
List <Skill> lp = new List <Skill>()
{
new Skill {
Name = "Java", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "C#", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Java EE", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Javascript", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = ".Net", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Bootstrap", Level = r.Next(30, 100), Image = "info"
},
};
List <Skill> outils = new List <Skill>()
{
new Skill {
Name = "Visual Studio", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Eclipse", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Android Studio", Level = r.Next(30, 100), Image = "info"
},
new Skill {
Name = "Javascript", Level = r.Next(30, 100), Image = "info"
},
};
List <Skill> methodes = new List <Skill>
{
new Skill {
Name = "Scrum", Level = 50, Image = "info"
},
new Skill {
Name = "Kanban", Level = 50, Image = "info"
},
new Skill {
Name = "Cycle en V", Level = 50, Image = "info"
},
};
List <Skill> langues = new List <Skill>
{
new Skill {
Name = "Français", Level = 100, Image = "info"
},
new Skill {
Name = "Anglais", Level = 75, Image = "info"
},
new Skill {
Name = "Allemand", Level = 25, Image = "info"
},
new Skill {
Name = "peul", Level = 80, Image = "info"
},
};
skillModels.Add(new SkillModel
{
Name = new SkillName {
Name = "Langages de Programation & Framework"
},
Skills = lp
});
skillModels.Add(new SkillModel
{
Name = new SkillName {
Name = "Outils"
},
Skills = outils
});
skillModels.Add(new SkillModel
{
Name = new SkillName {
Name = "Methode de Travail"
},
Skills = methodes,
});
skillModels.Add(new SkillModel
{
Name = new SkillName {
Name = "Langues"
},
Skills = langues
});
compare a = new compare(Compare);
return(new UserProfileModel
{
User = momo,
Experiences = experiences.OrderByDescending(e => e.Start).ToList(),
Educations = educations.OrderByDescending(e => e.Start).ToList(),
SkillModel = skillModels
});
}
public static void quickSort <T>(List <T> _list, int l, int r, Compare _order, compare _compare)
{
if (_list.Count == 0)
{
return;
}
int i, j;
T x;
i = l;
j = r;
x = _list[(l + r) / 2]; /* find pivot item */
while (true)
{
while ((_compare(_list[i], x) == _order))
{
i++;
}
while ((_compare(x, _list[j]) == _order))
{
j--;
}
if (i <= j)
{
swap(_list, i, j);
i++;
j--;
}
if (i > j)
{
break;
}
}
if (l < j)
{
quickSort(_list, l, j, _order, _compare);
}
if (i < r)
{
quickSort(_list, i, r, _order, _compare);
}
}
