next »

[Whiteclaws]

My own hashtable 
It seems like (first impressions) it hashes 4GB of 32bit data into 256KB and the getters are only a few instructions, which is awesome! Going to stresstest furthermore... Maybe I'm just dreaming over a lemon

[ThemsAllTook]

My own hashtable 

That's a fun project - I made one of my own not too long ago. Pretty satisfying experience.

[tjcbs]

My own hashtable  

That's a fun project - I made one of my own not too long ago. Pretty satisfying experience.

Ugh. I *think* I have this working perfectly now, and I've had this class for years.  A *lot* of subtle bugs are possible.

One hint: When removing an entry, make sure you re-hash adjacent entries previous to after (a bug in my bug description) the one you removed. This threw me for a loop. And then thinking I fixed it, I forgot to wrap around back to the end beginning when the adjacencies straddled the edges of the table, another crazy once in 10000 times bug. (Assuming you are using a flat hash table).

[tjcbs]

I'm working on a glowing trail that follows the mouse cursor.

SWEET BABY JESUS this is hard to get right. I thought this would take me like an hour or so. NOOOOO SIR. Its been days and days of trying and scrapping one approach after the next, mounting frustration, despair looming larger and larger. If I knew it would be this hard, I would never have bothered. But now I have to see it through. I *think* I finally see the light at the end of the tunnel. But good god, this sucked.

[Whiteclaws]

My own hashtable  

That's a fun project - I made one of my own not too long ago. Pretty satisfying experience.

Ugh. I *think* I have this working perfectly now, and I've had this class for years.  A *lot* of subtle bugs are possible.

One hint: When removing an entry, make sure you re-hash adjacent entries previous to after (a bug in my bug description) the one you removed. This threw me for a loop. And then thinking I fixed it, I forgot to wrap around back to the end beginning when the adjacencies straddled the edges of the table, another crazy once in 10000 times bug. (Assuming you are using a flat hash table).

