100 lines
3.4 KiB
C#
100 lines
3.4 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
using System.Runtime.InteropServices;
|
|
using Cpp2IlInjected;
|
|
using UnityEngine;
|
|
|
|
namespace Pathfinding
|
|
{
|
|
// Token: 0x020000F7 RID: 247
|
|
[Token(Token = "0x2000094")]
|
|
public static class PathUtilities
|
|
{
|
|
// Token: 0x0600082C RID: 2092 RVA: 0x00005A2C File Offset: 0x00003C2C
|
|
[Token(Token = "0x60006EA")]
|
|
[Address(RVA = "0x9D0FD0", Offset = "0x9CFFD0", VA = "0x1809D0FD0")]
|
|
public static bool IsPathPossible(GraphNode node1, GraphNode node2)
|
|
{
|
|
return default(bool);
|
|
}
|
|
|
|
// Token: 0x0600082D RID: 2093 RVA: 0x00005A44 File Offset: 0x00003C44
|
|
[Token(Token = "0x60006EB")]
|
|
[Address(RVA = "0x9D0CF0", Offset = "0x9CFCF0", VA = "0x1809D0CF0")]
|
|
public static bool IsPathPossible(List<GraphNode> nodes)
|
|
{
|
|
return default(bool);
|
|
}
|
|
|
|
// Token: 0x0600082E RID: 2094 RVA: 0x00005A5C File Offset: 0x00003C5C
|
|
[Token(Token = "0x60006EC")]
|
|
[Address(RVA = "0x9D0DD0", Offset = "0x9CFDD0", VA = "0x1809D0DD0")]
|
|
public static bool IsPathPossible(List<GraphNode> nodes, int tagMask)
|
|
{
|
|
return default(bool);
|
|
}
|
|
|
|
// Token: 0x0600082F RID: 2095 RVA: 0x00002050 File Offset: 0x00000250
|
|
[Token(Token = "0x60006ED")]
|
|
[Address(RVA = "0x9D06D0", Offset = "0x9CF6D0", VA = "0x1809D06D0")]
|
|
public static List<GraphNode> GetReachableNodes(GraphNode seed, int tagMask = -1, [Optional] Func<GraphNode, bool> filter)
|
|
{
|
|
return null;
|
|
}
|
|
|
|
// Token: 0x06000830 RID: 2096 RVA: 0x00002050 File Offset: 0x00000250
|
|
[Token(Token = "0x60006EE")]
|
|
[Address(RVA = "0x9CF3A0", Offset = "0x9CE3A0", VA = "0x1809CF3A0")]
|
|
public static List<GraphNode> BFS(GraphNode seed, int depth, int tagMask = -1, [Optional] Func<GraphNode, bool> filter)
|
|
{
|
|
return null;
|
|
}
|
|
|
|
// Token: 0x06000831 RID: 2097 RVA: 0x00002050 File Offset: 0x00000250
|
|
[Token(Token = "0x60006EF")]
|
|
[Address(RVA = "0x9D08B0", Offset = "0x9CF8B0", VA = "0x1809D08B0")]
|
|
public static List<Vector3> GetSpiralPoints(int count, float clearance)
|
|
{
|
|
return null;
|
|
}
|
|
|
|
// Token: 0x06000832 RID: 2098 RVA: 0x00005A74 File Offset: 0x00003C74
|
|
[Token(Token = "0x60006F0")]
|
|
[Address(RVA = "0x9D0C20", Offset = "0x9CFC20", VA = "0x1809D0C20")]
|
|
private static Vector3 InvoluteOfCircle(float a, float t)
|
|
{
|
|
return default(Vector3);
|
|
}
|
|
|
|
// Token: 0x06000833 RID: 2099 RVA: 0x00002082 File Offset: 0x00000282
|
|
[Token(Token = "0x60006F1")]
|
|
[Address(RVA = "0x9CF640", Offset = "0x9CE640", VA = "0x1809CF640")]
|
|
public static void GetPointsAroundPointWorld(Vector3 p, IRaycastableGraph g, List<Vector3> previousPoints, float radius, float clearanceRadius)
|
|
{
|
|
}
|
|
|
|
// Token: 0x06000834 RID: 2100 RVA: 0x00002082 File Offset: 0x00000282
|
|
[Token(Token = "0x60006F2")]
|
|
[Address(RVA = "0x9CF8F0", Offset = "0x9CE8F0", VA = "0x1809CF8F0")]
|
|
public static void GetPointsAroundPoint(Vector3 center, IRaycastableGraph g, List<Vector3> previousPoints, float radius, float clearanceRadius)
|
|
{
|
|
}
|
|
|
|
// Token: 0x06000835 RID: 2101 RVA: 0x00002050 File Offset: 0x00000250
|
|
[Token(Token = "0x60006F3")]
|
|
[Address(RVA = "0x9D0180", Offset = "0x9CF180", VA = "0x1809D0180")]
|
|
public static List<Vector3> GetPointsOnNodes(List<GraphNode> nodes, int count, float clearanceRadius = 0f)
|
|
{
|
|
return null;
|
|
}
|
|
|
|
// Token: 0x0400058B RID: 1419
|
|
[Token(Token = "0x40003F8")]
|
|
private static Queue<GraphNode> BFSQueue;
|
|
|
|
// Token: 0x0400058C RID: 1420
|
|
[Token(Token = "0x40003F9")]
|
|
private static Dictionary<GraphNode, int> BFSMap;
|
|
}
|
|
}
|