Topic: Array Question

[hudster]

This is a stump the swamp question.

I don't know how to do it, and it's something i'm thinking about.

How woudl you array an object a set distance from a central location, arraying in all directions as per the following diagram.

[MP]

2 separate polar array calls wrapped in a little ditty of a function.

[MP]

Ok, I've had a coffee. My logic is flawed, one would have to calculate the matrix of offsets and then copy from the basepoint to each target offset. Seems to me I did something like this but it was about 12 years ago. Ackkk, searching ...

[MP]

Consider ...

Code: [Select]

(setq matrix
   '(
        (-2  2) (-1  2) (0  2) (1  2) (2  2)

        (-2  1) (-1  1) (0  1) (1  1) (2  1)

        (-2  0) (-1  0) (0  0) (1  0) (2  0)

        (-2 -1) (-1 -1) (0 -1) (1 -1) (2 -1)

        (-2 -2) (-1 -2) (0 -2) (1 -2) (2 -2)
    )
)

(setq scale 42.0)

(setq scaledMatrix
    (mapcar
       '(lambda (point)
            (mapcar
               '(lambda (ordinate) (* scale ordinate))
                point
            )
        )
        matrix
    )
)

(setq ReferencePoint '( 100 100 ))

(setq offsetMatrix
    (mapcar
       '(lambda (point)
            (mapcar '+ point ReferencePoint)
        )
        scaledMatrix
    )
)

[Kerry]

Consider ...

I don't care what anyone else says, That IS pretty ...

[Keith™]

It'd be a roll yer own routine for sure ... something like a rectangular array with a "from center" option

[hudster]

OK then,  just to add a wee bit to this.

How would you do it if you had to array an object the same way but it was off centre? As shown in this image.

[MP]

I believe you may be looking for the MatrixOmatic ...

Code: [Select]

(defun MatrixOmatic ( m n / *error* foo )

    (defun *error* (msg)
        (princ
            (strcat
                "Syntax: "
                (chr 40)
                "MakeMatrix m n"
                (chr 41)
                " where m and n are positive integers."
            )
        )
        (princ)
    )

    (if
        (not
            (vl-every
               '(lambda (x)
                    (and
                        (eq 'int (type x))
                        (< 0 x)
                    )   
                )
                (list m n)
            )
        )
        (exit)
    )

    (defun foo ( x / result )
        (   (lambda (k)
                (repeat x
                    (setq result
                        (cons
                            (setq k (1- k))
                            result
                        )
                    )
                )
            )
            (+ 0.5 (/ x 2.0))
        )
    )

    (apply 'append
        (mapcar
           '(lambda (y)
                (mapcar
                   '(lambda (x) (list x y))
                    (foo m)
                )
            )
            (foo n)
        )
    )
)
(MatrixOmatic 4 3)

Code: [Select]

(
    (-1.5 -1.0) (-0.5 -1.0) (0.5 -1.0) (1.5 -1.0)
    (-1.5  0.0) (-0.5  0.0) (0.5  0.0) (1.5  0.0)
    (-1.5  1.0) (-0.5  1.0) (0.5  1.0) (1.5  1.0)
)

[CAB]

    WOW - neat stuff

[whdjr]

You could set the first option up as a dynamic block with 4 rect. arrays.

[Sdoman]

I haven't had a chance to run your code MP, but it looks awesome.  Elegant algorithm.

[MP]

Thanks Steve, nice of you to say.

Here's a quick and dirty implementation of what Mr. Hudster wants (I think):

Code: [Select]

