Cliffnotes for "What are you working on?" threads 1 to 101 : [QUOTE=garry;33600474]You're gonna start something then not finish it then quit to do something else then not finish that?[/QUOTE]
[QUOTE=RyanDv3;33600265]All I'm saying is that repeatably asserting that you have a good idea is a waste of keypresses[/QUOTE]
it makes me feel better about myself
[QUOTE=BlkDucky;33600302]Not to mention incredibly irritating for the rest of us.[/QUOTE]
sorry
[QUOTE=synthiac;33600359]BOOYEN BALLS THE GAME
[editline]6th December 2011[/editline]
FEATURING PORTALS AND SHODDY VISUALS[/QUOTE]
shoddy visuals indeed :v:
[QUOTE=AzLaN;33600406]Portal game with AI bugs and realtime cloth in a grapher?[/QUOTE]
you got it
[QUOTE=amcfaggot;33600428]nullular cloth burn morphing with gyroscopic graphing
[editline]6th December 2011[/editline]
starring your girlfriend with shoehorn-shaped portal gun
[editline]6th December 2011[/editline]
who is on a quest to kill the wannabe graphic designer who has a good taste in gradients and fonts[/QUOTE]
close!
[QUOTE=garry;33600474]You're gonna start something then not finish it then quit to do something else then not finish that?[/QUOTE]
GridWorld2 for my APCS class
Nullular Grapher
Citation maker for my school
Morph
Tear N Burn
Tear N Burn Free
not particularly successful software (well i dunno about Tear N Burn yet) but certainly finished, released software
in other news, i just got a free Standard marmalade license, which would have otherwise costed me $499. it's a reward for releasing s3eAdWhirl, and AdWhirl extension for marmalade
[editline]6th December 2011[/editline]
in other other news, here, i'll tell you guys what i'm working on - an app that recognizes math equations from the device's camera and solves them in real time
Is there a way to turn off the snow, it slows down page loading and everything (I have an old PC) ?
[QUOTE=AntonioR;33600690]Is there a way to turn off the snow, it slows down page loading and everything (I have an old PC) ?[/QUOTE]
Adblock [url]http://www.facepunch.com/js/Snow.js[/url]
[editline]6th December 2011[/editline]
you grinch
[QUOTE=AntonioR;33600690]Is there a way to turn off the snow, it slows down page loading and everything (I have an old PC) ?[/QUOTE]
Turn up the heat in the room or AdBlock "http://facepunch.com/js/Snow.js".
Someone mentioned the tons of if statements in the terraria source.
A bit late, but here you go:
[url]http://codepad.org/JQbRErW5[/url]
[QUOTE=Jack Trades;33600726]Turn up the heat in the room or AdBlock "http://facepunch.com/js/Snow.js".[/QUOTE]
Weird. I AdBlocked that but yet the snow shows up, but only each other page. What the hell?
[QUOTE=icantread49;33600669]it makes me feel better about myself
in other other news, here, i'll tell you guys what i'm working on - an app that recognizes math equations from the device's camera and solves them in real time[/QUOTE]
Didn't they make an app like this in an episode of The Big Bang Theory?
[QUOTE=icantread49;33600669]in other other news, here, i'll tell you guys what i'm working on - an app that recognizes math equations from the device's camera and solves them in real time[/QUOTE]
Totally not stolen from The Big Bang Theory.
[editline]6th December 2011[/editline]
Sneaky ninjas :(
[QUOTE=Darwin226;33599620]Does anyone know of some data structure that acts like an array but with ranges of sorts.
They only data in the array are the starts and ends of ranges.
Like so: [s0,s1,s3,e1,e0,e3]
The flags also contain an index but they don't have to follow one another directly so if you filled the rest of the array with data it would perhaps look like this:
[s0,x,x,s1,x,s3,x,e1,x,x,x,e0,e3]
Now I'd like to be able to open one of those indices and in fastest possible time know which ranges include it.
I could fill every element with a list of ranges but that would take too long when adding new ranges or removing the existing ones.[/QUOTE]
I'm not sure how to explain this in a way that's easy to understand. But I like coming up with solutions to these kind of problems.
Use three data structures. One is a simple list/array that can contain the ranges and their minimum and maximum values in no particular order. This one is not necessary.
[code]First data structure:
idx min max
0 a c
1 b e
2 d f
What the ranges look like:
a b c d e f
|-------0-------|
|-----------1-----------|
|-------2-------|[/code]
The other two data structures are sorted lists, one sorted according to minimum value and the other according to maximum value
[code]min-list:
min idx
a 0
b 1
d 2
max-list:
max idx
c 0
e 1
f 2[/code]
To find the ranges that overlap a value (call it x, and let it lie between b and c):
Perform binary searches through the sorted lists to find from the min-list the greatest number smaller than x or equal to it and from the max-list the smallest number greater than x or equal to it.
In this example, the binary searches should return b <= x and c >= x.
b is the second value of the min-list. c is the first value of the max-list. Potential overlappers include, from the min-list, b and all those values below b. From the max-list the potential overlappers are c and all the values above it.
AND the potential overlappers from the min-list and the max-list to get all the ranges that overlap with the value x.
Requires O(log n) comparisons for the two binary searches. Marking the potential overlappers has a worst-case complexity of O(n). It works for non-integer minimum and maximum values and min and max values don't need to be unique.
edit: -snip, the other solution I was thinking of doesn't work-
[QUOTE=icantread49;33600669]in other other news, here, i'll tell you guys what i'm working on - an app that recognizes math equations from the device's camera and solves them in real time[/QUOTE]
Ummm [url]http://www.youtube.com/watch?v=j3MkOlnCSRY&t=65[/url]
[QUOTE=dajoh;33600946]Totally not stolen from The Big Bang Theory.
[/QUOTE]
can't steal something that doesn't exist
[media]http://www.youtube.com/watch?v=j3MkOlnCSRY[/media]
[editline]6th December 2011[/editline]
fuck late
[QUOTE=icantread49;33600993]can't steal something that doesn't exist[/QUOTE]
You "stole" the idea.
I'd like to see this happen though, good luck.
[QUOTE=dajoh;33601029]You "stole" the idea.
I'd like to see this happen though, good luck.[/QUOTE]
there's a reason you can't patent ideas :v: and thanks
here's my basic workflow:
1) recognize individual character areas
2) recognize actual characters
3) recognize character positions - construct equation
4) write or integrate a CAS
[QUOTE=icantread49;33601075]there's a reason you can't patent ideas :v: and thanks[/QUOTE]
I think you probably could patent something vague like that these days. (as stupid as it is)
I can see it now:
"Software method and apparatus for optical identification of mathematical formulae with computer algebra system (CAS) assisted evaluation"
At this point it looks like I wont be able to decode/encode rtmp packets :(. Fluorinefx's encoded packet is too different and the server rejects it. One weird thing is that for the first packet for some reason its using AMF0 and then it switches to AMF3...
[cpp]
//////////////////////////////////////////////////////////////////////////
// TESTING
//////////////////////////////////////////////////////////////////////////
CharMatrix cms[5];
for (int i = 0; i < 5; ++i)
{
cms[i] = CharMatrix(8, 8, 'a' + i);
Image img;
img.LoadFromFile(std::string("brain/") + cms[i].Char + std::string(".tga"), false);
cms[i].SampleImage(img.GetPixels(), 0, 0, img.GetWidth(), img.GetHeight(), img.GetWidth(), img.GetHeight());
cms[i].PrepareAsMemory();
}
{
Image img;
img.LoadFromFile(std::string("brain/") + "a.tga", false);
CharMatrix m(8, 8);
m.SampleImage(img.GetPixels(), 0, 0, img.GetWidth(), img.GetHeight(), img.GetWidth(), img.GetHeight());
for (int i = 0; i < 5; ++i)
{
float f = cms[i].CheckMatch(m);
s3eDebugTraceLine((ToString(i) + " : " + ToString(f)).c_str());
}
}
[/cpp]
[quote]
0 : 1
1 : 0.514286
2 : 0.790698
3 : 0.424242
4 : 0.844444
[/quote]
well, basic character recognition is working. just gotta check the screen for characters now
[QUOTE=icantread49;33601075]there's a reason you can't patent ideas :v: and thanks
here's my basic workflow:
1) recognize individual character areas
2) recognize actual characters
3) recognize character positions - construct equation
4) write or integrate a CAS[/QUOTE]
I feel like that's way too ambitous for a one man team and the idea isn't so original so someone would have already made this if it wasn't incredibly hard. But on the other hand you're extremely good at stuff like this, so I really hope you succeed. :smile:
I've decided to move all of my classes that I use in many projects into a library, called mineshaft.
It currently doesn't have that much in it but I'm going to add more stuff, and I'm going to end up rewriting a lot of the stuff SFML does and only using it as a rendering library.
[QUOTE=supersnail11;33600863]Someone mentioned the tons of if statements in the terraria source.
A bit late, but here you go:
[url]http://codepad.org/JQbRErW5[/url][/QUOTE]
It looks like the decompiler just went haywire.
oh my god
Looking at some code that I wrote years ago, check out this gem
[url]https://github.com/neos300/Bullwhip/blob/Lambroghini/Definition.h[/url]
[url]https://github.com/neos300/Bullwhip/blob/Lambroghini/Definition.cpp[/url]
It actually does need it's own class (for saving and loading them) but I have a slight feeling that I don't need different maps for strings and floats, as well as the global void* one.
[QUOTE=ThePuska;33600966]I'm not sure how to explain this in a way that's easy to understand. But I like coming up with solutions to these kind of problems.
Use three data structures. One is a simple list/array that can contain the ranges and their minimum and maximum values in no particular order. This one is not necessary.
[code]First data structure:
idx min max
0 a c
1 b e
2 d f
What the ranges look like:
a b c d e f
|-------0-------|
|-----------1-----------|
|-------2-------|[/code]
The other two data structures are sorted lists, one sorted according to minimum value and the other according to maximum value
[code]min-list:
min idx
a 0
b 1
d 2
max-list:
max idx
c 0
e 1
f 2[/code]
To find the ranges that overlap a value (call it x, and let it lie between b and c):
Perform binary searches through the sorted lists to find from the min-list the greatest number smaller than x or equal to it and from the max-list the smallest number greater than x or equal to it.
In this example, the binary searches should return b <= x and c >= x.
b is the second value of the min-list. c is the first value of the max-list. Potential overlappers include, from the min-list, b and all those values below b. From the max-list the potential overlappers are c and all the values above it.
AND the potential overlappers from the min-list and the max-list to get all the ranges that overlap with the value x.
Requires O(log n) comparisons for the two binary searches. Marking the potential overlappers has a worst-case complexity of O(n). It works for non-integer minimum and maximum values and min and max values don't need to be unique.
edit: -snip, the other solution I was thinking of doesn't work-[/QUOTE]
That's easy to understand and seems easy to implement.
You seem like the kind of person I'd like to be friends with. Thanks.
[editline]6th December 2011[/editline]
Also, I find it strange that AND means intersection and OR means union in the binary world.
[QUOTE=Robber;33601559]I feel like that's way to ambitous for a one man team and the idea isn't so original so someone would have already made this if it wasn't incredibly hard. But on the other hand you're extremely good at stuff like this, so I really hope you succeed. :smile:[/QUOTE]
i realize it's incredibly ambitious, and thanks for the good luck
a lot of this has been done before, but it's very fragmented. there has never been a one-stop solution that just did everything, none the less combined it into one neat little app for a low price
Hey guess what is really fun! Trying to write code so that when I submit data in an unbound form it will identify the most recent data entry for that user and check if it is in the current week or last week and then either update the old one or create a new one. It also needs to set the text boxes on the form to the most recent values as well.
Oh, did I mention this is in VBA 6.0 and Microsoft Access 2007? Yeh, AS computing fucking sucks. Making this database is like repeatedly cutting off limbs in an attempt to make walking easier. Honestly, were not allowed to use ANYTHING helpful. Form wizard? Nope. Queries? Nope. Use SQL? Nope. Trying to code some obscure part of your code in an over-arching plan for a great end result? Oh wait, Nope! Code your own sub routine? Nope! I haven't ever hated programming but this is really fucking dumb.
/end school rant.
[QUOTE=ief014;33601612]It looks like the decompiler just went haywire.[/QUOTE]
Or it really likes if statements. :v:
[QUOTE=ief014;33601612]It looks like the decompiler just went haywire.[/QUOTE]
It did it on all three that I tried (ILSpy, Reflector, and Dis#)
[QUOTE=synthiac;33601856]this all sounds [url=http://www.facepunch.com/threads/1106128?p=33243229&highlight=#post33243229]vaguely familiar[/url]...[/QUOTE]
weird, i wish he posted it in WAYWO here in addition to web dev
oh well, my project is a little different
Instancing. Still probably wont be fast enough for a typical map.
[img]http://dl.dropbox.com/u/99765/bs7894.png[/img]
[QUOTE=icantread49;33601965]weird, i wish he posted it in WAYWO here in addition to web dev[/QUOTE]
I remember that and I don't browse web-dev. So he must have done.
Sorry, you need to Log In to post a reply to this thread.
