pub struct GKObstacleGraph<NodeType: ?Sized = AnyObject> { /* private fields */ }GKGraph and GKGraphNode and GKObstacleGraph only.Expand description
A collection of GKGraphNodes that are governed by a set of extruded GKPolygonObstacles
See also Apple’s documentation
Implementations§
Source§impl<NodeType: ?Sized + Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
Sourcepub unsafe fn cast_unchecked<NewNodeType: ?Sized + Message + AsRef<GKGraphNode2D>>(
&self,
) -> &GKObstacleGraph<NewNodeType>
pub unsafe fn cast_unchecked<NewNodeType: ?Sized + Message + AsRef<GKGraphNode2D>>( &self, ) -> &GKObstacleGraph<NewNodeType>
Unchecked conversion of the generic parameter.
§Safety
The generic must be valid to reinterpret as the given type.
Source§impl<NodeType: Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
impl<NodeType: Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
pub unsafe fn obstacles(&self) -> Retained<NSArray<GKPolygonObstacle>>
GKObstacle only.pub unsafe fn bufferRadius(&self) -> c_float
Sourcepub unsafe fn graphWithObstacles_bufferRadius(
obstacles: &NSArray<GKPolygonObstacle>,
buffer_radius: c_float,
) -> Retained<Self>
Available on crate feature GKObstacle only.
pub unsafe fn graphWithObstacles_bufferRadius( obstacles: &NSArray<GKPolygonObstacle>, buffer_radius: c_float, ) -> Retained<Self>
GKObstacle only.Creates an optimal bidirectional graph based on a list of obstacles. Each vertex of each obstacle is extruded and a connection is made between each vertex that does not intersect an obstacle Guaranteed not to have any edges which intersect obstacles. Same effect as [[GKObstacleGraph alloc] init], setting bufferRadius, and then calling addObstacles.
Parameter obstacles: a list of obstacles to create the graph from
Parameter bufferRadius: the circular radius of a potential agent that will navigate this graph. Obstacles are extruded by this amount to create the graph. Must be positive. Negative values are clipped to 0.0f
pub unsafe fn initWithObstacles_bufferRadius( this: Allocated<Self>, obstacles: &NSArray<GKPolygonObstacle>, buffer_radius: c_float, ) -> Retained<Self>
GKObstacle only.Sourcepub unsafe fn graphWithObstacles_bufferRadius_nodeClass(
obstacles: &NSArray<GKPolygonObstacle>,
buffer_radius: c_float,
node_class: &AnyClass,
) -> Retained<Self>
Available on crate feature GKObstacle only.
pub unsafe fn graphWithObstacles_bufferRadius_nodeClass( obstacles: &NSArray<GKPolygonObstacle>, buffer_radius: c_float, node_class: &AnyClass, ) -> Retained<Self>
GKObstacle only.Creates an optimal bidirectional graph based on a list of obstacles. Each vertex of each obstacle is extruded and a connection is made between each vertex that does not intersect an obstacle Guaranteed not to have any edges which intersect obstacles. Same effect as [[GKObstacleGraph alloc] init], setting bufferRadius, and then calling addObstacles.
Parameter obstacles: a list of obstacles to create the graph from
Parameter bufferRadius: the circular radius of a potential agent that will navigate this graph. Obstacles are extruded by this amount to create the graph. Must be positive. Negative values are clipped to 0.0f
Parameter nodeClass: the class of the nodes that this graph should create. Must descend from GKGraphNode2D
§Safety
node_class probably has further requirements.
Sourcepub unsafe fn initWithObstacles_bufferRadius_nodeClass(
this: Allocated<Self>,
obstacles: &NSArray<GKPolygonObstacle>,
buffer_radius: c_float,
node_class: &AnyClass,
) -> Retained<Self>
Available on crate feature GKObstacle only.
pub unsafe fn initWithObstacles_bufferRadius_nodeClass( this: Allocated<Self>, obstacles: &NSArray<GKPolygonObstacle>, buffer_radius: c_float, node_class: &AnyClass, ) -> Retained<Self>
GKObstacle only.§Safety
node_class probably has further requirements.
Sourcepub unsafe fn connectNodeUsingObstacles(&self, node: &NodeType)
pub unsafe fn connectNodeUsingObstacles(&self, node: &NodeType)
Connects the node to this graph by testing edge intersection with existing obstacles. Same behavior as if this node had been present during initWithObstacles.
Parameter node: the node to connect
Sourcepub unsafe fn connectNodeUsingObstacles_ignoringObstacles(
&self,
node: &NodeType,
obstacles_to_ignore: &NSArray<GKPolygonObstacle>,
)
Available on crate feature GKObstacle only.
pub unsafe fn connectNodeUsingObstacles_ignoringObstacles( &self, node: &NodeType, obstacles_to_ignore: &NSArray<GKPolygonObstacle>, )
GKObstacle only.Same behavior as connectNodeUsingObstacles: except you can optionally ignore certain obstacles from being tested for intersection.
Sourcepub unsafe fn connectNodeUsingObstacles_ignoringBufferRadiusOfObstacles(
&self,
node: &NodeType,
obstacles_buffer_radius_to_ignore: &NSArray<GKPolygonObstacle>,
)
Available on crate feature GKObstacle only.
pub unsafe fn connectNodeUsingObstacles_ignoringBufferRadiusOfObstacles( &self, node: &NodeType, obstacles_buffer_radius_to_ignore: &NSArray<GKPolygonObstacle>, )
GKObstacle only.Same behavior as connectNodeUsingObstacles: except you can optionally ignore the bounding radius of certain obstacles from being tested for intersection
Sourcepub unsafe fn addObstacles(&self, obstacles: &NSArray<GKPolygonObstacle>)
Available on crate feature GKObstacle only.
pub unsafe fn addObstacles(&self, obstacles: &NSArray<GKPolygonObstacle>)
GKObstacle only.Adds obstacles to this graph. Obstacle is extruded and graph nodes are generated from its vertices and then connected to this graph Nothing is done if an obstacle is already present in this graph Any existing connections that intersect the new obstacles are destroyed unless they are protected with [GKObstacleGraph lockConnection:]
Parameter obstacles: an array of obstacles to be added
See: lockConnection
Sourcepub unsafe fn removeObstacles(&self, obstacles: &NSArray<GKPolygonObstacle>)
Available on crate feature GKObstacle only.
pub unsafe fn removeObstacles(&self, obstacles: &NSArray<GKPolygonObstacle>)
GKObstacle only.Removes obstacles from this graph. All associated graph nodes are removed and their connections are bidirectionally removed. Connections between obstacle nodes that were previously invalidated by any of these obstacles are restored. Nothing is done if an obstacle is already present in this graph
Parameter obstacles: an array of obstacles to be removed
Sourcepub unsafe fn removeAllObstacles(&self)
pub unsafe fn removeAllObstacles(&self)
Removes all obstacles from this graph.
Sourcepub unsafe fn nodesForObstacle(
&self,
obstacle: &GKPolygonObstacle,
) -> Retained<NSArray<NodeType>>
Available on crate feature GKObstacle only.
pub unsafe fn nodesForObstacle( &self, obstacle: &GKPolygonObstacle, ) -> Retained<NSArray<NodeType>>
GKObstacle only.Returns an array of the graph nodes associated with a given obstacle
Parameter obstacle: the obstacle who’s nodes are to be retrieved
Sourcepub unsafe fn lockConnectionFromNode_toNode(
&self,
start_node: &NodeType,
end_node: &NodeType,
)
pub unsafe fn lockConnectionFromNode_toNode( &self, start_node: &NodeType, end_node: &NodeType, )
Marks a connection as “locked”, preventing this connection from being destroyed when you add obstacles that would intersect it
Parameter startNode: startNode of the connection to lock
Parameter endNode: endNode of the connection to lock
Sourcepub unsafe fn unlockConnectionFromNode_toNode(
&self,
start_node: &NodeType,
end_node: &NodeType,
)
pub unsafe fn unlockConnectionFromNode_toNode( &self, start_node: &NodeType, end_node: &NodeType, )
“Unlocks” a connection, removing its protection from being destroyed when you add obstacles that would intersect it
Parameter startNode: startNode of the connection to unlock
Parameter endNode: endNode of the connection to unlock
See: lockConnection
Sourcepub unsafe fn isConnectionLockedFromNode_toNode(
&self,
start_node: &NodeType,
end_node: &NodeType,
) -> bool
pub unsafe fn isConnectionLockedFromNode_toNode( &self, start_node: &NodeType, end_node: &NodeType, ) -> bool
Query if a given connection is locked
Parameter startNode: startNode of the connection to query
Parameter endNode: endNode of the connection to query
See: lockConnection
See: unlockConnection
Returns: YES if the connection was locked with lockConnection, NO if it was never locked or was unlocked via unlockConnection
Sourcepub unsafe fn classForGenericArgumentAtIndex(
&self,
index: NSUInteger,
) -> &'static AnyClass
pub unsafe fn classForGenericArgumentAtIndex( &self, index: NSUInteger, ) -> &'static AnyClass
Returns the class of the specified generic index
Source§impl<NodeType: Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
Methods declared on superclass GKGraph.
impl<NodeType: Message + AsRef<GKGraphNode2D>> GKObstacleGraph<NodeType>
Methods declared on superclass GKGraph.
Sourcepub unsafe fn graphWithNodes(nodes: &NSArray<GKGraphNode>) -> Retained<Self>
pub unsafe fn graphWithNodes(nodes: &NSArray<GKGraphNode>) -> Retained<Self>
Creates a graph with the provided array of nodes.
Parameter nodes: the nodes to create the graph with
pub unsafe fn initWithNodes( this: Allocated<Self>, nodes: &NSArray<GKGraphNode>, ) -> Retained<Self>
Methods from Deref<Target = GKGraph>§
Sourcepub unsafe fn nodes(&self) -> Option<Retained<NSArray<GKGraphNode>>>
pub unsafe fn nodes(&self) -> Option<Retained<NSArray<GKGraphNode>>>
The list of nodes in this graph
Sourcepub unsafe fn connectNodeToLowestCostNode_bidirectional(
&self,
node: &GKGraphNode,
bidirectional: bool,
)
pub unsafe fn connectNodeToLowestCostNode_bidirectional( &self, node: &GKGraphNode, bidirectional: bool, )
Connects the node to this graph via the lowest cost node to reach in this graph
Parameter node: the node to connect
Parameter bidirectional: should the connection be bidirectional? Otherwise it is one way connected into the graph
Sourcepub unsafe fn removeNodes(&self, nodes: &NSArray<GKGraphNode>)
pub unsafe fn removeNodes(&self, nodes: &NSArray<GKGraphNode>)
Removes nodes from this graph. All connections starting and/or ending with this node are removed.
Parameter nodes: an array of nodes to be removed
Sourcepub unsafe fn addNodes(&self, nodes: &NSArray<GKGraphNode>)
pub unsafe fn addNodes(&self, nodes: &NSArray<GKGraphNode>)
Adds nodes to this graph. No new connections are added. If the node already exists in this graph this does nothing.
Parameter nodes: and array of nodes to be added
Sourcepub unsafe fn findPathFromNode_toNode(
&self,
start_node: &GKGraphNode,
end_node: &GKGraphNode,
) -> Retained<NSArray<GKGraphNode>>
pub unsafe fn findPathFromNode_toNode( &self, start_node: &GKGraphNode, end_node: &GKGraphNode, ) -> Retained<NSArray<GKGraphNode>>
Attempts to find the optimal path between the two nodes indicated. If such a path exists, it is returned in start to end order. If it doesn’t exist, the array returned will be empty. Asserts if neither of these nodes are in this graph. Use [GKGraphNode findPathFromNode:] instead.
Parameter startNode: node to start pathing from
Parameter endNode: goal node of the pathfinding attempt
Methods from Deref<Target = NSObject>§
Sourcepub fn doesNotRecognizeSelector(&self, sel: Sel) -> !
pub fn doesNotRecognizeSelector(&self, sel: Sel) -> !
Handle messages the object doesn’t recognize.
See Apple’s documentation for details.
Methods from Deref<Target = AnyObject>§
Sourcepub fn class(&self) -> &'static AnyClass
pub fn class(&self) -> &'static AnyClass
Dynamically find the class of this object.
§Panics
May panic if the object is invalid (which may be the case for objects
returned from unavailable init/new methods).
§Example
Check that an instance of NSObject has the precise class NSObject.
use objc2::ClassType;
use objc2::runtime::NSObject;
let obj = NSObject::new();
assert_eq!(obj.class(), NSObject::class());Sourcepub unsafe fn get_ivar<T>(&self, name: &str) -> &Twhere
T: Encode,
👎Deprecated: this is difficult to use correctly, use Ivar::load instead.
pub unsafe fn get_ivar<T>(&self, name: &str) -> &Twhere
T: Encode,
Ivar::load instead.Use Ivar::load instead.
§Safety
The object must have an instance variable with the given name, and it
must be of type T.
See Ivar::load_ptr for details surrounding this.
Sourcepub fn downcast_ref<T>(&self) -> Option<&T>where
T: DowncastTarget,
pub fn downcast_ref<T>(&self) -> Option<&T>where
T: DowncastTarget,
Attempt to downcast the object to a class of type T.
This is the reference-variant. Use Retained::downcast if you want
to convert a retained object to another type.
§Mutable classes
Some classes have immutable and mutable variants, such as NSString
and NSMutableString.
When some Objective-C API signature says it gives you an immutable class, it generally expects you to not mutate that, even though it may technically be mutable “under the hood”.
So using this method to convert a NSString to a NSMutableString,
while not unsound, is generally frowned upon unless you created the
string yourself, or the API explicitly documents the string to be
mutable.
See Apple’s documentation on mutability and on
isKindOfClass: for more details.
§Generic classes
Objective-C generics are called “lightweight generics”, and that’s because they aren’t exposed in the runtime. This makes it impossible to safely downcast to generic collections, so this is disallowed by this method.
You can, however, safely downcast to generic collections where all the
type-parameters are AnyObject.
§Panics
This works internally by calling isKindOfClass:. That means that the
object must have the instance method of that name, and an exception
will be thrown (if CoreFoundation is linked) or the process will abort
if that is not the case. In the vast majority of cases, you don’t need
to worry about this, since both root objects NSObject and
NSProxy implement this method.
§Examples
Cast an NSString back and forth from NSObject.
use objc2::rc::Retained;
use objc2_foundation::{NSObject, NSString};
let obj: Retained<NSObject> = NSString::new().into_super();
let string = obj.downcast_ref::<NSString>().unwrap();
// Or with `downcast`, if we do not need the object afterwards
let string = obj.downcast::<NSString>().unwrap();Try (and fail) to cast an NSObject to an NSString.
use objc2_foundation::{NSObject, NSString};
let obj = NSObject::new();
assert!(obj.downcast_ref::<NSString>().is_none());Try to cast to an array of strings.
use objc2_foundation::{NSArray, NSObject, NSString};
let arr = NSArray::from_retained_slice(&[NSObject::new()]);
// This is invalid and doesn't type check.
let arr = arr.downcast_ref::<NSArray<NSString>>();This fails to compile, since it would require enumerating over the array to ensure that each element is of the desired type, which is a performance pitfall.
Downcast when processing each element instead.
use objc2_foundation::{NSArray, NSObject, NSString};
let arr = NSArray::from_retained_slice(&[NSObject::new()]);
for elem in arr {
if let Some(data) = elem.downcast_ref::<NSString>() {
// handle `data`
}
}Trait Implementations§
Source§impl<NodeType: ?Sized + Message> AsRef<GKObstacleGraph<NodeType>> for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + Message> AsRef<GKObstacleGraph<NodeType>> for GKObstacleGraph<NodeType>
Source§impl<NodeType: ?Sized + Message> ClassType for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + Message> ClassType for GKObstacleGraph<NodeType>
Source§const NAME: &'static str = "GKObstacleGraph"
const NAME: &'static str = "GKObstacleGraph"
Source§type ThreadKind = <<GKObstacleGraph<NodeType> as ClassType>::Super as ClassType>::ThreadKind
type ThreadKind = <<GKObstacleGraph<NodeType> as ClassType>::Super as ClassType>::ThreadKind
Source§impl<NodeType: ?Sized + Message + AsRef<GKGraphNode2D>> CopyingHelper for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + Message + AsRef<GKGraphNode2D>> CopyingHelper for GKObstacleGraph<NodeType>
Source§type Result = GKObstacleGraph<NodeType>
type Result = GKObstacleGraph<NodeType>
Self if the type has no
immutable counterpart. Read moreSource§impl<NodeType: ?Sized> Debug for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized> Debug for GKObstacleGraph<NodeType>
Source§impl<NodeType: ?Sized> Hash for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized> Hash for GKObstacleGraph<NodeType>
Source§impl<NodeType: ?Sized + NSCoding + AsRef<GKGraphNode2D>> NSCoding for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + NSCoding + AsRef<GKGraphNode2D>> NSCoding for GKObstacleGraph<NodeType>
Source§impl<NodeType: ?Sized + AsRef<GKGraphNode2D>> NSCopying for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + AsRef<GKGraphNode2D>> NSCopying for GKObstacleGraph<NodeType>
Source§impl<NodeType: ?Sized + AsRef<GKGraphNode2D>> NSObjectProtocol for GKObstacleGraph<NodeType>
impl<NodeType: ?Sized + AsRef<GKGraphNode2D>> NSObjectProtocol for GKObstacleGraph<NodeType>
Source§fn isEqual(&self, other: Option<&AnyObject>) -> bool
fn isEqual(&self, other: Option<&AnyObject>) -> bool
Source§fn hash(&self) -> usize
fn hash(&self) -> usize
Source§fn isKindOfClass(&self, cls: &AnyClass) -> bool
fn isKindOfClass(&self, cls: &AnyClass) -> bool
Source§fn is_kind_of<T>(&self) -> bool
fn is_kind_of<T>(&self) -> bool
isKindOfClass directly, or cast your objects with AnyObject::downcast_ref