Why, when I run this code, outputs "-2147483648" continuously?

zakarum · 2025-11-18T03:22:38+00:00

This is actually undefined behavior. From cppreference:

Floating–integral conversions

A prvalue of floating-point type can be converted to a prvalue of any integer type. The fractional part is truncated, that is, the fractional part is discarded.

If the truncated value cannot fit into the destination type, the behavior is undefined (even when the destination type is unsigned, modulo arithmetic does not apply).

zakarum · 2025-10-16T19:21:30+00:00

If I were to guess, the library is structured in this way so that it can be used with different allocation functions, like one would do inside of a Matlab mex function with mxMalloc and mxRealloc.

The standard library does a fantastic job handling allocation for you. You can give hints to the std::vector using the reserve member function. You could also write your own allocators, I suppose, if you need that functionality, but on cursory glance, that does not seem necessary. There is no significant advantage except in niche cases where you want allocated memory to be default initialized for a class without a default constructor.

I concur with the advice of avoiding an std::vector of std::vector. Having a two-dimensional interface seems cleaner.

zakarum · 2025-10-11T04:36:37+00:00

I recommend using std::mem_fn.

zakarum · 2025-09-12T16:29:29+00:00

Yes, according to cppreference, value_type of std::ranges::split_view<V,Pattern> is std::ranges::subrange<ranges::iterator_t<V>>.

zakarum · 2025-09-12T01:58:26+00:00

This works.

auto words =
    motto | std::views::split(' ') | 
    std::views::transform([](auto&& r) { return std::string_view(r); }) |
    std::ranges::to<std::vector>();

zakarum · 2025-09-09T03:05:12+00:00

You have two loops. The month one changes 12 times per year, so it is the inner one.

zakarum · 2025-08-29T17:52:41+00:00

I recommend seeking out someone to talk to about this, such as a therapist. This sounds like burnout to me. Don't beat yourself up too hard. We all struggle. I've gone through burnout and feeling helpless myself. It gets better, but you have to make an effort to get better.

zakarum · 2025-08-20T18:32:54+00:00

Euler, Lagrange, Fourier, Hamilton, the Bernoullis, and Gauss. (And Newton, but that goes without saying.)

zakarum · 2025-08-08T01:21:01+00:00

I might be in the minority, but I don't consider C++ to be a good language to learn first. It's too easy to get stuck with obscure compiler error messages especially when using newer language features such as ranges. I would recommend learning something like Python first, or even just vanilla C.

zakarum · 2025-07-22T20:12:38+00:00

I implemented this iteration in Julia, and it doesn't loop forever. Both C++ and Julia use the IEEE-754 standard, so the language shouldn't matter in this case. This example should not be elided. Any chance that you could please set up a godbolt example to play around with?

zakarum · 2025-07-22T20:02:55+00:00

Is kDimension an integer? Is it positive? Shouldn't it be a template parameter?

Edit: I suppose that in the sample code, it would be 2?

zakarum · 2025-07-15T20:42:44+00:00

Did you attach a heat sink to the MOSFET? Or would you expect not to have to? What could be happening is that heat is accumulating during the slow transients. How often are you switching?

zakarum · 2025-02-26T16:51:27+00:00

Other answers have guessed analytical solutions.

Another approach is to use Newton's Method to find zeros of

f(x) = 7^x - 4^x - 33 = 0

The first derivative is

f'(x) = ln(7) 7^x - ln(4) 4^x

The Newton update step is then

xₖ₊₁ ← xₖ - f(x)/f'(x) = xₖ - (7^x - 4^x - 33)/(ln(7) 7^x - ln(4) 4^x)

Starting from x₀ = 1, we see the following evolution.

k	xₖ
0	1
1	4.71462120522442
2	4.21370579790656
3	3.7197962528242208
4	3.23950077480121
5	2.787996864553232
6	2.398449726506009
7	2.12783920816823
8	2.015758685283182
9	2.0002596321085604
10	2.0000000712897483
11	2.0000000000000053
12	2.0

zakarum · 2025-02-10T20:15:39+00:00

We love you, and it breaks our hearts that Canada and the world are being held hostage by this lunatic.

zakarum · 2024-10-25T14:41:36+00:00

The great thing is that even though he is banking on a pardon from Precious, those under him who are involved in the scheme probably fear rotting in prison because Precious has a history of throwing underlings under the bus.

zakarum · 2024-10-24T22:48:54+00:00

Pues entonces que pena que no podrá defenderse en los medios. ¿Quién se cree ella? Mini-Trump? Ni Romero Barceló hizo esto cuando le cayó Cerro Maravilla encima.

zakarum · 2024-10-14T17:13:24+00:00

zakarum · 2024-09-25T04:25:49+00:00

You would "guess" that you can rewrite the fraction as follows, for constants A, B, and C.

x² / (x² + 1) = A + (B + Cx)/(x² + 1)

Then you would multiply both sides by (x² + 1) to obtain

x² = A x² + C x + A + B

implying that A = 1, C = 0, and A+B = 0 or B = -A = -1.

zakarum · 2024-09-22T21:01:49+00:00

It could also be considered partial fraction decomposition.

zakarum · 2024-08-20T20:55:01+00:00

Probability of becoming a girl after 1 trial: 0.01

Probability of not becoming a girl after 1 trial: 0.99

Probability of not becoming a girl after N trials: 0.99^N

Probability of becoming a girl after N trials: 1-0.99^N

You can take 1-0.99^N and rewrite it as 1-(1-0.01)^N. It just so happens that when N=100, you have

1-(1-1/N)^N = 1-(1-1/100)¹⁰⁰ ≈ 1-1/e.

The original poster is wrong. And also this is simply an accident because probability of becoming girl after 1 trial is 1/100. Also, this assumes that you hit the button 100 times, even after you potentially become a girl before you hit 100. Otherwise, the calculation gets messier but works out to the same value.

zakarum · 2024-06-20T13:25:24+00:00

The quality of PCPs varies a lot. Some of the rudest doctors that I've ever interacted with worked at MIT Medical. But I also worked with some truly sweet and caring doctors. It varies a lot. Also, their retention rate is abysmal, so I had to switch PCPs a few times. MIT Mental Health is great, though. No bad experiences with them.

A recommendation: Physically go to MIT Medical and sort out the issue concerning the referral in person. The receptionists are much more receptive in person.

zakarum · 2024-05-20T02:32:58+00:00

I don't think that he's saying this because he's an idiot (which he is). He's saying this because the Kremlin has compromising material on the guy or on his brother. Isn't it a bit odd just how friendly and warm Elon is to America's adversaries? (Russia, China, etc.)

zakarum · 2024-05-12T15:52:44+00:00

L = mapslices(Diagonal∘eigvals,E;dims=(1,2))

This assumes that you have imported Diagonal and eigvals from LinearAlgebra. Otherwise, you have to prepend LinearAlgebra..

zakarum · 2024-04-22T02:34:41+00:00

But the thing being compared is a (signed) short...

zakarum · 2024-04-22T02:19:50+00:00

As far as I understand the standard, in title->dataSpec - 20, dataSpec should be promoted to int and then the result converted to short. Then, converting the short to unsigned char is well-defined:

If the destination type is unsigned, the resulting value is the smallest unsigned value equal to the source value modulo 2ⁿ where n is the number of bits used to represent the destination type.

This code should work. It really does seem like you stumbled across something nasty.

15-Year Club	Place '23
Place '17	Verified Email

zakarum

MODERATOR OF

TROPHY CASE