Ikarus_

NEW SERVICE AVAILABLE: CUSTOM WORKS PAID PER HOUR READ ALL DETAILS IN THE SPOILER ON THREAD MESSAGE

I have solved it answering to OP user. I m sharing the solution there since it may helps also other for other systems. I dont recommend the use of my v1 since is no longer supported nor manutened and it makes the offshop v1 obsolete. Class ImageBox was not calling the base class Window method OnMouseLeftButtonUp in his override. So searching class ImageBox, few above search def OnMouseLeftButtonUp and add a new line and paste Window.OnMouseLeftButtonUp(self).

Well, it would be better to adapt it rather than to remove it, since now u got again the bug about stealth skill

Exclusive for Martysama's Supporters Hello Everyone! The IkarusShop V2 will have a Christmas Discount Weeks period from Dicember 21th to January 6th! The First, Second, and Third purchase of ULTIMATE version will get an extra Discount! Hurry Up! More Details here: https://martysama0134.com/Source_addons/Ikarus_Offlineshop

Updated the post with an important information!

An exclusive discount is taking place right now! All details here!

It looks the map instance is collecting dangling pointers, pointers which points to deleted memory. I guess the system is destroying some character (monster i guess) without removing it from its sectree. Can't know more atm i m not at home.

I edited the answer with instructions for u

It's crashing while printing a string in syslog or syserr. Search this string and post the code immediately before and immediately above. "PRIVAE_MAP: removing character %s",

Pre-order discount weeks officially open. if you are interested in buying contact me on discord.

Post updated with important news! Pre-order discount weeks will start soon! 27 September - 10 October Pre-order prices: LITE ~~349€~~ 269€ PRO ~~549€~~ 449€ ULTIMATE ~~899€~~ 769€ The first 5 purchases of ULTIMATE will be further discounted to €699. The discounts will end on October 10th. Soon an open beta server will be active which give you way try the system before purchasing it. For each purchase it will be necessary to register an invoice, therefore the data necessary for this purpose will be requested. All installations will be carried out first for those who bought the ULTIMATE version in pre-order, then all others in order of purchase starting at 11 October. Payment methods are: - Papayl P&S - Revolut - LITE version only can be paid using Amazon.it giftcards.

UPDATED THE POST WITH THE OFFICIAL OVERVIEW VIDEO OF IKASHOP V2! https://youtu.be/FxeQiEKb2f0

Thread updated with important news!

Store the values into a set, change the for limit to 1milion and call .size on the set at the end. Surprise! The size is around 32k, so it is repeating 1milion of times the same 32k of values. So in short the problem i tried to explain in the previous answer consists in the fact the values are discrete. Are only 32k (RAND_MAX) of values, distributed in the range 0-2kkk I said 65k of values in the previous post because I thought RAND_MAX was 65k, since it is 32k the numbers are more discrete than how i thought xd

Again no xd. It is still not uniform at all. Using the same test (1 milion numbers) you will see that only 65k of numbers are possible to be picked... And 0 will never be picked xd The possible numbers are the ones that comes out using this formula : n = 1 + x * 32K where x can be one random number from 0 to RAND_MAX (65k~) in short, theres a number every 32k of numbers which can be picked, in the range from 1 to 2147483647, which is very far from being a uniform distribution in a range. I guess u know that it cant be tested on onlinegdb since this issue comes out only on Windows (onlinegdb uses linux)

That way u do isn't a uniform distribution. If u want see it with ur eyes try to store 1milion numbers returned by ur functions and print them sorting by count of times they were picked. Larger numbers are more frequently picked than smaller ones.

by removing "int iLen = " from that line of code

please make them into a zip or, if you really want to use tag code please extract only the changes you made and the code around them.

You installed it wrong, 100% xd Or you have other changes conflicting with it. It's tested, by many guys and by me, for a long time. Anyway if you wish, you can post here the changes you made and i could take a look

No it is not possible. Since I didn't have time to give my best support, I preferred to close the sales and pause my service. If it happens that I have more time then I will reopen sales with new systems (the old ones will now remain closed forever)

No, Once you typed bt full the last line says: Type <RET> for more, [....] So if you type <RET> it shows more

A crash happening on checkpoint usually means execution fall in an infinite loop or a signal received by the kernel caused by an exception. The call inside boost make me think you got corrupted stack or heap, making execution looping in that element ordering routine or trying overwrite unaccessible memory addresses. I can't deduce more just by reading that trace. In the case you are using an old boost release, it would be a good idea to update it. EDIT --- You should type <RET> while reading the .core in order to get more trace.

I guess that GetMaxHP returned 0 for some reason, and that is why it crashed. You can solve it by simply checking that GetMaxHP is different from 0 in that if. Test this fix and report if it helped you: // replace this if (GetMaxHP() >= 0) iTmpPercent = (GetHP() * 100) / GetMaxHP(); //with this if (GetMaxHP() > 0) iTmpPercent = (GetHP() * 100) / GetMaxHP();

It would be helpful to post char_battle.cpp or at least what it contains at line 2530 and around.

Don't forget that static variables aren't thread safe (m2 server is a single-threaded application so it is still safe). The `std::uniform_real_distribution<>` can be static only if min and max used to declare it are constant (as it is in the code i posted). Anyway moving to static storage only the two others (std::random_device, std::mt19937) still give most of the advantage in terms of execution time.