// Start is called before the first frame update
void Start()
{
//newTile.SetActive(false);
tileList = new List <TreeTileScript>();
skillTree = GetComponent <SkillTree>();
tileContainer.anchoredPosition = Vector2.zero; //localPosition = Vector3.zero;
brancheContainer.anchoredPosition = Vector2.zero;
var ids = new int[skillTree.Data.skills.Length];
for (int i = 0; i < ids.Length; i++)
{
ids[i] = skillTree.Data.skills[i].id;
}
Array.Sort(ids);
int numberOfLevel = Mathf.FloorToInt(ids[ids.Length - 1] / 100) + 1;
int[][] levels = new int[numberOfLevel][];
for (int i = 0; i < numberOfLevel; i++)
{
levels[i] = Array.FindAll(ids, c => (c >= (i * 100) && c < ((i + 1) * 100)));
// this as to be replaced with Array.Copy methode (better performance)
}
// l'arbre est plein (sans interval entre les Id et ID 0 est la racine
int itemsInRaw = Mathf.FloorToInt(Screen.width / 180);
int itemsInCurrentRaw = itemsInRaw;
int rawCounter = 0, gapCounter = 0;
int defaultHeight = 89 + 59, minHeight = 0, rawHeight = 118, gapHeight = 59;
int totalOfRaw = 0;
foreach (int[] i in levels)
{
totalOfRaw += Mathf.CeilToInt((float)i.Length / itemsInRaw);
}
// definition du cadre avant d'y inserer les elements;
var sizeContainers = defaultHeight + (gapHeight * numberOfLevel) + (118 * totalOfRaw);
tileContainer.sizeDelta = new Vector2(0, sizeContainers);
brancheContainer.sizeDelta = new Vector2(0, sizeContainers);
//Debug.Log("total of raws: " + totalOfRaw + "; total of levels: " + numberOfLevel);
foreach (int[] i in levels)
{
Array.Sort(i);
for (int j = 0; j < i.Length; j++)
{
rawCounter += j != 0 && j % itemsInRaw == 0 ? 1 : 0; // add line when 1 elem in raw (exept 1st of the level)
minHeight = defaultHeight + gapCounter * gapHeight;
itemsInCurrentRaw = (j >= (itemsInRaw * Mathf.FloorToInt(i.Length / itemsInRaw))) ? i.Length - (Mathf.FloorToInt(i.Length / itemsInRaw) * itemsInRaw) : itemsInRaw;
Vector2Int position = new Vector2Int(
(j % itemsInCurrentRaw) * 180 - (itemsInCurrentRaw * 90) + 90, // X
0 - (rawHeight * rawCounter) - minHeight); // Y
var newTile = Instantiate(treeTile, new Vector3(position.x, position.y, 0), Quaternion.identity, tileContainer.transform).GetComponent <TreeTileScript>();
var skill = skillTree.Data.GetSkill(i[j]);
newTile.initiate(
skill.name,
skill.description,
skill.cost.ToString(),
skillTree,
i[j],
skillTree.CanSkillBeUnlocked(i[j]),
gemText,
this,
position);
tileList.Add(newTile);
foreach (int k in skill.dependencies)
{
Vector2 positionRoot = tileList.Find(c => c.id == k).position;
Vector2 positionBeam = new Vector2((position.x + positionRoot.x) / 2, (position.y + positionRoot.y) / 2);
float rotation = Mathf.Rad2Deg * Mathf.Atan2(positionRoot.y - position.y, positionRoot.x - position.x);//Vector2.Angle(Vector2.zero, new Vector2(positionRoot.x - position.x, positionRoot.y - position.y));
RectTransform beamRect = Instantiate(
beam,
new Vector3(positionBeam.x, positionBeam.y, 1),
//Quaternion.FromToRotation(
// new Vector3(positionRoot.x, positionRoot.y),
// new Vector3(positionBeam.x, positionBeam.y)),
Quaternion.AngleAxis(-rotation, Vector3.back),
brancheContainer.transform).GetComponent <RectTransform>();
beamRect.SetSizeWithCurrentAnchors(RectTransform.Axis.Horizontal, Vector2.Distance(positionRoot, position));
//Debug.Log("beam of " + newTile.id + " from " + position.ToString() + " to " + positionBeam.ToString() + " with rotation: " + rotation);
}
}
gapCounter++;
rawCounter++;
}
}
