Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 628821
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T19:40:41+00:00 2026-05-13T19:40:41+00:00

Here is a bit of example code: (deftype Deck52 [suits] :as this DeckOfCards (check-empty

  • 0

Here is a bit of example code:

(deftype Deck52 [suits] :as this
  DeckOfCards
  (check-empty []
               (Deck52. (apply hash-map 
                              (apply concat (remove (-> nil?) 
                                                    (for [[key val] suits] 
                                                      (if (empty? val) nil [key val])))))))
  (remove-card [suit card]
               (assoc suits suit (remove #(= card %) (suit suits))))

  (get-card [suit]
            (let [suitd (suit suits)]
              [(first suitd) (check-empty (Deck52. (assoc suits suit (rest suitd))))]))

  (random-card []
               (let [suitn (+ 1 (rand-int 4))]
                 (cond (= suitn 1) (get-card this :hearts)
                       (= suitn 2) (get-card this :diamonds)
                       (= suitn 3) (get-card this :clubs)
                       (= suitn 4) (get-card this :spades)))))

I also posted this code in a Gist here if it’s easier to read: http://gist.github.com/307425 (not going anywhere).

The primary example here is check-empty. I had great difficulty knowing where I should and shouldn’t hit return, and I still don’t know if I did it right. It threatens to walk right off the right side of the screen, but that’s the way clojure-mode indents, and I assume that it’s supposed to be like that.

So, the question is, when is it time to place a newline in Clojure/Lisp code? Am I ‘doin’ it rite’?

NOTE: I can’t promise that the code I posted works. I’ve been doing some experimentation, and some things might be plain ol’ sucky, if not broken.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T19:40:41+00:00Added an answer on May 13, 2026 at 7:40 pm

    The way you broke the lines is quite normal. I would do some slight changes though.

    • Put the argument vectors on the next line.
    • Use different forms: the little -> and ->> helpers, condp, when, …
    • If necessary, break the line immediately after the function name.

    Here how I would go about this. (Disclaimer: My style. Yours might be different. YMMV!)

    (deftype Deck52 [suits] :as this
      DeckOfCards
      (check-empty
        []
        (->> (for [[key val] suits]
               (when-not (empty? val)
                 [key val]))
          (remove nil?)
          (apply concat)
          (apply hash-map)
          Deck52.))
      (remove-card
        [suit card]
        (assoc suits suit (remove #(= card %) (suit suits))))
      (get-card
        [suit]
        (let [suitd (suit suits)]
          [(first suitd)
           (->> (rest suitd)
             (assoc suits suit)
             Deck52.
             check-empty)]))
      (random-card
        []
        (let [suitn (+ 1 (rand-int 4))]
          (condp = suitn
            1 (get-card this :hearts)
            2 (get-card this :diamonds)
            3 (get-card this :clubs)
            4 (get-card this :spades)))))
    

    Although the following is not part of your question, I cannot resist:

    (deftype Deck52 [suits] :as this
      DeckOfCards
      (check-empty
        []
        (->> suits (remove (comp nil? seq val)) (into {}) Deck52.))
      (remove-card
        [suit card]
        (update-in suits [suit] #(remove %2 %1) #(= card %)))
      (get-card
        [suit]
        (let [suitd (get suits suit)]
          [(first suitd)
           (->> (rest suitd) (assoc suits suit) Deck52. check-empty)]))
      (random-card
        []
        (case (rand-int 4)
          0 (get-card this :hearts)
          1 (get-card this :diamonds)
          2 (get-card this :clubs)
          3 (get-card this :spades))))
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 542k
  • Answers 542k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer That is impossible. I would suggest that you do not… May 17, 2026 at 3:10 am
  • Editorial Team
    Editorial Team added an answer Try these two options first before adding new servers. They… May 17, 2026 at 3:10 am
  • Editorial Team
    Editorial Team added an answer You really can't create a page dynamically in the way… May 17, 2026 at 3:10 am

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Related Questions

The code posted here is 'example' code, it's not production code. I've done this
I've poached a bit of example code from a site explaining how to do
I've started learning 16-bit assembly (eventually moving up to 32-bit) from this tutorial here:
From here I've copied an example of python gui app, but it's not working.
I'm trying to do some raw socket programming. I have some example code that
Help Perlers! Does anyone know a simple insert code here approach would bring code
I know this exact question was asked here , but the answer didn't work
I've been doing quite a bit of simple XML-processing in python and grown to
I wonder what imperative vs declarative steps in Rspec is all about. Here is
I'm writing some code in VB.Net which I hope demonstrate to colleagues (not to

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.