public HttpResponseMessage GetVehicleNoByRiderId(HttpRequestMessage request, dist ownerID)
{
if (ownerID != null)
{
int VownerId = Convert.ToInt32(ownerID.distributorid);
return(request.CreateResponse(HttpStatusCode.OK, db.User_Vehicle.Where(x => x.userid == VownerId).ToList()));
}
else
{
return(request.CreateResponse(HttpStatusCode.BadRequest));
}
}//method end
private void radioButtonRel_CheckedChanged(object sender, EventArgs e)
{
if (radioButtonRel.Checked)
{
exp_valua.Visible = false;
exp_valua.Enabled = false;
label2.Visible = false;
}
else
{
exp_valua.Visible = true;
exp_valua.Enabled = true;
label2.Visible = true;
}
distribution = dist.REL; //релеевское
}
private void radioButtonExp_CheckedChanged(object sender, EventArgs e)
{
if (radioButtonExp.Checked)
{
exp_valua.Visible = false;
exp_valua.Enabled = false;
label2.Visible = false;
}
else
{
exp_valua.Visible = true;
exp_valua.Enabled = true;
label2.Visible = true;
}
distribution = dist.EXP; //экспоненциальное
}
public HttpResponseMessage GetUsersByOwnersId(HttpRequestMessage request, dist ownerID)
{
int VownerId = Convert.ToInt32(ownerID.distributorid);
return(request.CreateResponse(HttpStatusCode.OK, db.VTP_UsersBy_OwnerID(VownerId)));
}//method end
public HttpResponseMessage GetSalesTeambyDistributorId(HttpRequestMessage request, dist d)
{
if (string.Empty == d.distributorid)
{
return(new HttpResponseMessage(HttpStatusCode.BadRequest));
}
return(request.CreateResponse(HttpStatusCode.OK, db.GetSalesTeambyDistributorId(d.distributorid)));
}
if (lengthsq(camPos - data.position) < min(dist, availiableDistanceSqr) && MathLib.BoxIntersect(rotation, data.position, frustumPlanes, 6))
private void radioButtonLNorm_CheckedChanged(object sender, EventArgs e)
{
distribution = dist.LNORM; //логарифмически нормальное
}
//------------------------------------------------------------------------//
// Описание поведения элементов формы Form1 //
//------------------------------------------------------------------------//
//Присвоение перечислению distribution значения, соответствующего разным распределениям
//в зависимости от положения радиокнопок
private void radioButtonNorm_CheckedChanged(object sender, EventArgs e)
{
distribution = dist.NORM; //нормальное
}
public HttpResponseMessage DistributorUnsoldTagsCountVehicleClassWise(HttpRequestMessage request, dist obj)
{
try
{
if (String.IsNullOrEmpty(obj.distributorid))
{
return(new HttpResponseMessage(HttpStatusCode.BadRequest));
}
else
{
return(request.CreateResponse(HttpStatusCode.OK, db.DistributorUnSoldStock(obj.distributorid)));
}
}
catch (Exception ex)
{
return(request.CreateResponse(HttpStatusCode.InternalServerError, ex.Message));
}
}//method ends
public List <GameObject> doADijkstraLoop()
{
if (Q.FindAll(p => p.isRemoved).Count != Q.Count)
{
if (pivo.obj)
{
if (pivo.obj == initialVertex)
{
pivo.obj.GetComponent <SpriteRenderer>().color = Color.green;
}
else if (pivo.obj == finalVertex)
{
pivo.obj.GetComponent <SpriteRenderer>().color = Color.red;
}
else
{
pivo.obj.GetComponent <SpriteRenderer>().color = Color.white;
}
}
//Pega o vértice com a menor distância em Q:
dist min = new dist();
int pos = 0;
min.valor = int.MaxValue;
foreach (dist u in Q)
{
if (u.isRemoved == true)
{
continue;
}
if (u.valor < min.valor)
{
min.valor = u.valor;
pos = Q.FindIndex(a => a.obj == u.obj);
}
}
pivo = Q[pos];
dist asd = Q[pos];
asd.isRemoved = true;
pivo.obj.GetComponent <SpriteRenderer>().color = Color.yellow;
player.GetComponent <PlayerStatus>().onVertex = pivo.obj;
GetComponent <DecisionTree>().executeTree();
//Se for o finalVertex:
if (pivo.obj == finalVertex)
{
//Retorna o caminho de vertices:
dist aux = pivo;
List <GameObject> caminho = new List <GameObject>();
while (true)
{
caminho.Add(aux.obj);
if (aux.prev != null)
{
aux = Q.Find(p => p.obj == aux.prev);
}
else
{
break;
}
}
return(caminho);
}
Q[pos] = asd;
//Para cada um dos vizinhos 'v' do vértice atual:
foreach (Vertex.neighbor v in pivo.obj.GetComponent <Vertex>().neighbors)
{
//Caso ele não tenha sido removido:
if (Q.Find(p => p.obj == v.obj).isRemoved == false)
{
//Atualiza a distância de 'v' caso seja menor que a distância já presente nele:
int alt = Q.Find(p => p.obj == pivo.obj).valor + v.valor;
if (alt < Q.Find(p => p.obj == v.obj).valor)
{
index = Q.FindIndex(p => p.obj == v.obj);
dist aux;
aux = Q[index];
aux.valor = alt;
aux.prev = pivo.obj;
Q[index] = aux;
print("mudei o vertice " + v.obj.name + " para o valor " + Q[index].valor);
}
}
}
}
return(null);
}
