Struct b2ChainShape 

pub struct b2ChainShape { /* private fields */ }

A chain shape is a free form sequence of line segments. The chain has one-sided collision, with the surface normal pointing to the right of the edge. This provides a counter-clockwise winding like the polygon shape. Connectivity information is used to create smooth collisions. @warning the chain will not collide properly if there are self-intersections.

Implementations

impl b2ChainShape

pub fn new() -> impl New<Output = Self>

pub unsafe fn Clone( self: &b2ChainShape, allocator: *mut b2BlockAllocator, ) -> *mut b2Shape

Implement b2Shape. Vertices are cloned using b2Alloc.

pub fn GetChildCount(self: &b2ChainShape) -> c_int

@see b2Shape::GetChildCount

pub fn TestPoint( self: &b2ChainShape, transform: &b2Transform, p: &b2Vec2, ) -> bool

This always return false. @see b2Shape::TestPoint

pub unsafe fn ComputeDistance( self: &b2ChainShape, xf: &b2Transform, p: &b2Vec2, distance: *mut f32, normal: *mut b2Vec2, childIndex: c_int, )

pub unsafe fn RayCast( self: &b2ChainShape, output: *mut b2RayCastOutput, input: &b2RayCastInput, transform: &b2Transform, childIndex: c_int, ) -> bool

Implement b2Shape.

pub unsafe fn ComputeAABB( self: &b2ChainShape, aabb: *mut b2AABB, transform: &b2Transform, childIndex: c_int, )

@see b2Shape::ComputeAABB

pub unsafe fn ComputeMass( self: &b2ChainShape, massData: *mut b2MassData, density: f32, )

Chains have zero mass. @see b2Shape::ComputeMass

impl b2ChainShape

pub fn Clear(self: Pin<&mut Self>)

Clear all data.

pub unsafe fn CreateLoop( self: Pin<&mut Self>, vertices: *const b2Vec2, count: c_int, )

Create a loop. This automatically adjusts connectivity. @param vertices an array of vertices, these are copied @param count the vertex count

pub unsafe fn CreateChain( self: Pin<&mut Self>, vertices: *const b2Vec2, count: c_int, prevVertex: &b2Vec2, nextVertex: &b2Vec2, )

Create a chain with ghost vertices to connect multiple chains together. @param vertices an array of vertices, these are copied @param count the vertex count @param prevVertex previous vertex from chain that connects to the start @param nextVertex next vertex from chain that connects to the end

pub unsafe fn GetChildEdge(&self, edge: *mut b2EdgeShape, index: c_int)

Get a child edge.

Trait Implementations

impl AsRef<b2Shape> for b2ChainShape

fn as_ref(self: &b2ChainShape) -> &b2Shape

Converts this type into a shared reference of the (usually inferred) input type.

impl CopyNew for b2ChainShape

unsafe fn copy_new( other: &b2ChainShape, this: Pin<&mut MaybeUninit<b2ChainShape>>, )

Synthesized copy constructor.

impl Drop for b2ChainShape

fn drop(self: &mut b2ChainShape)

The destructor frees the vertices using b2Free.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl ExternType for b2ChainShape

type Id = (b, _2, C, h, a, i, n, S, h, a, p, e)

A type-level representation of the type’s C++ namespace and type name.

type Kind = Opaque

Either cxx::kind::Opaque or cxx::kind::Trivial.

impl MakeCppStorage for b2ChainShape

unsafe fn allocate_uninitialized_cpp_storage() -> *mut b2ChainShape

Allocates heap space for this type in C++ and return a pointer to that space, but do not initialize that space (i.e. do not yet call a constructor).

unsafe fn free_uninitialized_cpp_storage(arg0: *mut b2ChainShape)

Frees a C++ allocation which has not yet had a constructor called.

impl SharedPtrTarget for b2ChainShape

impl UniquePtrTarget for b2ChainShape

impl WeakPtrTarget for b2ChainShape