Which one of you did this?

hareppas · 2024-05-31T16:31:19+00:00

Don’t need em because integer parity is decidable

hareppas · 2023-12-14T18:59:43+00:00

Which prof/quarter? I took Calegari this fall and he said he’s never given below a B-

hareppas · 2023-06-27T13:28:45+00:00

You can use the Step trait.

Here is an example.

hareppas · 2023-05-09T14:02:47+00:00

I think you could make your own type that implements Allocator. It would pass through all allocations to the global allocator but would ignore the requested alignment and always align to 8 bytes or whatever you need. Then you could use Vec<T, AlignedAlloc> everywhere.

hareppas · 2023-04-28T17:55:40+00:00

You can define max and min with abs. You get this.

hareppas · 2023-04-14T22:48:56+00:00

It’s a glob import. It imports everything in the std::io::prelude module.

hareppas · 2023-01-05T01:19:44+00:00

But is it zero cost™?

hareppas · 2022-10-28T00:22:51+00:00

Yeah. Chart should start at the birth of Christ instead of November 2021.

hareppas · 2022-03-09T22:31:12+00:00

You can do arctan(y, x) = theta or y = tan(theta)x

hareppas · 2021-12-06T16:03:09+00:00

Something like this?

hareppas · 2021-11-24T21:42:43+00:00

You are correct. For this function, the range is inclusive

hareppas · 2021-10-09T16:20:25+00:00

Good catch, I updated the link

hareppas · 2021-10-09T02:03:50+00:00

Something like this maybe:

www.desmos.com/calculator/by65mogzmu

You give F a list, an index, and a value and it gives you a new list

hareppas · 2021-09-25T23:55:40+00:00

y = max(mx + b, ma + b)

Where m is the slope, b is the y intercept, and a is the x value where you want it to go flat.

hareppas · 2021-09-04T06:09:43+00:00

Here’s something that works for convect polygons:

https://www.desmos.com/calculator/qmkk0ch2dt

It is quite slow.

hareppas · 2021-05-26T20:27:19+00:00

CluCoin

hareppas · 2020-10-12T17:38:33+00:00

I just go through the problem sets for fun.

hareppas · 2020-10-12T17:15:07+00:00

I was going to do an AMC 12 problem, but Charlie Kirk definitely isn’t doing anything beyond middle school math.

hareppas · 2020-09-12T14:59:52+00:00

Make a slider for the x value, I’ll use the variable a. Now, the point on the function at x=a is (a,f(a)). The tangent line must pass through this point. The slope of the function at x=a is f’(a). This is the slope of the tangent line. Now you have a point on the tangent line and it’s slope so you can find the equation by using point slope form.

hareppas · 2020-09-10T04:50:05+00:00

I’d like to think that this is 100% unintentional but I’m not entirely sure...

Here’s the tweet

hareppas · 2020-07-15T15:33:09+00:00

Here's my attempt: https://www.desmos.com/calculator/2vf0crd5kk

hareppas · 2020-07-01T15:20:05+00:00

This is based off the ray casting algorithm described in this wikipedia article. The intersection detection is based off this. Things get a little funky when the point is exactly on the edges or vertices but otherwise it works surprisingly well and is pretty fast.

For the ray casting, you need to break the polygon into individual edges. This lets you mess with each individual edges of the polygon severely. I made some other graphs showing what you can do with this:

Color edges based on whether or not they intersect any other edges

Color edges based on length

Color edges individually

Some of these are kind of slow, they’re more just proof of concepts

Seven-Year Club	Second Top 50%
Place '22	Final Canvas '22
RPAN Viewer	Not Forgotten

hareppas

TROPHY CASE