(defun ArraySelectionAndDelete

    (
        ss
        basepoint
        rows
        columns
        xoffset
        yoffset
        /
        *error*
        makematrix
        matrix
        cmdecho
    )

    ;;  our help message

    (defun *error* (msg)
        (princ
            (strcat
                "Syntax: "
                (chr 40)
                "ArraySelectionAndDelete "
                "ss "
                "basepoint "
                "rows "
                "columns "
                "xoffset "
                "yoffset"
                (chr 41)
                "\nWhere ss        is a valid selection set\n"
                "      basepoint is a 2D or 3D point\n"
                "      rows      is a positive integer\n"
                "      columns   is a positive integer\n"
                "      xoffset   is a positive real\n"
                "      yoffset   is a positive real\n"
            )
        )
        (princ)
    )

    ;; this does the real grunt work

    (defun makematrix ( m n / foo )

        ;;  no need to error trap me, my
        ;;  parent coding takes care of
        ;;  making sure I get good data

        (defun foo ( x / result )
            (   (lambda (k)
                    (repeat x
                        (setq result
                            (cons
                                (setq k (1- k))
                                result
                            )
                        )
                    )
                )
                (+ 0.5 (/ x 2.0))
            )
        )

        (apply 'append
            (mapcar
               '(lambda (y)
                    (mapcar
                       '(lambda (x) (list x y))
                        (foo m)
                    )
                )
                (foo n)
            )
        )
    )

    ;;  bozo filtering

    (if
        (or
            (not (eq 'pickset (type ss)))
            (not (< 0 (sslength ss)))
            (not (listp basepoint))
            (not (< 1 (length basepoint) 4))
            (not (vl-every 'numberp basepoint))
            (not
                (vl-every
                   '(lambda (x)
                        (and
                            (eq 'int (type x))
                            (< 0 x)
                        )
                    )
                    (list rows columns)
                )
            )
            (not
                (vl-every
                   '(lambda (x)
                        (and
                            (numberp x)
                            (< 0 x)
                        )
                    )
                    (list xoffset yoffset)
                )
            )
        )
        (exit)
    )

    ;;  we're good, let's calculate
    ;;  all the target points
   
    (   (lambda (offset)
            (setq matrix
                (mapcar
                   '(lambda (point)
                        (mapcar '+
                            (mapcar '* point offset)
                            basepoint
                        )
                    )
                    (makematrix
                        rows
                        columns
                    )
                )
            )
        )
        (list xoffset yoffset)
    )   

    ;;  shhhh ...

    (setq cmdecho (getvar "cmdecho"))

    (setvar "cmdecho" 0)

    ;;  make all the copies

    (foreach point matrix
        (command
            ".copy"
            ss
            ""
            "_non"
            basepoint
            "_non"
            point
        )
    )

    ;;  trap a locked layers fubar

    (vl-catch-all-apply
       '(lambda ( )
            (command
                ".erase"
                ss
                ""
            )
        )
    )

    ;;  play nice

    (setvar "cmdecho" cmdecho)

    ;;  shhh ...

    (princ)

)
Example implementation:

Code: [Select]

(defun c:ASAD ( / ss inibits )
    (if (setq ss (ssget))
        (ArraySelectionAndDelete
            ss
            (getpoint "\nSelect basepoint: ")
            (progn
                (initget (setq inibits (+ 1 2 4)))
                (getint "Enter rows: ")
            )
            (progn
                (initget inibits)
                (getint "Enter columns: ")
            )
            (progn
                (initget inibits)
                (getdist "Enter xoffset: ")
            )
            (progn
                (initget inibits)
                (getdist "Enter yoffset: ")
            )
        )
    )
    (princ)
)
Like I said, pretty quick and dirty but demonstrates (I hope) the general idea.

[CAB]

Possible pseudo code

User select objects (or entsel)
Get user pick center
...or get corner of bounding box
Copy object(s) with base point
Get number of array rows & columns
get offset amount(s) (row & col)
Get point offsets (MatrixOmatic rows columns)
Loop point offsets, adding offset to point
.. paste selection set to new point


PS too late but I'll post anyway
Let me see how close I got

[hudster]

  you guys are amazing, the best I could come up with was an idea to array it in four directions, but then i had duplicates and gave up.

It's timnes like this when I realise how little I know, and how far I still have to go.

[MP]

Hey Mr. Hudster -- please don't belittle or dismiss your talents -- everyone can learn this stuff -- it just takes genuine interest and time. It's obvious you have the interest, just not the time, 'cause like most folks programming isn't your primary vocation or interest.

So keep posting the ideas and questions, grab and digest as much as your time and interest affords and thanks for letting folks like me pitch in. I enjoy it and need to challenge what I think I know if I want to get better at this. In other words, you're doing me a great favor when you post challenges like this.

So thanks!