iwe | Intuitive World Editor | Editor library

In Clojure, the only one of those extra data structures that is required for some language constructs, besides lists, are vectors, and those are in well-known places such as around sequences of arguments to a function, or in symbol/expression pairs of a let. All of them can be used for data literals, but data literals are less often something you want to involve when writing a Clojure macro, as compared to function calls and macro invocations, which are always in lists.

I am not aware of anything in Clojure that makes writing macros more difficult than in Common Lisp, and there are a few features there distinct to Clojure that can make it a little bit easier, such as the behavior where Clojure backquoted expressions by default will namespace-qualify symbols, which is often what you want to prevent 'capturing' a name accidentally.

The expensive part with Vector is getting hold of the initialized Vector in the first place - so the main trick that recent code uses is to cheat and use MemoryMarshal.Cast<,>() to access existing memory by changing a Span into a Span>; in the case of string, you'd probably have to use ushort instead of char to convince it that it knows what it is doing (char and ushort are the same thing in memory terms), so:

I ended up writing a custom class:

A note from the comments: getc reads one character from the input stream. You need to check if the input stream is at the end of the file some other way.

You're using a single char instead of an array of chars. Use char data[51];, fgets(newnode->data, sizeof(newnode->data), f);, and printf("%s", current->data);

The function strcmp does not return specifically -1 or 1 (although it may do). It returns a value of 0, < 0 or > 0.

Also in

There is nothing weird there. It's a route, so it will considere you have to go to your location with a precise order. So it won't change the order.

It is written in the api : " Route service Finds the fastest route between coordinates in the supplied order. "

If you want to order it, i'm not sure OSRM is the best tool for this but there is the "Trip service" that might do the job.

Have a nice day.

The Lua map API does not include most of the operations of the Map data type, as implemented in the clients (for example, the Java client's MapOperation class).

The performance of the native map operations is significantly higher, so why would you use a UDF here, instead of calling remove_by_rank_range from the client?

The next thing to be aware of is that any write operation, whether it's a UDF or a client calling the map remove_by_rank_range method, first grabs a lock on the record. I answered another stackoverflow question about this request flow. Your UDF doesn't give any advantage to the problem you described over the client map operation.

If you want to cap the size of your map you should be doing it at the very same time you're adding new elements to the map. The two operations would be wrapped together with operate() - an insert, followed by the remove. I have an example of how to do this in rbotzer/aerospike-cdt-examples.

As I understand, the problem is that dragging working with circles but not with groups, for some reason

You are manipulating the nodes on drag with cx and cy properties. g elements do not have these, so this will not achieve what you want, even if node contained groups rather than circles:

The approach you are taking to compare two doms this way is wrong. Every time you make Selenium request there is a HTTP request created that is sent to the driver, which send it to the browser, which then sends it back to driver and driver back to you language binding. There is a lot of overhead involved in this.

Instead what you should do is use driver.PageSource and get the whole HTML response in a single call. Then later you can use HTML parsing libraries which are at least 10x faster than the approach you are taking now.

Look at below article which uses HtmlAgilityPack for getting DOM data

https://www.codeproject.com/Articles/659019/Scraping-HTML-DOM-elements-using-HtmlAgilityPack-H