All the possible 32bit combinations will fit in 256kb, no collisions, thus getters and setters are almost the same (one addition, one compare and one lookup, that's it) and no need to rehash anything, at least that's how the algorithm should work

[InfiniteStateMachine]

Writing a somewhat game-engine agnostic conversation/flow system.

The xml schema is all done. I've made a test file and I've made a implementation in unity. It keeps track on conversation tokens that are granted by taking various conversation paths. Also has a requirements system.

I'm probably going to author the editor in WPF. I have just started my love affair with XAML. It's so liberating to stop focusing on multi-platform tools and just get the job done. WPF s actually pretty amazing.

[Rainforce15]

I'm working on a glowing trail that follows the mouse cursor.

SWEET BABY JESUS this is hard to get right. I thought this would take me like an hour or so. NOOOOO SIR. Its been days and days of trying and scrapping one approach after the next, mounting frustration, despair looming larger and larger. If I knew it would be this hard, I would never have bothered. But now I have to see it through. I *think* I finally see the light at the end of the tunnel. But good god, this sucked.

game/rendering engine? Also what have you tried so far, and why did it fail in your opinion?

[tjcbs]

My own hashtable  

That's a fun project - I made one of my own not too long ago. Pretty satisfying experience.

Ugh. I *think* I have this working perfectly now, and I've had this class for years.  A *lot* of subtle bugs are possible.

One hint: When removing an entry, make sure you re-hash adjacent entries previous to after (a bug in my bug description) the one you removed. This threw me for a loop. And then thinking I fixed it, I forgot to wrap around back to the end beginning when the adjacencies straddled the edges of the table, another crazy once in 10000 times bug. (Assuming you are using a flat hash table).

All the possible 32bit combinations will fit in 256kb, no collisions, thus getters and setters are almost the same (one addition, one compare and one lookup, that's it) and no need to rehash anything, at least that's how the algorithm should work

Please explain this algorithm, it doesn't seem possible from your description.

[tjcbs]

I'm working on a glowing trail that follows the mouse cursor.

SWEET BABY JESUS this is hard to get right. I thought this would take me like an hour or so. NOOOOO SIR. Its been days and days of trying and scrapping one approach after the next, mounting frustration, despair looming larger and larger. If I knew it would be this hard, I would never have bothered. But now I have to see it through. I *think* I finally see the light at the end of the tunnel. But good god, this sucked.

game/rendering engine? Also what have you tried so far, and why did it fail in your opinion?

This is for my own game and engine. The basic problem I think has been the instability and jerkiness of mouse input. And the fact that even a little bit of overlap in the trail causes a noticible artifact.

Every frame I'm emitting a quad whose vertices are manually placed. My solution now is to keep a running average of the last 5 mouse positions, and use the vector form that to the current position to determine the direction of the segment as well as the orientation of the leading edge. This means that the trail can stray from the mouse when moving quickly. Too much "kinkiness" between quads becomes very noticable, but I thought that resorting to bezier curves was overkill, since I'm outputting a quad every frame. I might have to anyway, since I want to port to low-fps platforms (mobile).

I'm doing a horrible job explaining this, partly because it is still a muddle in my head. I have a feeling that this problem is trivial for everyone but me anyway.

[Whiteclaws]

My own hashtable  

That's a fun project - I made one of my own not too long ago. Pretty satisfying experience.

Ugh. I *think* I have this working perfectly now, and I've had this class for years.  A *lot* of subtle bugs are possible.

One hint: When removing an entry, make sure you re-hash adjacent entries previous to after (a bug in my bug description) the one you removed. This threw me for a loop. And then thinking I fixed it, I forgot to wrap around back to the end beginning when the adjacencies straddled the edges of the table, another crazy once in 10000 times bug. (Assuming you are using a flat hash table).

All the possible 32bit combinations will fit in 256kb, no collisions, thus getters and setters are almost the same (one addition, one compare and one lookup, that's it) and no need to rehash anything, at least that's how the algorithm should work

Please explain this algorithm, it doesn't seem possible from your description.

Just Google additive hash functions, mine is a derivation of it, will get the source code online soon if you are interested...

[Rainforce15]

This is for my own game and engine. The basic problem I think has been the instability and jerkiness of mouse input. And the fact that even a little bit of overlap in the trail causes a noticible artifact.

Every frame I'm emitting a quad whose vertices are manually placed. My solution now is to keep a running average of the last 5 mouse positions, and use the vector form that to the current position to determine the direction of the segment as well as the orientation of the leading edge. This means that the trail can stray from the mouse when moving quickly. Too much "kinkiness" between quads becomes very noticable, but I thought that resorting to bezier curves was overkill, since I'm outputting a quad every frame. I might have to anyway, since I want to port to low-fps platforms (mobile).

I'm doing a horrible job explaining this, partly because it is still a muddle in my head. I have a feeling that this problem is trivial for everyone but me anyway.

sounds alright - I think you describe what I had in mind as well, in terms of building a trail from quads. Also a quad every frame IS overkill for most cases.

[tjcbs]

Just Google additive hash functions, mine is a derivation of it, will get the source code online soon if you are interested...

I did, and all I could find is the naive hash function of simply adding up the bytes of whatever you are hashing, which is not what you are describing.

[tjcbs]

Also a quad every frame IS overkill for most cases.

I don't think it is, I still see some segmentation, but not enough for it to be not good enough, I think .

[Whiteclaws]

Just Google additive hash functions, mine is a derivation of it, will get the source code online soon if you are interested...

I did, and all I could find is the naive hash function of simply adding up the bytes of whatever you are hashing, which is not what you are describing.

Naive, but efficient, but still naive, we gotta remove the "naive" part, your homework, tell me why it's naive, and how I can make it non-naive, thinking a bit about it, you'll find out how I did it

[tjcbs]

Just Google additive hash functions, mine is a derivation of it, will get the source code online soon if you are interested...

I did, and all I could find is the naive hash function of simply adding up the bytes of whatever you are hashing, which is not what you are describing.

Naive, but efficient, but still naive, we gotta remove the "naive" part, your homework, tell me why it's naive, and how I can make it non-naive, thinking a bit about it, you'll find out how I did it

Naive, for one, because it is commutative, so "ab" hashes to "ba". I feel like we are talking about two separate things, your homework is to explain what you are doing.

[InfiniteStateMachine]

Started working on the editor for my game engine agnostic dialogue system

[Pineapple]

I just finished writing a lexical scanner and successfully made it tokenize and tree-ify its own source. Also I learned how to use regular expressions in the process.

[Jeff Skyrunner]

Writing the core algorithm of my puzzle game

[DarkCart]

Trying to do a Beatles-themed game in Java.

[Whiteclaws]

Just Google additive hash functions, mine is a derivation of it, will get the source code online soon if you are interested...

I did, and all I could find is the naive hash function of simply adding up the bytes of whatever you are hashing, which is not what you are describing.

Naive, but efficient, but still naive, we gotta remove the "naive" part, your homework, tell me why it's naive, and how I can make it non-naive, thinking a bit about it, you'll find out how I did it

Naive, for one, because it is commutative, so "ab" hashes to "ba". I feel like we are talking about two separate things, your homework is to explain what you are doing.

Exactly, now add another dimension and a compare to check if a > b