npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

com.iron-mountain.wayfinding

v1.1.7

Published

AI pathfinding with referencable waypoints

Downloads

48

Readme

Wayfinding

Version: 1.1.6

Description:

AI pathfinding with referencable waypoints

Package Mirrors:

Key Scripts & Components:

  1. public class Waypoint : MonoBehaviour
    • Properties:
      • public WaypointReference Reference { get; set; }
      • public List Neighbors { get; }
    • Methods:
      • public void AddNeighbor(Waypoint neighbor)
      • public void RemoveNeighbor(Waypoint neighbor)
  2. public static class WaypointManager
  3. public class WaypointReference : ScriptableObject
    • Properties:
      • public String ID { get; set; }
      • public String Name { get; }
    • Methods:
      • public virtual void Reset()
  4. public class WaypointTraverser : MonoBehaviour
    • Actions:
      • public event Action OnMovingChanged
      • public event Action OnCurrentWaypointChanged
    • Properties:
      • public float Speed { get; set; }
      • public float Multiplier { get; set; }
      • public Vector3 Offset { get; set; }
      • public RotationType RotateWhenMoving { get; set; }
      • public RotationType RotateWhenStationary { get; set; }
      • public Transform LookAtTransform { get; set; }
      • public float RotationMultiplier { get; set; }
      • public Boolean Moving { get; }
      • public Waypoint CurrentWaypoint { get; set; }
      • public Waypoint DestinationWaypoint { get; set; }
    • Methods:
      • public void Initialize(Waypoint start, Waypoint destination)
      • public Vector3 GetDirection()
  5. public class WaypointTraverserAnimator : MonoBehaviour
    • Properties:
      • public Boolean AnimatorBoolValue { get; }
    • Methods:
      • public void SetBool(Boolean value)

Data Structures

  1. public class FastPriorityQueueNode
    • Properties:
      • public float Priority { get; }
      • public Int32 QueueIndex { get; }
      • public Object Queue { get; }
  2. public class FastPriorityQueue`1
    • Properties:
      • public Int32 Count { get; }
      • public Int32 MaxSize { get; }
      • public T First { get; }
    • Methods:
      • public virtual void Clear()
      • public virtual Boolean Contains(T node)
      • public virtual void Enqueue(T node, float priority)
      • public virtual T Dequeue()
      • public virtual void Resize(Int32 maxNodes)
      • public virtual void UpdatePriority(T node, float priority)
      • public virtual void Remove(T node)
      • public virtual void ResetNode(T node)
      • public virtual IEnumerator`1 GetEnumerator()
      • public Boolean IsValidQueue()
  3. public class GenericPriorityQueueNode`1
    • Properties:
      • public TPriority Priority { get; }
      • public Int32 QueueIndex { get; }
      • public Int64 InsertionIndex { get; }
      • public Object Queue { get; }
  4. public class GenericPriorityQueue`2
    • Properties:
      • public Int32 Count { get; }
      • public Int32 MaxSize { get; }
      • public TItem First { get; }
    • Methods:
      • public virtual void Clear()
      • public virtual Boolean Contains(TItem node)
      • public virtual void Enqueue(TItem node, TPriority priority)
      • public virtual TItem Dequeue()
      • public virtual void Resize(Int32 maxNodes)
      • public virtual void UpdatePriority(TItem node, TPriority priority)
      • public virtual void Remove(TItem node)
      • public virtual void ResetNode(TItem node)
      • public virtual IEnumerator`1 GetEnumerator()
      • public Boolean IsValidQueue()
  5. public interface IPriorityQueue`2
    • Properties:
      • public TItem First { get; }
      • public Int32 Count { get; }
    • Methods:
      • public abstract void Enqueue(TItem node, TPriority priority)
      • public abstract TItem Dequeue()
      • public abstract void Clear()
      • public abstract Boolean Contains(TItem node)
      • public abstract void Remove(TItem node)
      • public abstract void UpdatePriority(TItem node, TPriority priority)
  6. public class **SimplePriorityQueue1** : SimplePriorityQueue2
  7. public class SimplePriorityQueue`2
    • Properties:
      • public Int32 Count { get; }
      • public TItem First { get; }
    • Methods:
      • public virtual void Clear()
      • public virtual Boolean Contains(TItem item)
      • public virtual TItem Dequeue()
      • public virtual void Enqueue(TItem item, TPriority priority)
      • public Boolean EnqueueWithoutDuplicates(TItem item, TPriority priority)
      • public virtual void Remove(TItem item)
      • public virtual void UpdatePriority(TItem item, TPriority priority)
      • public TPriority GetPriority(TItem item)
      • public Boolean TryFirst(TItem& first)
      • public Boolean TryDequeue(TItem& first)
      • public Boolean TryRemove(TItem item)
      • public Boolean TryUpdatePriority(TItem item, TPriority priority)
      • public Boolean TryGetPriority(TItem item, TPriority& priority)
      • public virtual IEnumerator`1 GetEnumerator()
      • public Boolean IsValidQueue()
  8. public class StablePriorityQueueNode : FastPriorityQueueNode
    • Properties:
      • public Int64 InsertionIndex { get; }
  9. public class StablePriorityQueue`1
    • Properties:
      • public Int32 Count { get; }
      • public Int32 MaxSize { get; }
      • public T First { get; }
    • Methods:
      • public virtual void Clear()
      • public virtual Boolean Contains(T node)
      • public virtual void Enqueue(T node, float priority)
      • public virtual T Dequeue()
      • public virtual void Resize(Int32 maxNodes)
      • public virtual void UpdatePriority(T node, float priority)
      • public virtual void Remove(T node)
      • public virtual void ResetNode(T node)
      • public virtual IEnumerator`1 GetEnumerator()
      • public Boolean IsValidQueue()