Completion?

Discussion:

Completion?

(too old to reply)

Drake Dowsett

2005-10-03 02:53:07 UTC

Has anyone come close to completing the assignment. I thought I had
actually finished the OptAdaptive, but then ran into some more problems.
I mean, is EVERYONE sucking on this assignment, or is there really
ANYONE out there who was like "by george that's easy"?

Drake

Son Le

2005-10-02 22:02:14 UTC

Permalink

We thought we did finish the assignment then we tried it on some huge
pdf files. It screws up. The reverse adaptive is correct but not the
optimal adaptive.
Now we are debugging the optAdaptive.
The way we are doing is writing a check for the invariants in the paper
everytime we modify the tree => we know when we screw up the tree?
It is a long process.. sigh...

Post by Drake Dowsett
Has anyone come close to completing the assignment. I thought I had
actually finished the OptAdaptive, but then ran into some more problems.
I mean, is EVERYONE sucking on this assignment, or is there really
ANYONE out there who was like "by george that's easy"?
Drake

Usenet user

2005-10-03 03:11:40 UTC

Permalink

Post by Son Le
We thought we did finish the assignment then we tried it on some huge
pdf files. It screws up. The reverse adaptive is correct but not the
optimal adaptive.
Now we are debugging the optAdaptive.
The way we are doing is writing a check for the invariants in the paper
everytime we modify the tree => we know when we screw up the tree?
It is a long process.. sigh...

[quoted text muted]

yeah, same here.

we gave it a few test runs, and optAdaptive crashed and burned. However,
revAdaptive performed perfectly.

I'm seriously starting to believe some of the methods given to us are not
perfect, or if they are, their exact use has been seriously obfuscated to
me

Son Le

2005-10-03 00:44:37 UTC

Permalink

Yeah. The 256th character needs special treatment. It is a stubborn
child node :).

Hmm, my best guess is that it's bugging when it hits the 256th symbol,
which has to be handled a little differently.- Jamie

Jamie Hargrove

2005-10-03 05:41:07 UTC

Permalink

User-Agent: OSXnews .10/b
Xref: number1.nntp.dca.giganews.com utexas.class.cs337:389

Hmm, my best guess is that it's bugging when it hits the 256th symbol,
which has to be handled a little differently.- Jamie

Jack

2005-10-03 03:06:43 UTC

Permalink

I don't have a great enough understanding of the reverseAdaptive to properly
implement it. All of the special cases and stuff are beyond me. my code
compiles and runs, but I don't know if it's spitting out anything useful.

so yeah, I'm doing pretty sucky too
-Jack

Luke Robison

2005-10-02 22:04:37 UTC

Permalink

by george thats easy. In theory.

by george did he really have to make it so convoluted in code?

i've just had a hard time figuring out his approach to the problem.
seems like a regular tree would have been easier.

nowhere near done,
-luke

Nick Whelan

2005-10-03 03:25:20 UTC

Permalink

I got the Opt done, and it appears to work well, although I can't say I've
tried it on anything by a semi-longish text file... I'm pretty confident of
it though.

As for reverse adaptive, I'm a bit stuck. It works some of the time, but
for some longer files, the removeZero function really screws it up. Does
anyone have any psuedocode they used for all of the special cases?
removeZero was overwiriting some nodes with my program, even after I fixed
the typo. I had to change it some myself to get it to work on my smaller
tests, but with large one, something happens to the tree where outputCode
overflows the stack, and frankly there's just too much to debug. Unless
someone has some psuedocode, or an explanation of what the reverseAdaptive
special cases are in the update, I'm giving up. I've spent way too much
time on this.

Hope someone can help me out.

-Nick