|
I thought about that right after I posted! Good catch!
"Go forth into the source" - Neal Morse
"Hope is contagious"
|
|
|
|
|
It might have tried to be too artistic. The pace picked up in the second half though. Part 2 looks like it should be more exciting. It's quite weird though (for someone who isn't familiar with Dune).
|
|
|
|
|
sand and smoke and a protagonist who has the energy of a snail; very artistic
«The mind is not a vessel to be filled but a fire to be kindled» Plutarch
|
|
|
|
|
The special effects are a little better than the 1984 version. Those blocky rendered personal shields
|
|
|
|
|
I liked Lynch's Dune, I saw it as a teenager when it came out and my father, who had read the books, explained a lot to me afterwards.
Seeing the trailers for this recent version, it just looks a bit like a Lynch remake.
“That which can be asserted without evidence, can be dismissed without evidence.”
― Christopher Hitchens
|
|
|
|
|
Huh - that's not what I've heard from all the - I hesitate to say 'disciples' - but certainly great fans of Dune I know who've seen it. But nothing could be worse than the execrable pile of filth that David Lynch directed. The idiot even had it rain at the end, thereby missing the entire point and ruining it completely. What a heap of steaming crap.
|
|
|
|
|
Loved the 1984 "Dune" even with some of the cheesy special effects but most of them were pretty good.
Loved the SciFi Channels 3-part miniseries as well.
And no one could beat Francesa Annis as Duke Leto's wife in the 1984 version. Her hairstyle and look can not be replicated today by any of the current actresses.
When I saw who would play Paul Atreides in the new movie, I felt this would never work.
Looks like it didn't...
Steve Naidamast
Sr. Software Engineer
Black Falcon Software, Inc.
blackfalconsoftware@outlook.com
|
|
|
|
|
Interesting. I never liked the Lynch version but found the new release quite good. The characters were well cast, the CGI excellent (especially in IMAX), and the flow good. Films spend the money on actors, CGI, directors, and marketing. Allocate it for any two and you can have a winner. Try to spread it across all four and it's guaranteed to fail.
|
|
|
|
|
Book with times could be in love (7)
"I didn't mention the bats - he'd see them soon enough" - Hunter S Thompson - RIP
|
|
|
|
|
I'm self-censoring for an hour!
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
"Common sense is so rare these days, it should be classified as a super power" - Random T-shirt
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
I'll show em I posted late
"I didn't mention the bats - he'd see them soon enough" - Hunter S Thompson - RIP
|
|
|
|
|
OK I'll bite.
SMITTEN anag of TIMES + NT
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
I was going to post that a while a oago but I got busy ... I think you are up tomorrow!
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
"Common sense is so rare these days, it should be classified as a super power" - Random T-shirt
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
Well done Peter YAUT
"I didn't mention the bats - he'd see them soon enough" - Hunter S Thompson - RIP
|
|
|
|
|
Here's my compression formula..
bits = chrs input , turned into binary
n1 = mid( bits , a , 4 )
v1 = val( "&B" + n1 )
if v1 = 00 then s1 = "0" : map+= "0001" <-- 5 bits , expands a bit
if v1 = 01 then s1 = "1" : map+= "0001" <-- 5 bits , expands a bit
if v1 = 02 then s1 = "0" : map+= "00" <-- 3 bits compresses 1 bit
if v1 = 03 then s1 = "1" : map+= "00" <-- 3 bits compresses 1 bit
if v1 = 04 then s1 = "00" : map+= "10" <-- 4 bits
if v1 = 05 then s1 = "01" : map+= "10" <-- 4 bits
if v1 = 06 then s1 = "10" : map+= "10" <-- 4 bits
if v1 = 07 then s1 = "11" : map+= "10" <-- 4 bits
if v1 = 08 then s1 = "000" : map+= "1" <-- 4 bits
if v1 = 09 then s1 = "001" : map+= "1" <-- 4 bits
if v1 = 10 then s1 = "010" : map+= "1" <-- 4 bits
if v1 = 11 then s1 = "011" : map+= "1" <-- 4 bits
if v1 = 12 then s1 = "100" : map+= "1" <-- 4 bits
if v1 = 13 then s1 = "101" : map+= "1" <-- 4 bits
if v1 = 14 then s1 = "110" : map+= "1" <-- 4 bits
if v1 = 15 then s1 = "111" : map+= "1" <-- 4 bits
outs+= s1
Turn outs into characters..
Turn map into characters..
Compresses any size file down to around 20K after enough loops..
|
|
|
|
|
This is a topic more appropriate for an article or blog post. Not a lounge post.
"They have a consciousness, they have a life, they have a soul! Damn you! Let the rabbits wear glasses! Save our brothers! Can I get an amen?"
|
|
|
|
|
Maybe you should supply your algorithm to the makers of huge software downloads such as Visual Studio, Android Studio, etc., rather than writing it here.
|
|
|
|
|
I know nothing of compression or even the language your code is written in but "any size" to more or less the same size Surely you're joking Mr. Feynman That sounds like the person I no longer recall who suggested compressing the compressed file etc. until it was compressed down to one byte - Cheerio
|
|
|
|
|
PaltryProgrammer wrote: or even the language your code is written VB - Surely EVERYBODY knows that???
Anything that is unrelated to elephants is irrelephant Anonymous
- The problem with quotes on the internet is that you can never tell if they're genuine Winston Churchill, 1944
- Never argue with a fool. Onlookers may not be able to tell the difference. Mark Twain
|
|
|
|
|
And... how do you decompress it later for normal usage?
Like reversing a logical "OR"[^]?
M.D.V.
If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
Rating helpful answers is nice, but saying thanks can be even nicer.
modified 21-Oct-21 7:05am.
|
|
|
|
|
You can only reverse if you know the source! it's also an encryption!
|
|
|
|
|
In the same way that SHA-256 compresses any file to 32 bytes and makes its contents inaccessible to any intruder.
As SHA-256 for all practical purposes is unique to a file, decompression can be done by using the SHA-256 value as index into a table where the original file contents is found.
|
|
|
|
|
Hmmm...I was wondering if I could win with a compression down to 1 byte but then I saw the last part of the rules requirement.
" To enter, a competitor must submit a compression program and a decompressor that decompresses to the file"
|
|
|
|
|
That's why they push a DVD worth of updates to visual studio every 3 weeks.
And you can't abort an update, even on a metered connection.
My time doesn't matter to them. My money doesn't matter to them. My work doesn't matter to them.
Thank you Microsoft, for turning your best product into to the best reason I shouldn't give you any more money.
Real programmers use butterflies
modified 20-Oct-21 20:33pm.
|
|
|
|
|
I have a pc over for "repair" after apparently an update botched the windows installation.
Doing this for daily bread has given me plenty of opportunity to question, "Do they know?", "Why do they treat us like they do now?" " what did we do?" "Gosh M.S. you used to be cool. /
|
|
|
|