bitbybit.dev v1.0.0-rc.1
    Preparing search index...

    Class ZigZagBetweenTwoWiresDto<T>

    Type Parameters

    • T
    Index

    Constructors

    • Type Parameters

      • T

      Parameters

      • Optionalwire1: T
      • Optionalwire2: T
      • OptionalnrZigZags: number
      • Optionalinverse: boolean
      • OptionaldivideByEqualDistance: boolean
      • OptionalzigZagsPerEdge: boolean

      Returns ZigZagBetweenTwoWiresDto<T>

    Properties

    wire1: T

    The first wire for zig zag

    undefined
    
    wire2: T

    The second wire for zig zag

    undefined
    
    nrZigZags: number

    How many zig zags to create between the two wires on each edge. The number of edges should match. Edges will be joined by zigzags in order. One zig zag means two edges forming a corner.

    20
    

    1

    Infinity

    1

    inverse: boolean

    Inverse the the zig zag to go from wire2 to wire1

    false
    
    divideByEqualDistance: boolean

    If true, the zig zags will be spaced equally on each edge. By default we follow parametric subdivision of the edges, which is not always equal to distance based subdivisions.

    false
    
    zigZagsPerEdge: boolean

    By default the number of zig zags is applied to each edge. If this is set to false, the number of zig zags will be applied to the whole wire. This could then skip some corners where edges meet.

    true