private static void connectVents()
{
for (var i = 0; i < AllJackInTheBoxes.Count - 1; i++)
{
var a = AllJackInTheBoxes[i];
var b = AllJackInTheBoxes[i + 1];
a.vent.Right = b.vent;
b.vent.Left = a.vent;
}
// Connect first with last
AllJackInTheBoxes.First().vent.Left = AllJackInTheBoxes.Last().vent;
AllJackInTheBoxes.Last().vent.Right = AllJackInTheBoxes.First().vent;
}
private static Suite NewSuitePesquisa(Elemento el, System.Collections.Generic.List <Caso> casos)
{
Suite suitePesquisa = NewSuite(casos.Last().Nome + "[" + el.Nome + "]", SUITE_TRANSACAO_PESQUISA);
suitePesquisa.CasoLista = new System.Collections.Generic.List <Caso>(casos);
Caso casoPesquisa = new Caso();
casoPesquisa.Nome = FormatNome2(casos.Last().Nome, el.Nome, SUITE_TRANSACAO_PESQUISA);
Comando cmdClickpesquisar = ADDCMD_CLICK(el, 1);
casoPesquisa.ComandoLista.Add(cmdClickpesquisar);
casoPesquisa.ComandoLista.Add(ADDCMD_SWITCH_TO_LAST(2));
casoPesquisa.Transacao = GetTransacao(FormatNome2(casos.Last().Nome, el.Nome, SUITE_TRANSACAO_PESQUISA), TRANSACAO_MANTER);
Rule rule = new Rule {
Nome = "GENERICO", XPath = _XPATH_CONCEITO
};
List <Rule> rules = new System.Collections.Generic.List <Rule>();
rules.Add(rule);
casoPesquisa.Config.RuleLista = new List <Rule>(rules);
suitePesquisa.CasoLista.Add(casoPesquisa);
var els = _crl.Scrapp(suitePesquisa);
Comando cmdConfirmar = new Comando();
Comando cmdFechar = new Comando();
casoPesquisa.Transacao.ElementoLista = new List <Elemento>(els).Select(e => ElementoToElementoTransacao2(e)).ToList();
_crl.SuiteADD(suitePesquisa); _suites = _crl.SuiteList();
List <Comando> comandosInsertObrigatorio = ComandosInsertObrigatorios(casoPesquisa.Transacao.ElementoLista.Select(e => ElementoToElementoTransacao(e)).ToList(), 3);
foreach (var cmd in comandosInsertObrigatorio)
{
casoPesquisa.ComandoLista.Add(cmd);
}
foreach (var e in els.Select(e => e).ToList())
{
if (e.CodigoUi == "btnConfirmar")
{
cmdConfirmar = ADDCMD_CLICK(e, 5);
}
}
casoPesquisa.ComandoLista.Add(cmdConfirmar);
casoPesquisa.ComandoLista.Add(ADDCMDCLICK_BY_XPATH("//*[name()='td' and contains(@onclick,'SelecionarItem')][1]", 6));
casoPesquisa.ComandoLista = new List <Comando>(casoPesquisa.ComandoLista.OrderBy(e => e.Order).ToList());
_crl.SuiteADD(suitePesquisa); _suites = _crl.SuiteList();
return(suitePesquisa);
}
public OpType GetLastRecordType()
{
if (record.Count == 0)
{
return(OpType.Non);
}
else
{
return(record.Last().type);
}
}
private System.Collections.Generic.List <Gap> CalculateGaps(Vector2 gridPos, System.Collections.Generic.List <IsoTransform> worldObjects, float minGapThreshold = 0.1f)
{
var gapList = new System.Collections.Generic.List <Gap>();
worldObjects.Sort((a, b) => a == b ? 0 : a.Min.y > b.Min.y ? 1 : -1);
for (int i = 0; i < worldObjects.Count; i++)
{
var nextHeight = worldObjects[i] == worldObjects.Last() ? MaxScanHeight : worldObjects[i + 1].Min.y;
if (worldObjects[i].Max.y >= nextHeight)
{
continue;
}
var gapStart = worldObjects[i].Max.y;
var gapEnd = nextHeight;
if (gapEnd - gapStart >= minGapThreshold)
{
gapList.Add(new Gap(gapStart, gapEnd, gridPos));
}
}
return(gapList);
}
}// end comboStrategy_SelectedIndexChanged
private void btnSubmit_Click(object sender, EventArgs e)
{
// For Ta-Lib
double[] priceArray = listOfPrices.ToArray();
int timeFrame = Convert.ToInt32(nbTimeFrame.Value);
// For IB
TWSLib.IContract ContractInfo = axTws1.createContract();
TWSLib.IOrder OrderInfo = axTws1.createOrder();
ContractInfo.conId = 0;
ContractInfo.symbol = tbSymbol.Text;
ContractInfo.secType = "STK";
ContractInfo.exchange = "SMART"; // Needs work
ContractInfo.primaryExchange = this.tbPrimaryExchange.Text;
ContractInfo.currency = "USD";
OrderInfo.orderId = int.Parse(this.tbOrderId.Text);
OrderInfo.action = this.tbAction.Text;
OrderInfo.totalQuantity = int.Parse(this.tbQuantity.Text);
OrderInfo.orderType = this.tbOrderType.Text;
OrderInfo.lmtPrice = double.Parse(this.tbLimitPrice.Text);
OrderInfo.timeInForce = "DAY";
int n = 0;
while (true) // Keep looping
{
// Run if a new price has been appended to the list
if (n != listOfPrices.Count())
{
if (strategyToApply == "smaCrossover")
{
int outBegIdxSma, outNbElementSma;
double[] outputSma = new double[priceArray.Length];
Core.Sma(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxSma, out outNbElementSma, outputSma);
if (outputSma.Last() < listOfPrices.Last())
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
else if (strategyToApply == "smaCrossunder")
{
int outBegIdxSma, outNbElementSma;
double[] outputSma = new double[priceArray.Length];
Core.Sma(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxSma, out outNbElementSma, outputSma);
if (outputSma.Last() > listOfPrices.Last())
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
else if (strategyToApply == "emaCrossover")
{
int outBegIdxEma, outNbElementEma;
double[] outputEma = new double[priceArray.Length];
Core.Ema(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxEma, out outNbElementEma, outputEma);
if (outputEma.Last() > listOfPrices.Last())
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
else if (strategyToApply == "emaCrossunder")
{
int outBegIdxEma, outNbElementEma;
double[] outputEma = new double[priceArray.Length];
Core.Ema(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxEma, out outNbElementEma, outputEma);
if (outputEma.Last() < listOfPrices.Last())
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
else if (strategyToApply == "rsiOverSold")
{
int outBegIdxRsi, outNbElementRsi;
double[] outputRsi = new double[priceArray.Length];
Core.Rsi(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxRsi, out outNbElementRsi, outputRsi);
if (outputRsi.Last() < 30)
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
else if (strategyToApply == "rsiOverBought")
{
int outBegIdxRsi, outNbElementRsi;
double[] outputRsi = new double[priceArray.Length];
Core.Rsi(0, listOfPrices.Count - 1, priceArray, timeFrame, out outBegIdxRsi, out outNbElementRsi, outputRsi);
if (outputRsi.Last() > 70)
{
this.axTws1.placeOrderEx(int.Parse(this.tbOrderId.Text), ContractInfo, OrderInfo);
}
}
n = listOfPrices.Count();
} // end: if (n != listOfPrices.Count())
} // end: while (true)
} // end btnSubmit_Click
public void KmeanPlusPlus(ref List <MyGrouping <int, Grade> > CentralPoint, System.Collections.Generic.List <IGrouping <int, Grade> > pointList)
{
Random ran = new Random(); // Khoi tao Student ID bat dau va ket thuc trong danh sach de random vi tri khoi tao
int startingStudentID = pointList.First().Key;
int endingStudentID = pointList.Last().Key;
var temporaryVariable = new MyGrouping <int, Grade>(); // Khoi tao central point dau tien bang cach random
CentralPoint.Add(temporaryVariable);
int kmeanPlusPlusInitializePoint = ran.Next(startingStudentID, endingStudentID);
var TheFisrtPoint = CentralPoint[0];
CopyPoint(ref TheFisrtPoint, pointList.Single(c => c.Key == kmeanPlusPlusInitializePoint));
int Count = 1; // Da ton tai san 1 central point
while (true) // Bat dau tim cac central point con lai
{
if (Count == ClusterAmount) // Thoa so luong cluster yeu cau thi break
{
break;
}
List <MyGrouping <double?, Grade> > MinDistanceList = new List <MyGrouping <double?, Grade> >(); // Khoi tao List chua khoang cach be nhat den central point gan nhat cua tat cac cac point
foreach (var point in pointList)
{
List <double?> Result = new List <double?>(); // List chua khoang cach den tung central point cua 1 diem
for (int i = 0; i < Count; i++)
{
var temp = 0;
Result.Add(temp);
}
for (int i = 0; i < this.SubjectAmount; i++) // Cong thuc tinh khoang cach, nhung khong tinh cang bac 2
{
for (int j = 0; j < Count; j++)
{
Result[j] += (point.ElementAt(i).Mark - CentralPoint[j].ElementAt(i).Mark) * (point.ElementAt(i).Mark - CentralPoint[j].ElementAt(i).Mark);
}
}
double?minResult = Result[0]; // Tim ra khoang cach be nhat
for (int i = 0; i < Count; i++)
{
if (Result[i] < minResult)
{
minResult = Result[i];
}
}
MyGrouping <double?, Grade> temporaryCentralPoint = new MyGrouping <double?, Grade>(); // khoi tao 1 instance dai dien cho 1 point voi key la khoang cach ngan nhat toi central point gan nhat cua point do
temporaryCentralPoint.Key = minResult;
for (int j = 0; j < this.SubjectAmount; j++)
{
temporaryCentralPoint.Add(new Grade {
});
}
int elementCount = 0;
foreach (var c in temporaryCentralPoint)
{
temporaryCentralPoint.ElementAt(elementCount).Mark = point.ElementAt(elementCount).Mark;
elementCount++;
}
MinDistanceList.Add(temporaryCentralPoint);
}
IGrouping <double?, Grade> MaxPoint = MinDistanceList.First(); // Sau khi da co duoc ket qua khoang cach cua tung point den central point gan nhat cua no, ta se duyet het tat ca cac khoang cach nay va tim ra khoang cach lon nhat, point tuong ung se tro thanh point tiep theo
foreach (var Point in MinDistanceList) // key o day chinh la khoang cach giua 1 point va central point gan nhat cua no
{
if (Point.Key > MaxPoint.Key)
{
MaxPoint = Point;
}
}
var TemporaryPoint = new MyGrouping <int, Grade>(); // Copy point cac thanh phan trong 1 reference type variable sang 1 variable khac
CentralPoint.Add(TemporaryPoint);
for (int j = 0; j < this.SubjectAmount; j++)
{
CentralPoint[Count].Add(new Grade {
});
}
int gradeCount = 0;
foreach (var c in CentralPoint[Count])
{
CentralPoint[Count].ElementAt(gradeCount).Mark = MaxPoint.ElementAt(gradeCount).Mark;
gradeCount++;
}
Count++; // Them thanh cong 1 central point
}
return;
}
List<mTuple<bool, SubCalendarEvent>> stitchUnRestrictedSubCalendarEvent(TimeLine FreeBoundary, List<mTuple<bool, SubCalendarEvent>> restrictedSnugFitAvailable, Dictionary<TimeSpan, Dictionary<string, mTuple<bool, SubCalendarEvent>>> PossibleEntries, Dictionary<TimeSpan, mTuple<int, TimeSpanWithStringID>> CompatibleWithList, double Occupancy)
{
TimeLine[] AllFreeSpots = FreeBoundary.getAllFreeSlots();
int TotalEventsForThisTImeLine = 0;
if (FreeBoundary.End == new DateTime(2014, 04, 8, 17, 00, 0))
{
;
}
foreach (KeyValuePair<TimeSpan, mTuple<int, TimeSpanWithStringID>> eachKeyValuePair in CompatibleWithList)
{
TotalEventsForThisTImeLine += eachKeyValuePair.Value.Item1;
}
CompatibleWithList.Clear();
DateTime EarliestReferenceTIme = FreeBoundary.Start;
List<mTuple<bool, SubCalendarEvent>> FrontPartials = new System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>();
List<mTuple<bool, SubCalendarEvent>> EndPartials = new System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>();
Dictionary<DateTime, List<mTuple<bool, SubCalendarEvent>>> FrontPartials_Dict = new System.Collections.Generic.Dictionary<DateTime, System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>>();
Dictionary<DateTime, List<mTuple<bool, SubCalendarEvent>>> EndPartials_Dict = new System.Collections.Generic.Dictionary<DateTime, System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>>();
Dictionary<TimeSpan, Dictionary<string, mTuple<bool, SubCalendarEvent>>> PossibleEntries_Cpy = new Dictionary<TimeSpan, Dictionary<string, mTuple<bool, SubCalendarEvent>>>();
Dictionary<string, Dictionary<string, SubCalendarEvent>> CalendarIDAndNonPartialSubCalEvents = new Dictionary<string, Dictionary<string, SubCalendarEvent>>();//List of non partials for current Reference StartTime To End of FreeBoundary. Its gets updated with Partials once the earliest reference time passes the partial event start time
foreach (KeyValuePair<TimeSpan, Dictionary<string, mTuple<bool, SubCalendarEvent>>> eachKeyValuePair in PossibleEntries)//populates PossibleEntries_Cpy. I need a copy to maintain all references to PossibleEntries
{
Dictionary<string, mTuple<bool, SubCalendarEvent>> NewDictEntry = new Dictionary<string, mTuple<bool, SubCalendarEvent>>();
foreach (KeyValuePair<string, mTuple<bool, SubCalendarEvent>> KeyValuePair0 in eachKeyValuePair.Value)
{
mTuple<bool, SubCalendarEvent> MyEvent = KeyValuePair0.Value;
bool isInrestrictedSnugFitAvailable = false;
if (CompatibleWithList.ContainsKey(eachKeyValuePair.Key))
{
++CompatibleWithList[eachKeyValuePair.Key].Item1;
}
else
{
CompatibleWithList.Add(eachKeyValuePair.Key, new mTuple<int, TimeSpanWithStringID>(1, new TimeSpanWithStringID(KeyValuePair0.Value.Item2.ActiveDuration, KeyValuePair0.Value.Item2.ActiveDuration.Ticks.ToString())));
}
foreach (mTuple<bool, SubCalendarEvent> eachMtuple in restrictedSnugFitAvailable)//checks if event is in restricted list
{
if (eachMtuple.Item2.ID == MyEvent.Item2.ID)
{
isInrestrictedSnugFitAvailable = true;
break;
}
}
if (!isInrestrictedSnugFitAvailable)
{
NewDictEntry.Add(KeyValuePair0.Value.Item2.ID, KeyValuePair0.Value);
if (FreeBoundary.IsDateTimeWithin(KeyValuePair0.Value.Item2.getCalendarEventRange.Start))
{
FrontPartials.Add(KeyValuePair0.Value);
}
else
{
if (FreeBoundary.IsDateTimeWithin(KeyValuePair0.Value.Item2.getCalendarEventRange.End))
{
EndPartials.Add(KeyValuePair0.Value);
}
string CalLevel0ID = KeyValuePair0.Value.Item2.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(CalLevel0ID))
{
CalendarIDAndNonPartialSubCalEvents[CalLevel0ID].Add(KeyValuePair0.Value.Item2.ID, KeyValuePair0.Value.Item2);
}
else
{
//CalendarIDAndNonPartialSubCalEvents.Add(CalLevel0ID, new List<SubCalendarEvent>() { KeyValuePair0.Value.Item2 });
CalendarIDAndNonPartialSubCalEvents.Add(CalLevel0ID, new Dictionary<string, SubCalendarEvent>());
CalendarIDAndNonPartialSubCalEvents[CalLevel0ID].Add(KeyValuePair0.Value.Item2.ID, KeyValuePair0.Value.Item2);
}
}
}
}
if (NewDictEntry.Count > 0)
{ PossibleEntries_Cpy.Add(eachKeyValuePair.Key, NewDictEntry); }
}
FrontPartials = FrontPartials.OrderBy(obj => obj.Item2.getCalendarEventRange.Start).ToList();
EndPartials = EndPartials.OrderBy(obj => obj.Item2.getCalendarEventRange.End).ToList();
foreach (mTuple<bool, SubCalendarEvent> eachmTuple in FrontPartials)//populates FrontPartials_Dict in ordered manner since FrontPartials is ordered
{
if (FrontPartials_Dict.ContainsKey(eachmTuple.Item2.getCalendarEventRange.Start))
{
FrontPartials_Dict[eachmTuple.Item2.getCalendarEventRange.Start].Add(eachmTuple);
}
else
{
FrontPartials_Dict.Add(eachmTuple.Item2.getCalendarEventRange.Start, new System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>() { eachmTuple });
}
}
foreach (mTuple<bool, SubCalendarEvent> eachmTuple in EndPartials)//populates EndPartials_Dict in ordered manner since EndPartials is ordered
{
if (EndPartials_Dict.ContainsKey(eachmTuple.Item2.getCalendarEventRange.Start))
{
EndPartials_Dict[eachmTuple.Item2.getCalendarEventRange.Start].Add(eachmTuple);
}
else
{
EndPartials_Dict.Add(eachmTuple.Item2.getCalendarEventRange.Start, new System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>() { eachmTuple });
}
}
List<SubCalendarEvent> CompleteArranegement = new System.Collections.Generic.List<SubCalendarEvent>();
int StartingReferneceIndex = 0;
/*foreach (mTuple<bool, SubCalendarEvent> eachmTuple in restrictedSnugFitAvailable)//removes the restricted from CompatibleWithList
{
--CompatibleWithList[eachmTuple.Item2.ActiveDuration.Ticks.ToString()].Item1;
//PossibleEntries_Cpy[eachmTuple.Item2.ActiveDuration.Ticks.ToString()].Remove(eachmTuple.Item2.ID);
}*/
List<DateTime> ListOfFrontPartialsStartTime = FrontPartials_Dict.Keys.ToList();
int i = 0;
int j = 0;
int FrontPartialCounter = 0;
if (restrictedSnugFitAvailable.Count < 1)
{
;
}
Tuple<DateTime, List<SubCalendarEvent>> TimeLineUpdated = null;
SubCalendarEvent BorderElementBeginning = null;
SubCalendarEvent BorderElementEnd = null;
SubCalendarEvent LastSubCalElementForEarlierReferenceTime = null;
int a = restrictedSnugFitAvailable.Count;
int previ = i;
for (; i < restrictedSnugFitAvailable.Count; i++)
{
//bool isFreeSpotBeforeRigid = AllFreeSpots[i].End <= restrictedSnugFitAvailable[i].Item2.Start;
TimeLineUpdated = null;
if (a != restrictedSnugFitAvailable.Count)
{
;
}
if (i == 9)
{
;
}
previ = i;
/*
restrictedSnugFitAvailable[i].Item2.PinSubEventsToStart(new TimeLine(EarliestReferenceTIme, restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End));
List<BusyTimeLine> RestrictedBusySlots = new System.Collections.Generic.List<BusyTimeLine>();
FreeBoundary = new TimeLine(FreeBoundary.Start, FreeBoundary.End);
foreach (mTuple<bool, SubCalendarEvent> eachmTuple in restrictedSnugFitAvailable)
{
eachmTuple.Item1 = true;
RestrictedBusySlots.Add(eachmTuple.Item2.ActiveSlot);
string timeSpanString = eachmTuple.Item2.ActiveDuration.Ticks.ToString();
string SubEventID = eachmTuple.Item2.ID;
}
FreeBoundary.AddBusySlots(RestrictedBusySlots.ToArray());
//eliminating excess comments
*/
int DateTimeCounter = 0;
List<SubCalendarEvent> LowestCostArrangement = new System.Collections.Generic.List<SubCalendarEvent>();
TimeLine PertinentFreeSpot = null;
TimeLine FreeSpotUpdated = null;
j = i + 1;
if (ListOfFrontPartialsStartTime.Count > 0)//fits any sub calEvent in preceeding restricting free spot
{
DateTime RestrictedStopper = restrictedSnugFitAvailable[i].Item2.Start;
bool breakForLoop = false;
bool PreserveRestrictedIndex = false;
bool ContinueTrestrictedSnugFitAvailableoForLoop = false;
for (; ((FrontPartialCounter < ListOfFrontPartialsStartTime.Count) && (i < restrictedSnugFitAvailable.Count)); FrontPartialCounter++)
{
TimeLineUpdated = null;
DateTime PertinentFreeSpotStart = EarliestReferenceTIme;
DateTime PertinentFreeSpotEnd;
if (restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.Start <= EarliestReferenceTIme)//this is to ensure the tightest configuration. If the restricted element calendarevent start range already preceedes the current start time then it can be appended immediately. because every other element is less restricted
{
CompleteArranegement.Add(restrictedSnugFitAvailable[i].Item2);
Utility.PinSubEventsToStart(CompleteArranegement, FreeBoundary);
EarliestReferenceTIme = CompleteArranegement[CompleteArranegement.Count - 1].End;
List<SubCalendarEvent> TempList = new List<SubCalendarEvent>() { restrictedSnugFitAvailable[i].Item2 };
ContinueTrestrictedSnugFitAvailableoForLoop = true;//forces the continuation of the for loop for (; i < restrictedSnugFitAvailable.Count; i++)
PreserveRestrictedIndex = false;
break;
}
if ((ListOfFrontPartialsStartTime[FrontPartialCounter] < RestrictedStopper))
{
PertinentFreeSpotEnd = ListOfFrontPartialsStartTime[FrontPartialCounter];
//FrontPartials_Dict.Remove(ListOfFrontPartialsStartTime[FrontPartialCounter]);
ListOfFrontPartialsStartTime.RemoveAt(FrontPartialCounter);
--FrontPartialCounter;
PreserveRestrictedIndex = true;
}
else
{
PertinentFreeSpotEnd = RestrictedStopper;
if (breakForLoop)
{//populates with final boundary for each restricted
/* PertinentFreeSpot = new TimeLine(PertinentFreeSpotStart, PertinentFreeSpotEnd);
BorderElementBeginning = CompleteArranegement.Count>0?CompleteArranegement[CompleteArranegement.Count-1]:null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = restrictedSnugFitAvailable[i].Item2;//uses restricted value as boundary element
LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy,Occupancy);
DateTime EarliestTimeForBetterEarlierReferenceTime = PertinentFreeSpot.Start;
LastSubCalElementForEarlierReferenceTime = ((CompleteArranegement.Count < 1) || (CompleteArranegement == null) ? null : CompleteArranegement[CompleteArranegement.Count - 1]);
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();
if (LowestCostArrangement.Count > 0)
{
if (!(LowestCostArrangement[0].getCalendarEventRange.Start == PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();// new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, PertinentFreeSpot);
}
EarliestReferenceTIme = PertinentFreeSpot.End;// LowestCostArrangement[LowestCostArrangement.Count - 1].End;
SubCalendarEvent LastSubCalEvent = LowestCostArrangement[LowestCostArrangement.Count - 1];
EarliestTimeForBetterEarlierReferenceTime = LastSubCalEvent.End;
LastSubCalElementForEarlierReferenceTime = LastSubCalEvent;
}
TimeLineUpdated = null;
TimeLineUpdated = ObtainBetterEarlierReferenceTime(LowestCostArrangement, CalendarIDAndNonPartialSubCalEvents, RestrictedStopper - EarliestTimeForBetterEarlierReferenceTime, EarliestReferenceTIme, new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End), LastSubCalElementForEarlierReferenceTime);
if (TimeLineUpdated != null)
{
LowestCostArrangement = TimeLineUpdated.Item2;
EarliestReferenceTIme = TimeLineUpdated.Item1;
}
foreach (SubCalendarEvent eachSubCalendarEvent in LowestCostArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
LowestCostArrangement = CompleteArranegement.Concat(LowestCostArrangement).ToList();
* *\//eliminating excess comments
*/
LowestCostArrangement = PlaceSubCalEventInLowestCostPosition(FreeBoundary, restrictedSnugFitAvailable[i].Item2, CompleteArranegement);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeBoundary);
CompleteArranegement = LowestCostArrangement;
EarliestReferenceTIme = LowestCostArrangement[LowestCostArrangement.Count - 1].End;
PreserveRestrictedIndex = false;
break;
}
--FrontPartialCounter;
if (j < restrictedSnugFitAvailable.Count)
{
RestrictedStopper = restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End > restrictedSnugFitAvailable[j].Item2.Start ? restrictedSnugFitAvailable[j].Item2.Start : restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End;
}
else
{
RestrictedStopper = restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End > FreeBoundary.End ? FreeBoundary.End : restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End;
}
RestrictedStopper -= restrictedSnugFitAvailable[i].Item2.ActiveDuration;
PertinentFreeSpotEnd = RestrictedStopper;//as a result of the comment sections with the string "elemenating excess comments"
breakForLoop = true;
}
PertinentFreeSpot = new TimeLine(PertinentFreeSpotStart, PertinentFreeSpotEnd);
BorderElementBeginning = CompleteArranegement.Count > 0 ? CompleteArranegement[CompleteArranegement.Count - 1] : null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = restrictedSnugFitAvailable[i].Item2;//uses restricted value as boundary element
LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy, Occupancy);
DateTime LatestDaterforEarlierReferenceTime = PertinentFreeSpot.Start;
LastSubCalElementForEarlierReferenceTime = ((CompleteArranegement.Count < 1) || (CompleteArranegement == null) ? null : CompleteArranegement[CompleteArranegement.Count - 1]);//updates the last element as either null or the last element in the current Complete arrangement
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();
if (LowestCostArrangement.Count > 0)
{
if (!(LowestCostArrangement[0].getCalendarEventRange.Start == PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
//FreeSpotUpdated = new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();
Utility.PinSubEventsToStart(LowestCostArrangement, PertinentFreeSpot);
}
EarliestReferenceTIme = PertinentFreeSpot.End;
///Comeback to this
///
SubCalendarEvent LastSubCalEvent = LowestCostArrangement[LowestCostArrangement.Count - 1];
LatestDaterforEarlierReferenceTime = LastSubCalEvent.End;
LastSubCalElementForEarlierReferenceTime = LastSubCalEvent;
}
TimeLineUpdated = null;
if (restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.Start > LatestDaterforEarlierReferenceTime)
{
TimeLineUpdated = ObtainBetterEarlierReferenceTime(LowestCostArrangement, CalendarIDAndNonPartialSubCalEvents, RestrictedStopper - LatestDaterforEarlierReferenceTime, EarliestReferenceTIme, new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End), LastSubCalElementForEarlierReferenceTime);
//errorline
if (TimeLineUpdated != null)
{
LowestCostArrangement = TimeLineUpdated.Item2;
EarliestReferenceTIme = TimeLineUpdated.Item1;
}
}
foreach (SubCalendarEvent eachSubCalendarEvent in LowestCostArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
CompleteArranegement.AddRange(LowestCostArrangement);
DateTimeCounter = 0;
for (; DateTimeCounter < FrontPartials_Dict.Keys.Count; DateTimeCounter++)//updates CalendarIDAndNonPartialSubCalEvents if frontpartial Startime has been passed. Alls updates FrontPartials_Dict
{
DateTime eachDateTIme = FrontPartials_Dict.Keys.ToList()[DateTimeCounter];
if (EarliestReferenceTIme >= eachDateTIme)
{
List<mTuple<bool, SubCalendarEvent>> mTUpleSubCalEvents = FrontPartials_Dict[eachDateTIme];
foreach (mTuple<bool, SubCalendarEvent> eachmTUple in mTUpleSubCalEvents)
{
string CalLevel0ID = eachmTUple.Item2.SubEvent_ID.getLevelID(0);
if (!CompleteArranegement.Contains(eachmTUple.Item2))
{
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(CalLevel0ID))
{
CalendarIDAndNonPartialSubCalEvents[CalLevel0ID].Add(eachmTUple.Item2.ID, eachmTUple.Item2);
}
else
{
//CalendarIDAndNonPartialSubCalEvents.Add(CalLevel0ID, new List<SubCalendarEvent>() { KeyValuePair0.Value.Item2 });
CalendarIDAndNonPartialSubCalEvents.Add(CalLevel0ID, new Dictionary<string, SubCalendarEvent>());
CalendarIDAndNonPartialSubCalEvents[CalLevel0ID].Add(eachmTUple.Item2.ID, eachmTUple.Item2);
}
}
}
FrontPartials_Dict.Remove(eachDateTIme);
}
}
//ListOfFrontPartialsStartTime = FrontPartials_Dict.Keys.ToList();
}
if (PreserveRestrictedIndex)//verifies if we took the path of restricted or front partial element. The latter needs a preservation of the current restricted Subcalevent index index
{
--i;
}
}
else
{//No FrontPartials
DateTime ReferenceEndTime = restrictedSnugFitAvailable[i].Item2.Start;
PertinentFreeSpot = new TimeLine(EarliestReferenceTIme, ReferenceEndTime);
BorderElementBeginning = CompleteArranegement.Count > 0 ? CompleteArranegement[CompleteArranegement.Count - 1] : null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = restrictedSnugFitAvailable[i].Item2;//uses restricted value as boundary element
LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy, Occupancy);
if (LowestCostArrangement.Count > 0)
{
if (!(LowestCostArrangement[0].getCalendarEventRange.Start == PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, PertinentFreeSpot);
}
EarliestReferenceTIme = LowestCostArrangement[LowestCostArrangement.Count - 1].End;
}
foreach (SubCalendarEvent eachSubCalendarEvent in LowestCostArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
List<SubCalendarEvent> AdditionalCOstArrangement = new System.Collections.Generic.List<SubCalendarEvent>();
DateTime RelativeEndTime;
if (j < restrictedSnugFitAvailable.Count)
{
//DateTime StartDateTimeAfterFitting = PertinentFreeSpot.End;
DateTime StartDateTimeAfterFitting = EarliestReferenceTIme;//this is the barring end time of the preceding boundary search. Earliest would have been updated if there was some event detected.
RelativeEndTime = restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End > restrictedSnugFitAvailable[j].Item2.Start ? restrictedSnugFitAvailable[j].Item2.Start : restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End;
RelativeEndTime -= restrictedSnugFitAvailable[i].Item2.ActiveDuration;
TimeLine CurrentlyFittedTimeLine = new TimeLine(StartDateTimeAfterFitting, RelativeEndTime);
BorderElementBeginning = CompleteArranegement.Count > 0 ? CompleteArranegement[CompleteArranegement.Count - 1] : null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = restrictedSnugFitAvailable[i].Item2;//uses restricted value as boundary element
AdditionalCOstArrangement = OptimizeArrangeOfSubCalEvent(CurrentlyFittedTimeLine, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy, Occupancy);
if (AdditionalCOstArrangement.Count > 0)
{//Additional get populated
if (!(AdditionalCOstArrangement[0].getCalendarEventRange.Start == CurrentlyFittedTimeLine.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, CurrentlyFittedTimeLine.End);
Utility.PinSubEventsToStart(AdditionalCOstArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = new TimeLine(AdditionalCOstArrangement[0].getCalendarEventRange.Start, CurrentlyFittedTimeLine.End);
Utility.PinSubEventsToStart(AdditionalCOstArrangement, FreeSpotUpdated);
}
foreach (SubCalendarEvent eachSubCalendarEvent in AdditionalCOstArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
RelativeEndTime = AdditionalCOstArrangement[AdditionalCOstArrangement.Count - 1].End;
RelativeEndTime += restrictedSnugFitAvailable[i].Item2.ActiveDuration; ;
CurrentlyFittedTimeLine = new TimeLine(FreeSpotUpdated.Start, RelativeEndTime);
//AdditionalCOstArrangement = PlaceSubCalEventInLowestCostPosition(CurrentlyFittedTimeLine, restrictedSnugFitAvailable[i].Item2, AdditionalCOstArrangement);
}
else
{//if there is no other Restricted in list
RelativeEndTime += restrictedSnugFitAvailable[i].Item2.ActiveDuration;
CurrentlyFittedTimeLine = new TimeLine(CurrentlyFittedTimeLine.Start, RelativeEndTime);
//AdditionalCOstArrangement = PlaceSubCalEventInLowestCostPosition(CurrentlyFittedTimeLine, restrictedSnugFitAvailable[i].Item2, AdditionalCOstArrangement);
}
}
else
{
RelativeEndTime = restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End > FreeBoundary.End ? FreeBoundary.End : restrictedSnugFitAvailable[i].Item2.getCalendarEventRange.End;
TimeLine CurrentlyFittedTimeLine = new TimeLine(EarliestReferenceTIme, RelativeEndTime);
//AdditionalCOstArrangement = PlaceSubCalEventInLowestCostPosition(CurrentlyFittedTimeLine, restrictedSnugFitAvailable[i].Item2, AdditionalCOstArrangement);
}
CompleteArranegement.AddRange(LowestCostArrangement);
CompleteArranegement.AddRange(AdditionalCOstArrangement);
TimeLine encasingTimeLine = new TimeLine(FreeBoundary.Start, RelativeEndTime);
CompleteArranegement = PlaceSubCalEventInLowestCostPosition(encasingTimeLine, restrictedSnugFitAvailable[i].Item2, CompleteArranegement);
Utility.PinSubEventsToStart(CompleteArranegement, FreeBoundary);
if (CompleteArranegement.Count > 0)
{
EarliestReferenceTIme = CompleteArranegement[CompleteArranegement.Count - 1].End;
}
}
}
{ //Handles THe Last Free Space outside of rigids
TimeLine FreeSpotOutSideRigids = new TimeLine(EarliestReferenceTIme, FreeBoundary.End);
TimeLine PertinentFreeSpot = new TimeLine(EarliestReferenceTIme, FreeBoundary.End); ;
TimeLine FreeSpotUpdated;
List<SubCalendarEvent> LowestCostArrangement;
if (ListOfFrontPartialsStartTime.Count > 0)
{
for (FrontPartialCounter = 0; FrontPartialCounter < ListOfFrontPartialsStartTime.Count; FrontPartialCounter++)
{
DateTime PertinentFreeSpotStart = EarliestReferenceTIme;
DateTime PertinentFreeSpotEnd;
PertinentFreeSpotEnd = ListOfFrontPartialsStartTime[FrontPartialCounter];
//FrontPartials_Dict.Remove(ListOfFrontPartialsStartTime[FrontPartialCounter]);
ListOfFrontPartialsStartTime.RemoveAt(FrontPartialCounter);
--FrontPartialCounter;
PertinentFreeSpot = new TimeLine(PertinentFreeSpotStart, PertinentFreeSpotEnd);
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();
BorderElementBeginning = CompleteArranegement.Count > 0 ? CompleteArranegement[CompleteArranegement.Count - 1] : null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = null;
LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy, Occupancy);
DateTime LatestTimeForBetterEarlierReferenceTime = PertinentFreeSpot.Start;
LastSubCalElementForEarlierReferenceTime = ((CompleteArranegement.Count < 1) || (CompleteArranegement == null) ? null : CompleteArranegement[CompleteArranegement.Count - 1]);
if (LowestCostArrangement.Count > 0)
{
if ((LowestCostArrangement[0].getCalendarEventRange.Start != PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();// new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
EarliestReferenceTIme = PertinentFreeSpot.End;// LowestCostArrangement[LowestCostArrangement.Count - 1].End;
SubCalendarEvent LastSubCalEvent = LowestCostArrangement[LowestCostArrangement.Count - 1];
LatestTimeForBetterEarlierReferenceTime = LastSubCalEvent.End;
LastSubCalElementForEarlierReferenceTime = LastSubCalEvent;
/*
Dictionary<string, double> AllValidNodes = CalendarEvent.DistanceToAllNodes(LastSubCalEvent.SubEvent_ID.getLevelID(0));
SubCalendarEvent AppendableEVent;
foreach (string eachstring in AllValidNodes.Keys)
{
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(eachstring))
{
AppendableEVent = CalendarIDAndNonPartialSubCalEvents[eachstring].ToList()[0].Value;//Assumes Theres Always an element
if ((AppendableEVent.ActiveDuration <= (FreeBoundary.End - LastSubCalEvent.End)) && (!LowestCostArrangement.Contains(AppendableEVent)))
{
LowestCostArrangement.Add(AppendableEVent);
CalendarIDAndNonPartialSubCalEvents[eachstring].Remove(AppendableEVent.ID);
if (CalendarIDAndNonPartialSubCalEvents[eachstring].Count < 1)//checks if List is empty. Deletes keyValuepair if list is empty
{
CalendarIDAndNonPartialSubCalEvents.Remove(eachstring);
}
FreeSpotUpdated = new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
EarliestReferenceTIme = AppendableEVent.End;
break;
}
}
}*/
}
TimeLineUpdated = null;
TimeLineUpdated = ObtainBetterEarlierReferenceTime(LowestCostArrangement, CalendarIDAndNonPartialSubCalEvents, FreeBoundary.End - LatestTimeForBetterEarlierReferenceTime, EarliestReferenceTIme, new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End), LastSubCalElementForEarlierReferenceTime);
if (TimeLineUpdated != null)
{
LowestCostArrangement = TimeLineUpdated.Item2;
EarliestReferenceTIme = TimeLineUpdated.Item1;
}
foreach (SubCalendarEvent eachSubCalendarEvent in LowestCostArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
CompleteArranegement.AddRange(LowestCostArrangement);
}
}
DateTime ReferenceEndTime = FreeBoundary.End;
PertinentFreeSpot = new TimeLine(EarliestReferenceTIme, ReferenceEndTime);
/*LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(null, null), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy);
if (LowestCostArrangement.Count > 0)
{
if (!(LowestCostArrangement[0].getCalendarEventRange.Start == PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();// new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
EarliestReferenceTIme = FreeSpotUpdated.End;// LowestCostArrangement[LowestCostArrangement.Count - 1].End;
}*/
BorderElementBeginning = CompleteArranegement.Count > 0 ? CompleteArranegement[CompleteArranegement.Count - 1] : null;//Checks if Complete arrangement has partially being filled. Sets Last elements as boundary Element
BorderElementEnd = null;
LowestCostArrangement = OptimizeArrangeOfSubCalEvent(PertinentFreeSpot, new Tuple<SubCalendarEvent, SubCalendarEvent>(BorderElementBeginning, BorderElementEnd), CompatibleWithList.Values.ToList(), PossibleEntries_Cpy, Occupancy);
LastSubCalElementForEarlierReferenceTime = ((CompleteArranegement.Count < 1) || (CompleteArranegement == null) ? null : CompleteArranegement[CompleteArranegement.Count - 1]);
DateTime LimitForBetterEarlierReferencTime = EarliestReferenceTIme;
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();
if (LowestCostArrangement.Count > 0)
{
if ((LowestCostArrangement[0].getCalendarEventRange.Start != PertinentFreeSpot.Start))//Pin SubEvents To Start
{//if the first element is not a partial Sub Cal Event element
FreeSpotUpdated = new TimeLine(EarliestReferenceTIme, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
}
else
{
FreeSpotUpdated = PertinentFreeSpot.CreateCopy();// new TimeLine(LowestCostArrangement[0].getCalendarEventRange.Start, PertinentFreeSpot.End);
Utility.PinSubEventsToStart(LowestCostArrangement, PertinentFreeSpot);
}
EarliestReferenceTIme = PertinentFreeSpot.End;// LowestCostArrangement[LowestCostArrangement.Count - 1].End;
SubCalendarEvent LastSubCalEvent = LowestCostArrangement[LowestCostArrangement.Count - 1];
LimitForBetterEarlierReferencTime = LastSubCalEvent.End;
LastSubCalElementForEarlierReferenceTime = LastSubCalEvent;
/*
Dictionary<string, double> AllValidNodes = CalendarEvent.DistanceToAllNodes(LastSubCalEvent.SubEvent_ID.getLevelID(0));
SubCalendarEvent AppendableEVent;
foreach (string eachstring in AllValidNodes.Keys)
{
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(eachstring))
{
AppendableEVent = CalendarIDAndNonPartialSubCalEvents[eachstring].ToList()[0].Value;//Assumes Theres Always an element
if ((AppendableEVent.ActiveDuration <= (FreeBoundary.End - LastSubCalEvent.End)) && (!LowestCostArrangement.Contains(AppendableEVent)))
{
LowestCostArrangement.Add(AppendableEVent);
CalendarIDAndNonPartialSubCalEvents[eachstring].Remove(AppendableEVent.ID);
if (CalendarIDAndNonPartialSubCalEvents[eachstring].Count < 1)//checks if List is empty. Deletes keyValuepair if list is empty
{
CalendarIDAndNonPartialSubCalEvents.Remove(eachstring);
}
FreeSpotUpdated = new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End);
Utility.PinSubEventsToStart(LowestCostArrangement, FreeSpotUpdated);
EarliestReferenceTIme = AppendableEVent.End;
break;
}
}
}*/
}
TimeLineUpdated = null;
TimeLineUpdated = ObtainBetterEarlierReferenceTime(LowestCostArrangement, CalendarIDAndNonPartialSubCalEvents, FreeBoundary.End - LimitForBetterEarlierReferencTime, EarliestReferenceTIme, new TimeLine(FreeSpotUpdated.Start, FreeBoundary.End), LastSubCalElementForEarlierReferenceTime);
if (TimeLineUpdated != null)
{
LowestCostArrangement = TimeLineUpdated.Item2;
EarliestReferenceTIme = TimeLineUpdated.Item1;
}
foreach (SubCalendarEvent eachSubCalendarEvent in LowestCostArrangement)
{
--CompatibleWithList[eachSubCalendarEvent.ActiveDuration].Item1;
PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Remove(eachSubCalendarEvent.ID);
string SubCalString = eachSubCalendarEvent.SubEvent_ID.getLevelID(0);
if (CalendarIDAndNonPartialSubCalEvents.ContainsKey(SubCalString))
{
CalendarIDAndNonPartialSubCalEvents[SubCalString].Remove(eachSubCalendarEvent.ID);
if (CalendarIDAndNonPartialSubCalEvents[SubCalString].Count < 1)
{
CalendarIDAndNonPartialSubCalEvents.Remove(SubCalString);
}
}
if (PossibleEntries_Cpy[eachSubCalendarEvent.ActiveDuration].Count < 1)
{
PossibleEntries_Cpy.Remove(eachSubCalendarEvent.ActiveDuration);
}
}
CompleteArranegement.AddRange(LowestCostArrangement);
}
if(CompleteArranegement.Count>0)
{
Utility.PinSubEventsToStart(CompleteArranegement,FreeBoundary);
TimeLine newFreeBoundary= new TimeLine( CompleteArranegement.Last().End,FreeBoundary.End);
List<mTuple<bool, SubCalendarEvent>> newRestricted=new List<mTuple<bool,SubCalendarEvent>>();
Dictionary<TimeSpan, mTuple<int, TimeSpanWithStringID>> newCompatibleWithList =new Dictionary<TimeSpan,mTuple<int,TimeSpanWithStringID>>();
IEnumerable<SubCalendarEvent> PossibleEntriesWhatsLeft= PossibleEntries_Cpy.Select(obj=>obj.Value).SelectMany(obj=>obj.Values).Select(obj=>obj.Item2).Where(obj=>obj.canExistWithinTimeLine(newFreeBoundary));
if(PossibleEntriesWhatsLeft.Count()>0)
{
CompleteArranegement.AddRange(stitchUnRestrictedSubCalendarEvent(newFreeBoundary, newRestricted, PossibleEntries_Cpy, newCompatibleWithList, Occupancy).Select(obj=>obj.Item2));
}
}
List<mTuple<bool, SubCalendarEvent>> retValue = new System.Collections.Generic.List<mTuple<bool, SubCalendarEvent>>();
foreach (SubCalendarEvent eachSubCalendarEvent in CompleteArranegement)
{
PossibleEntries[eachSubCalendarEvent.ActiveDuration][eachSubCalendarEvent.ID].Item1 = true;
retValue.Add(PossibleEntries[eachSubCalendarEvent.ActiveDuration][eachSubCalendarEvent.ID]);
}
//List<List<SubCalendarEvent>> unrestrictedValidCombinations = generateCombinationForDifferentEntries(CompatibleWithList, PossibleEntries);
retValue = reAlignSubCalEvents(FreeBoundary, retValue);
if (TotalEventsForThisTImeLine != retValue.Count)
{
;
}
return retValue;
}