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

  • SEARCH
  • Home
  • 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 8118509
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 6, 20262026-06-06T04:30:37+00:00 2026-06-06T04:30:37+00:00

Clojure offers a macro called doto that takes its argument and a list of

  • 0

Clojure offers a macro called doto that takes its argument and a list of functions and essentially calls each function, prepending the (evaluated) argument:

(doto (new java.util.HashMap) (.put "a" 1) (.put "b" 2))
-> {a=1, b=2}

Is there some way to implement something similar in Scala? I envision something with the following form:

val something =
  doto(Something.getInstance) {
    x()
    y()
    z()
  }

which will be equivalent to

val something = Something.getInstance
something.x()
something.y()
something.z()

Might it be possible using scala.util.DynamicVariables?

Note that with factory methods, like Something.getInstance, it is not possible to use the common Scala pattern

val something =
  new Something {
    x()
    y()
    z()
  }
  • 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-06-06T04:30:39+00:00Added an answer on June 6, 2026 at 4:30 am

    I don’t think there is such a thing built-in in the library but you can mimic it quite easily:

    def doto[A](target: A)(calls: (A => A)*) =
      calls.foldLeft(target) {case (res, f) => f(res)}
    

    Usage:

    scala> doto(Map.empty[String, Int])(_ + ("a" -> 1), _ + ("b" ->2))
    res0: Map[String,Int] = Map(a -> 1, b -> 2)
    
    scala> doto(Map.empty[String, Int])(List(_ + ("a" -> 1), _ - "a", _ + ("b" -> 2)))
    res10: Map[String,Int] = Map(b -> 2)
    

    Of course, it works as long as your function returns the proper type. In your case, if the function has only side effects (which is not so “scalaish”), you can change doto and use foreach instead of foldLeft:

    def doto[A](target: A)(calls: (A => Unit)*) =
      calls foreach {_(target)}
    

    Usage:

    scala> import collection.mutable.{Map => M}
    import collection.mutable.{Map=>M}
    
    scala> val x = M.empty[String, Int]
    x: scala.collection.mutable.Map[String,Int] = Map()
    
    scala> doto(x)(_ += ("a" -> 1), _ += ("a" -> 2))
    
    scala> x
    res16: scala.collection.mutable.Map[String,Int] = Map(a -> 2)
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

In clojure, I would like to write a tail-recursive function that memoizes its intermediate
Clojure has a -> macro which inserts each expression recursively as the first argument
SQL offers a function called coalesce(a, b, c, ...) that returns null if all
Scala offers a method called stripMargin that removes the left-hand part of a multiline
Clojure macro noob here. I have a function with some optional parameters, e.g. (defn
Why the designers of Clojure's reverse function decided that the returned sequence isn't a
in clojure i have vector [myfn1 myfn2 myfn3] how can i call functions named
In Clojure, I want to combine two lists to give a list of pairs,
Clojure is said to be a language that makes multi-thread programming easier. From the
In Clojure, how to use a java Class that is stored in a variable?

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.