添加访问列表

Question

我想标记访问对象的列表。我是C＃和编程的初学者。 因此，我正在迭代对象列表，检查它们与飞机的距离，然后保存它们。但我需要检查，如果该对象已被访问或无..

的问题是在visitedTrees，我需要保存他们那里，这样，当我访问过的所有树对象我退出。

HashSet<Vector3> visitedTrees = new HashSet<Vector3>(); 
var stripes = new Dictionary<int, List<Transform>>(); 
int stripeNumber = 0; 

cameraPlane.SetNormalAndPosition(normal, view.camera.transform.position + normal * minDistance); 

int visited = 0; 

while (true) 
{ 
    bool reachedFarTree = false; 

    foreach (var gameObject in trees) 
    { 
     float distance = cameraPlane.GetDistanceToPoint(gameObject.transform.position); 
     Debug.Log("distances " + Mathf.Abs(distance)); 
     if (Mathf.Abs(distance) < 20) 
     { 
      List<Transform> treeStripes; 
      if (!stripes.TryGetValue(stripeNumber, out treeStripes)) 
      { 
       treeStripes = new List<Transform>(); 
       stripes[stripeNumber] = treeStripes; 
      } 

      treeStripes.Add(gameObject.transform); 
      if (!visitedTrees.Contains(gameObject.transform)) 
      { 
       visitedTrees.Add(gameObject.transform.position); 
       visited++; 
      } 
     } 

     if (visited == visitedTrees.Count) 
     { 
      reachedFarTree = true; 
     } 
    } 
    offset += 20; 
    cameraPlane.SetNormalAndPosition(normal, view.camera.transform.position + normal * offset); 
    stripeNumber++; 
    if(reachedFarTree) 
     break;   
} 

Answer 1

的问题是你实例：

HashSet<Vector3> visitedTrees = new HashSet<Vector3>(); 

，然后尝试查找：

if (!visitedTrees.Contains(gameObject.transform)) 

其中作为gameObject.Transform是类型的变换（矩阵）和HashSet的只能包含Vector3对象。

相反实例化：

HashSet<Transform> visitedTrees = new HashSet<Transform>(); 

OR

if (!visitedTrees.Contains(gameObject.transform.position)) 
{ 
     visitedTrees.Add(gameObject.transform.position); 
     visited++; 
} 

编辑

HashSet<Vector3> visitedTrees = new HashSet<Vector3>(); 
    var stripes = new Dictionary<int, List<Transform>>(); 
    int stripeNumber = 0; 

    cameraPlane.SetNormalAndPosition(normal, view.camera.transform.position + normal * minDistance); 

    int visited = 0; 

    while (true) 
    { 
     bool reachedFarTree = false; 

     foreach (var gameObject in trees) 
     { 
      float distance = cameraPlane.GetDistanceToPoint(gameObject.transform.position); 
      Debug.Log("distances " + Mathf.Abs(distance)); 
      if (Mathf.Abs(distance) < 20 + offset) 
      { 
       List<Transform> treeStripes; 
       if (!stripes.TryGetValue(stripeNumber, out treeStripes)) 
       { 
        treeStripes = new List<Transform>(); 
        stripes[stripeNumber] = treeStripes; 
       } 

       treeStripes.Add(gameObject.transform); 
       if (!visitedTrees.Contains(gameObject.transform.position)) 
       { 
        visitedTrees.Add(gameObject.transform.position); 
        visited++; 
       } 
      } 


     } 
     if (trees.Count >= visited) 
     { 
      reachedFarTree = true; 
     } 

     offset += 20; // may try for a smaller value 
     cameraPlane.SetNormalAndPosition(normal, view.camera.transform.position + normal * offset); 
      stripeNumber++; 
     if (reachedFarTree) 
      break; 
    }