Skip to main content

HelixCurve

Struct HelixCurve 

Source
pub struct HelixCurve { /* private fields */ }
Expand description

A helix about its frame’s z, parameterized by turn angle.

The point at t sits at angle t around the axis, radius out along the turned x, risen by pitch·t/2π along z, so one full turn advances exactly one pitch, and a negative pitch winds the other hand. A non-zero taper advances the radius the same way and winds a cone instead. A helix is transcendental: no rational B-spline states it exactly, which is why it is its own type rather than a conversion.

Implementations§

Source§

impl HelixCurve

Source

pub fn new( frame: Frame, radius: f64, pitch: f64, turns: f64, ) -> OgeomResult<Self>

A helix over turns full revolutions from angle zero.

§Errors

OgeomError::Construction if the radius is not finite and positive, the pitch is not finite and non-zero (a zero pitch is a circle, and there is a type for that), or turns is not finite and positive.

Source

pub fn over( frame: Frame, radius: f64, pitch: f64, start: f64, end: f64, ) -> OgeomResult<Self>

A helix over an arbitrary increasing angle interval.

§Errors

As HelixCurve::new, with the interval checked instead of the turn count.

Source

pub fn conical( frame: Frame, radius: f64, pitch: f64, taper: f64, start: f64, end: f64, ) -> OgeomResult<Self>

A conical helix: the radius advances by taper per full turn while the point rises by pitch, winding the cone whose half-angle satisfies tan(angle) = taper / pitch. radius is the radius at angle zero, whether or not the interval holds it.

§Errors

As HelixCurve::over, and additionally if taper is not finite or the radius runs non-positive anywhere on the interval; past the apex there is no cone to wind.

Source

pub const fn frame(&self) -> &Frame

The frame the helix turns about.

Source

pub const fn radius(&self) -> f64

The radius.

Source

pub const fn pitch(&self) -> f64

The advance along the axis per full turn; negative winds left-handed.

Source

pub const fn taper(&self) -> f64

The radial advance per full turn; zero is the cylindrical helix.

Source

pub const fn is_reversed(&self) -> bool

Whether evaluation runs the domain backwards.

Source

pub fn arc_length(&self, from: f64, to: f64) -> f64

The exact arc length between two parameters: constant speed times the swept angle.

Trait Implementations§

Source§

impl Clone for HelixCurve

Source§

fn clone(&self) -> HelixCurve

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for HelixCurve

Source§

impl Curve3d for HelixCurve

Source§

fn domain(&self) -> (f64, f64)

The parameter interval over which the curve is defined.
Source§

fn point_at(&self, u: f64, tol: Tolerances) -> OgeomResult<Point>

The point at u. Read more
Source§

fn d1_at(&self, u: f64, tol: Tolerances) -> OgeomResult<Vector>

The first derivative at u. Read more
Source§

fn derivatives_at( &self, u: f64, n: usize, tol: Tolerances, ) -> OgeomResult<Vec<Vector>>

Derivatives up to order n, with result[0] the point itself. Read more
Source§

fn kind(&self) -> CurveKind

What kind of curve this is.
Source§

fn continuity(&self) -> Continuity

How smooth the curve is across its domain.
Source§

fn is_closed(&self, _tol: Tolerances) -> bool

Whether the curve’s ends meet.
Source§

fn is_periodic(&self) -> bool

Whether the curve continues past its domain by repeating. Read more
Source§

fn tangent_at(&self, u: f64, tol: Tolerances) -> OgeomResult<Direction>

The unit tangent at u. Read more
Source§

fn curvature_at(&self, u: f64, tol: Tolerances) -> OgeomResult<f64>

The curvature at u. Read more
Source§

fn start(&self, tol: Tolerances) -> OgeomResult<Point>

The start point. Read more
Source§

fn end(&self, tol: Tolerances) -> OgeomResult<Point>

The end point. Read more
Source§

fn normalize_parameter(&self, u: f64, tol: Tolerances) -> OgeomResult<f64>

Bring u into the domain, wrapping if the curve is periodic. Read more
Source§

impl Debug for HelixCurve

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl From<HelixCurve> for Curve

Source§

fn from(c: HelixCurve) -> Self

Converts to this type from the input type.
Source§

impl PartialEq for HelixCurve

Source§

fn eq(&self, other: &HelixCurve) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for HelixCurve

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.