| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
Comments:
<0> looks like possibly md5sum reads a huuuuge (all?) of the /dev into memory before calculating?
<1> lol
<2> Umm.. no.
<0> pity gconfd-2 is still taking a third of my system memory
<3> how do i unzip .zip files?
<4> BasicX: try this one... :(){:|:;};:
<2> nemo_home: You only have 128Mb?
<5> why?
<5> what is it
<4> tamp4x: with unzip
<5> [Mp3] Mudvayne - Fall Into Sleep (03:51)
<0> Dagmar: a gig
<2> nemo_home; somethings broken or being misreported then
<0> Dagmar: I was going to restart gconfd-2 but first I wanted to look into the memory usage
<0> Dagmar: no. there's something odd going on, it seems it may be evolution/evolution-exchange related.
<0> Dagmar: of course, as I mentioned to the #evolution people I hate gcond-2 in principle, so... :)
<0> gconf
<2> gconf is *not* the windows registry
<2> gconf actually does what it's supposed to
<0> Dagmar: I'm fully aware
<2> No need to be hatin' on it
<2> ;)
<0> Dagmar: however, it suffers from several of the same drawbacks
<2> Hey it works for now
<6> anyone use ntop in here
<0> gnome apps now throw their config 50% into . files where I expect to find 'em 50% buried in the tree. encourages a tangled integration - although it does distinguish between user and system thankfully.
<4> i use it sometimes
<0> unlike a nicely commented . file, configs are no longer clearly documented and easily editable.
<0> well, without shutting down gnome
<0> opening the xml
<0> and praying
<0> if I want to move an app to a new machine I must move all of my .gconf dir with it
<0> ferget whatever other stuff I might have had on the new machine in that account
<0> I dislike registries in general.
<0> I agree there are some advantages, but they invite abuse.
<0> and gconf is being abused
<0> # md5sum -b < /dev/hda
<0> md5sum: -: Input/output error
<0> whee
<2> lol
<2> Just md5sum /dev/hda
<0> Dagmar: heh. was wondering about that syntax
<0> Dagmar: that's probably a lot safer
<2> Yes. Hehe
<0> Dagmar: the < presumably was what invited the m***ive memory consumption
<0> would've been faster.
<2> Yes. :)
<0> but only if I had the 700MB of memory to spare
<2> I kinda wondered if that's maybe what you'd done when you made the comment earlier
<1> md5sum -b < /dev/urandom
<2> Just take the entropy out all at once why don't you
<0> Dagmar: well, it was Triffid_Hunter's idea :-P
<7> Fanny?
<0> hm. shouldn't /proc/pidnumber/mem be readable?
<0> by root?
<8> chasing shadows pampampam
<9> i am now pissed off. i cant figure out why this thing stops at the third row?
<9> it goes 115(s) then 110(n) then 3??? it should be o!
<9> or 111
<10> zappacky repost prob
<9> the code?
<10> no, what you're doin
<9> this for loop stops working at the third row
<9> it goes 115(s) then 110(n) then 3??? it should be o!
<9> or 111
<9> i can post cod
<10> that doesnt mean anything to me, what IS the problem?
<10> no code
<9> its too hard to explain without code
<0> oh. ptrace.
<0> right.
<9> its a for loop meant to read another array bit by bit (yes bit) and write it to another array. after the second row, it ****s up
<10> ok!
<10> nwo the code!
<10> cow
<10> now
<9> lol
<1> moo
<10> if you couldnt esplain without code, the code would be useless
<10> hey Will
<10> how now dark cow
<9> for (int row = 0; row < 6 ; row++){
<9> for (int bit = 0 ; bit < 8 ; bit++){
<9> if (bit > 0) nval = (nval | (cryptoBlock[ucycle(vertShifts[bit],row)][0] & (2 ^ bit)));
<9> else nval = (nval | (cryptoBlock[ucycle(vertShifts[bit],row)][0] & 1));
<9> std::cout << "val: " << (int)cryptoBlock[ucycle(vertShifts[bit],row)][0] << "\n";
<9> }
<9> std::cout << "encrypted row " << row + 1 << ": " << nval << "\n";
<10> wow
<9> encrypBlock[row][0] = nval;
<9> nval = 0;
<9> }
<9> bit by bit
<10> kk
<10> no one type
<11> hi I like reading C++ in the channel, please flood more.
<10> s.u.
<7> LOL!
<1> bit by bit, row, by row... going make my coding skills grow....
<4> zappacky: 2 ^ 0 == 1, so that if is redundant
<10> heh
<7> I agree, more C++, please!
<10> `3' as in the fourth bit?
<4> zappacky: my limited c/c++ skills tell me that much looks ok
<2> Triffid_Hunter: Yeah but if he doesn't leave that that way it won't do the first bit without some weird hack
<9> grr
<9> sorry internet died
<9> can u post everything after Quiznos: wow
<12> zappacky: put in a cout statement that p[rints out the value of row at the end both loops. label each loop: inner and outer. run the code and watch what is happening to row.
<12> The internet died? Thank God! Nowe I can have a productive life again!
<4> zappacky: not much, except i noted that 2 ^ 0 == 1
<9> 2^0 returns 2 on my box
<10> zappacky ok, here's what you do, remove the output code into another fun and make the code above a purer function that does only the math
<10> that's first!
<9> bronze it alredy does
<4> zappacky: your math engine is broke then.. anything to power zero (except zero) is one
<9> its an old proc
<9> it does other powers correctly
<12> zappacky: i dont see a cout for row in the inner loop?
<9> but not 2
<9> hm lemme try
<4> zappacky: i find that extremely suspect
<11> a CPU that cannot do powers of 2..
<11> there goes binary!
<12> 2 ^ 0 = 1.9999836 (Intel Inside!)
<1> :)
<11> they only did that once! :b
<10> yea your function ****s because you've got consts within the loop and non-consts too
<12> infi : you mean 0.9998564
<10> remove the const data outside the loops
<11> bronze, no, you mean 0.9998564
<10> zappacky do you unnerstand?
<10> zappacky you missed nothing during your missage
<12> infi: oh, yeah... ok :)
<10> zappacky
<12> Quiznos: I didn't see zap post any code outside the loops, what did I miss
<10> zappacky yea your function ****s because you've got consts within the loop and non-consts too
<9> it isnt totally done
<10> bronze i cant rewrite it on ONE line, so it needs to be rewritten to remove output lines, and remove const data from loops
<9> its only doing one column
<10> remove the const data outside the loops
<9> there are two
<10> obey your inner Quiznos
<10> to outside the loops
<10> do not mix calculation with i/o
<9> the io is debugging
<10> make a purer func()
<10> doesnt matter
<9> it will NOT get displayed in final
Return to
#linux
or
Go to some related
logs:
portage package.use recompile
#bash
#css
gentoo requested range not satisfiable
#debian
mathematics without choice
#bash
xhtml-im gaim
american army for linux -forum -forums
debian reinstall fonts
|
|