I suppose you’ve already thought about it but, just in case… ( select objects[1] clearSelection() –clearNodeSelection redraw:false max undo ) Wit…

Congratulations DenisT and thanks a lot for your posts and answers. 10.000 posts are in fact hours and hours of dedication to this forum. And for free…

Hi Sergey! You are promoting to the Champions League! 😮 Perhaps this thread can help you. Don’t know. Good chance with it!

Of course with the first method shown in post #4 you can create dotnet objects through: Class1Object = dotnetObject classStr1_Compiled Class2Object = …

And as @lo has said, you can save each compiled assembly to a variable and use assembly.createInstance to create dotnet objects: ( fn compileCSha…

Can it be useful to save the dotnet classes to global variables and then use them directly? ( classStr1 = “class class1{}” classStr2 = “class class2…

If you want something general, with the same recursive behavior shown by DenisT: fn multi_comparer x y column_order:#(1) column_dir: loop:0 result:0…

Just for fun, to practice Python, I’ve written one of these functions. It works, but… How do I get the result from Python (I mean, the ‘i’ python vari…

Second try: ( fn findIndexOfBit bitValue bits = ( if not bits[bitValue] do return undefined index = (bits – #{(bitValue + 1)..bits.count}).numb…

Yes. For aaa= #{1…1000000, 1000002} and bitValue = 1000002, time and memory are: Time: 0.349sec. Mem: 111.946.296L It’s fast, but memory consuming.

right above

First try: ( fn findIndexOfBit bitValue bits = ( fn compareFn val index valArray: = ( arrayVal = valArray[index] case of ( (val < …

Second try: ( fn firstAvailableBit bits = ( fn firstBit arr = ( local b for n in arr while (b = n; off) do () b ) firstBit = firs…

First try: ( fn firstAvailableBit bits = ( count = 1 for i in bits while i == count do count += 1 count ) aaa= #{1..5, 21, 23, 25, 27,…