I am a beginner to Clojure and I made a little script that prints out every prime number from 1 to 1000. Let me know if there are any improvements that I can make: (loop [i 2] (loop [j 2] (if (= j i) (println i)()) (if (= (mod i j) 0)() (recur (inc j)))) (if (< i 1000) ...

I have a below function which is called by multiple go routines to read s3 files and it populates two concurrent map as shown below. This read method is called during server startup and also periodically every 30 seconds after server is started up. I have a use case where I need to populate map f...

Introduction We have std::map<key,std::vector<std::string>> m; where the key is represented by std::tuple<std::string, std::string,std::string>. But there is a constraint, the last field of the tuple can be an empty string. If the last element of the tuple is an empty string then we should merge...

I am always super interested in both science and art, science and art are two different ways to describe the objective reality, they are two sides of the same coin, in many areas they overlap, and mathematics is the most prominent one of such areas. So I used the last three days to write a bunch ...

Premise: I have a set of data (stops on the map)loaded via geoJSON in a clustered source, each of these stop locations can have a different icon. I have over 140 variations of icons. I am iterating through all of them and I generate a "symbol" type layer for each one. Also, I am loading each stop...

Description: I would like to sample n_points points from k circles whose radii and centers are given as lists. Note: This is my first question :) And k is not a very large number, usually k<7. My code: I guess the parts where I compute the number of points for each circle, and the for loop can be...

The following program uses a parent program to determine the PIDs of multiple child processes. A function is called to return them to a dynamic vector (with the children's pids, but also the elements in the vector) #include <stdio.h> #include <stdlib.h> #include <sys/types.h> #include <unistd.h> ...

I have attempted to implement a "fast Pimpl" idiom based on the talk slides and further sources, which is essentially an aligned storage of some size that can be used as a drop-in replacement for std::unique_ptr when implementing the Pimpl idiom: // ... private: // std::unique_ptr<Impl> pimpl_;...