search of the:   for: 
code logs -> 2007 -> Tue, 25 Sep 2007< code.20070924.log - code.20070926.log >
--- Log opened Tue Sep 25 00:00:40 2007
00:32
< MinceR>
gn
01:17 * McMartin bends DocBook to his will
02:39 gnolam [lenin@Nightstar-10613.8.5.253.static.se.wasadata.net] has quit [Quit: Z?]
03:31
<@McMartin>
So, yes. I figured out which packages I was missing.
03:32
<@McMartin>
I now have a very nicely printed copy of Programming With Ophis to do my copyediting on.
03:32
<@McMartin>
And my first reaction is "Dude, I totally need to add more sections."
03:44
<@McMartin>
Once I finish drafting, reorganizing, and cross-referencing it, is anyone willing to help edit/beta-read an assembler manual?
03:44
< Vornicus>
How big do you expect it to be?
03:45
<@McMartin>
30 pages, tops
03:45
< Vornicus>
I can do that.
03:46
<@McMartin>
Also, as a Pythonista, do you know if distutils can make .app files?
03:47
< Vornicus>
I haven't the foggiest idea. If it can't though .apps are just folders with special structures.
03:47 * McMartin nods
03:47
<@McMartin>
I may end up poking you later to see if I can't make a point-and-shoot version of this for OS X, then.
03:48
<@McMartin>
Actually, .app isn't what we want anyway, since it's a terminal application.
03:48
< Vornicus>
ah, well
03:48
<@McMartin>
So it might just be standard POSIX-style "jam everything into /usr/local/lib and /usr/local/bin"
03:48
< Vornicus>
if it's a terminal app you can do POSIX style.
03:52 * McMartin nods
03:56
<@McMartin>
In that case, the sdist should work just as well
04:15 GeekSoldier|Bed is now known as GeekSoldier|work
04:19 Raif [~corvusign@Nightstar-5406.hsd1.ca.comcast.net] has quit [Killed (NickServ (GHOST command used by Raif_))]
04:20 Raif_ [~corvusign@Nightstar-5406.hsd1.ca.comcast.net] has joined #Code
04:20 Raif_ is now known as Raif
05:40
<@McMartin>
Vornicus: OK, so, about ten of those thirty pages are nothing but program listings, and as such aren't terribly important~
05:43
< Vornicus>
heh, ok.
05:44 * McMartin gets it to turn them into internal hyperlinks in the HTML version
05:51
<@McMartin>
Whoops, there's another whole section I need to write.
05:51
<@McMartin>
Or, rather, adapt from pre-existing web pages.
06:25
<@McMartin>
12 pages edited
06:28
<@McMartin>
Yuck.
06:28 * McMartin throws Chapter 7 out almost entirely.
07:10 GeekSoldier|work [~Rob@Nightstar-3621.pools.arcor-ip.net] has quit [Ping Timeout]
07:12 GeekSoldier|work [~Rob@Nightstar-4354.pools.arcor-ip.net] has joined #code
07:43 ReivZzz is now known as Reiver
07:57 Vornicus is now known as Vornicus-Latens
08:11 gnolam [lenin@Nightstar-10613.8.5.253.static.se.wasadata.net] has joined #Code
08:11 mode/#code [+o gnolam] by ChanServ
08:31 You're now known as TheWatcher
08:53 gnolam is now known as gnolam|Uni
09:02 Raif [~corvusign@Nightstar-5406.hsd1.ca.comcast.net] has quit [Ping Timeout]
10:25 Chalcedon [~Chalcedon@Nightstar-2472.ue.woosh.co.nz] has quit [Quit: Gone]
11:28 gnolam|Uni is now known as gnolam
11:37 * gnolam pokes the SVN server.
11:43
<@gnolam>
I'm starting to believe it's hosted on a 300 baud line.
13:00
< MinceR>
hay
14:09 * AnnoDomini wants a generic PCI Ethernet card driver, but so far is having no luck with Google-Fe.
14:09
<@AnnoDomini>
*Fu
14:18
<@ToxicFrog>
...I don't think there is such a thing, AD.
14:19
< MinceR>
i don't think there can be such a thing.
14:20
<@ToxicFrog>
Unlike, say, VGA or SVGA, there's no commonly used interface.
14:23
<@AnnoDomini>
What
14:23
<@AnnoDomini>
? Why, in that case, many of my cards work with drivers for OTHER cards.
14:24
<@AnnoDomini>
s/./?
14:25
<@ToxicFrog>
Probably because they're based on the same chipset.
14:25
<@AnnoDomini>
Yeah. So far I haven't seen any PCI card based on a different one.
14:25
<@ToxicFrog>
There's a few widely used ethernet chipsets - I believe Tulip is one - such that drivers for a specific card using that chipset will usually work with other cards that use it, too.
15:03 * AnnoDomini mumbles about needing a new motherboard.
16:00 Reiver is now known as ReivZzz
16:41 Vornicus-Latens is now known as Vornicus
17:16 GeekSoldier|work is now known as GeekSoldier
18:51
<@ToxicFrog>
aaaaaaaaagh
18:51
<@ToxicFrog>
fuck you, Java
18:51
<@AnnoDomini>
What's it done now?
18:51
<@ToxicFrog>
String manipulation ;.;
18:54
<@ToxicFrog>
And the fucking inconsistent class (non)-tree, again/still.
18:56
<@ToxicFrog>
Maybe I should just drop this course
19:05 Mischief [~Genesis@Nightstar-7565.hsd1.md.comcast.net] has quit [Ping Timeout]
19:15 Mischief [~Genesis@Nightstar-7565.hsd1.md.comcast.net] has joined #code
19:18 * EvilDarkLord is taking a course with forced Java, feels TF's pain.
19:23 Forj [~Forj@Nightstar-2472.ue.woosh.co.nz] has joined #code
19:23 mode/#code [+o Forj] by ChanServ
19:25
<@McMartin>
What are you trying to do with the strings?
19:26
<@McMartin>
I've written multiple parsers and code generators in Java, I know my way around String* and java.util.Regex reasonably well.
19:26
<@McMartin>
ER.
19:26
<@McMartin>
java.util.regex.*, rather
19:50 Forj [~Forj@Nightstar-2472.ue.woosh.co.nz] has quit [Quit: Gone]
19:52
<@ToxicFrog>
I got it sorted out using a Scanner
20:10
<@McMartin>
Ah.
20:11
<@McMartin>
You may find the StringReader and StringWriter classes of some use at some point as well.
20:11
<@McMartin>
I think they're in java.io.
20:11
<@McMartin>
They let you fake files with strings.
20:11
<@ToxicFrog>
I am unlikely to need those at this time, but I'll keep them in mind.
20:12
<@McMartin>
StringWriters in particular are very nice for when you need to serialize a large, complex object.
20:13
<@McMartin>
Instead of getting the handle you're serializing *to* you just make a StringWriter and dump to *that* in toString().
20:14
<@ToxicFrog>
Yeah, at the moment I'm just serializing small, simple objects consisting of strings and (arrays of) numbers.
20:14
<@ToxicFrog>
class OpRequest implements Serializeable {
20:15
<@McMartin>
It occurs to me that my nominal McMUtil.ReallySerializable only has one method, and it's not really an Interface method.
20:15
<@McMartin>
static (thisclass) fromString(String)
20:31
< Syloqs-AFH>
ping
20:33
<@AnnoDomini>
Pong.
20:37
< GeekSoldier>
flop
20:39
< MinceR>
flip
20:47
<@AnnoDomini>
w*(¬(¬f+¬l)*¬(¬o+¬p))+¬w(¬(¬f+¬l)*¬(¬o+¬p))
20:48
< MinceR>
what does that look like in utf-8?
20:49
<@ToxicFrog>
w and (not (not f or (not l)) and (not (not o) or (not p))) or not w and (not (not f or not l) and not (not o or not p))
20:50
< MinceR>
ow.
20:50
<@ToxicFrog>
Although, as long as you're using UTF-8, you might as well use ? and ? rather than * and +
20:51
< MinceR>
he isn't using utf-8, i am.
20:51
<@ToxicFrog>
...so am I, and it came through fine.
20:51
< MinceR>
(that or my fonts are incomplete.)
20:51
< MinceR>
oh.
20:51 GeekSoldier is now known as GeekSoldier|bed
20:51
<@AnnoDomini>
I'm using default mIRC settings.
20:52
<@AnnoDomini>
"<ToxicFrog> Although, as long as you're using UTF-8, you might as well use ? and ? rather than * and +" <- This is what I see.
20:52
<@AnnoDomini>
Damnit.
20:53
<@AnnoDomini>
Seems to be only unknown blocks in the channel, but weird shite in the edit box.
20:55
<@ToxicFrog>
Well, what I see - in both what I typed, and what you pasted - is the logical or operator (similar to v and the logical and operator (similar to ^).
20:55
<@ToxicFrog>
Only in the opposite order.
20:56
<@AnnoDomini>
Oh, those. I don't think my font supports them.
20:57
<@AnnoDomini>
Hrm. No font of mine seems to parse those.
20:57
<@ToxicFrog>
Odd.
20:58
<@ToxicFrog>
It's codepoints 2227 and 2228.
21:01 Chalcedon [~Chalcedon@Nightstar-2472.ue.woosh.co.nz] has joined #code
21:01 mode/#code [+o Chalcedon] by ChanServ
21:02 Black_Phoenix [~phoenix@193.151.57.ns-4218] has joined #Code
21:03
< Black_Phoenix>
Hi, anyone here?
21:03
< MinceR>
yes
21:03
< Black_Phoenix>
awesome xD
21:03
< Black_Phoenix>
by the way, hi from #gamedev @ gamedev.ru xD
21:04
<@AnnoDomini>
How droll.
21:13 Zemyla [~Zemyla@168.53.172.ns-23758] has joined #code
21:23
< Zemyla>
Hey everyone.
21:24
< Black_Phoenix>
Hey Zemyla
21:29
<@McMartin>
My PuTTY font doesn't have logical and or or.
21:29
<@McMartin>
I bet my gnome-terminal at home does, though
21:29
< Zemyla>
What about not?
21:30
<@McMartin>
Not I have.
21:32
<@McMartin>
(Not's technically in Latin-1, and the font here has all of Latin-1 and a bunch of other stuff. Just not, apparently, extended logical operators.)
21:42 KarmaBot [~fark.off@87.72.35.ns-26506] has joined #Code
21:42 mode/#code [+v KarmaBot] by ChanServ
21:50 Zemyla [~Zemyla@168.53.172.ns-23758] has quit [Ping Timeout]
22:26 * gnolam smacks Apache over the head with a 2x4.
22:32 * McMartin finishes developing the weirdest program ever.
22:32
<@McMartin>
Well, maybe not ever
22:32
<@McMartin>
It does nothing useful.
22:33
< Black_Phoenix>
Tell us what it does
22:33
< Black_Phoenix>
Or show screenshots :D
22:33
<@McMartin>
It's not interesting when run.
22:33
< Black_Phoenix>
It has interesting icon?
22:33
<@McMartin>
I'll list its hex dump, or the beginning of it:
22:33
<@McMartin>
00 01 01 05 05 06 06 08 09 09 0a 0d 0d 0d 0e 0e 0e 10 10...
22:34
<@McMartin>
And so on, up through FE FE FE.
22:34
< Black_Phoenix>
Hex of what
22:34
<@McMartin>
The resulting binary.
22:34
< Black_Phoenix>
The program, the code of program, source code, or what it results in
22:34
<@McMartin>
They're regression tests for an assembler, designed to have an easy-to-check binary result.
22:35
< Black_Phoenix>
Ah
22:35
<@McMartin>
So it goes through every opcode in every addressing mode, using the opcode itself repeatedly as any argument.
22:41
< Black_Phoenix>
Your assembler?
22:41
<@McMartin>
Yeah
22:41
< Black_Phoenix>
x86?
22:41
<@McMartin>
65xx
22:42
< Black_Phoenix>
nice
22:42
<@McMartin>
x86's instruction mechanism isn't simple enough to allow monotonically increasing binaries, I don't think
22:43
< Black_Phoenix>
What do you mean by increasing?
22:43
<@McMartin>
When reading the binary a byte at a time, each byte is greater than or equal to the one before it.
22:44
< Black_Phoenix>
Oh, you mean having such instructions so each next byte is greater or equal to previous one?
22:45
<@McMartin>
Yeah. That way I have a test file that runs through all possible instructions, is easy to hand-check once, and then I can use the resulting binaries to regression test later.
22:45
< Black_Phoenix>
x86 has some unused opcodes (first byte)
22:45
< Black_Phoenix>
so it should be impossible
22:46
<@McMartin>
Yeah, so do the various 65xx chips. I skip those.
22:46
<@McMartin>
I'm not going for a perfect run from 00 to FF, inclusive.
22:46
<@McMartin>
(ALso, on some chips, the same opcodes do different things, so that's no good. I use different source files for each extension)
22:49 Chalcedon is now known as ChalcyAFK
22:49
<@AnnoDomini>
I need some sorting advice. The problem is determining the X lowest values of a given random set - but the values aren't all known at start, they roll in one at a time. Assuming lack of arrays, how would one tackle this? Somehow, I can't wrap my head around it.
22:50
<@McMartin>
Keep a tally of the X lowest seen so far, update on each new value.
22:50
<@McMartin>
You'll also need to special case "I haven't even seen X values yet".
22:50
< Black_Phoenix>
you can have a fixed size "list" of them
22:51
< Black_Phoenix>
once you get new one, find its position, and shift everything
22:51
< Black_Phoenix>
thats if you have more than 2-3 values, for which you can use simple if+variables
22:54
<@AnnoDomini>
So I really need a sort-of array then?
22:54
<@McMartin>
Yeah, but it only has to be X long.
22:54
<@McMartin>
For the trivial case, imagine X is 1.
22:54
< Black_Phoenix>
or 2
22:54
<@McMartin>
Now you just need a variable.
22:54
< Black_Phoenix>
or two variables
22:54
<@McMartin>
After you see one element, that's the smallest in the list.
22:55
<@McMartin>
After you see each additional element, you check to see if it's smaller, and if so, that's the smallest; otherwise, no change.
22:55
<@McMartin>
With 2 you might as well do it for any number.
22:56
<@AnnoDomini>
Yes, yes, I know how to do it for X=1. That's not the issue. What I want is something extensible into X>1... But from what you're telling me, I will have to muck in mIRC hash tables.
22:56
< Black_Phoenix>
mIRC?
22:56
< Black_Phoenix>
You can just have several variables, array like
22:56
<@McMartin>
How large is X?
22:56
< Black_Phoenix>
something like a1,a2,a3
22:57
< Black_Phoenix>
not much though, or else its gonna turn into nightmare
22:57
<@McMartin>
If X is configurable, life is hard, yes, but otherwise, what BP said.
22:57
<@AnnoDomini>
McMartin: I assume no sane person will go beyond 4.
22:57
<@AnnoDomini>
But then there's the crazies...
22:57
<@McMartin>
Are you writing an appliaction or a library?
22:57
< Black_Phoenix>
he's writing mirc script
22:57
<@AnnoDomini>
A dice parser.
22:57
< Black_Phoenix>
right?
22:57
<@AnnoDomini>
Yes.
22:58
<@McMartin>
What I mean is, are you doing something that you expect other programmers to use, or just you
22:58
<@McMartin>
If the latter, you don't need to worry about X.
22:58
<@McMartin>
Just set it to a number you need, maybe a little more.
22:58
<@AnnoDomini>
!roll 3d6l: I want to make a better version of this script, see?
22:58
<+KarmaBot>
[AnnoDomini] rolled 3d6l "I want to make a better version of this script, see?": ((6+4+5-4)) = 11.
22:58
<+DiceBot>
[AnnoDomini] rolled 3d6l "I want to make a better version of this script, see?": ((6+2+4-2)) = 10.
22:59
< Black_Phoenix>
He wants people to specify something
22:59
<@AnnoDomini>
I'm overhauling KarmaBot's code.
22:59
< Black_Phoenix>
X
22:59
< Black_Phoenix>
D:
23:00 * AnnoDomini goes look up the hash table entry in mIRC's helpfile.
23:00
< MinceR>
sounds like a job for a Priority Queue to me
23:00
<@McMartin>
MinceR: Yeah, but we can cheat because we can chuck anything past a certain point entirely
23:01
< MinceR>
yes.
23:01
<@McMartin>
That makes it much simpler.
23:03 AnnoDomini [AnnoDomini@Nightstar-29047.neoplus.adsl.tpnet.pl] has quit [Ping Timeout]
23:05
< Black_Phoenix>
Anyone has some nice screenshots to show?
23:05
<@McMartin>
Of?
23:05
< Black_Phoenix>
Of anything
23:05
<@McMartin>
http://sc2.sf.net/
23:05 AnnoDomini [AnnoDomini@Nightstar-29056.neoplus.adsl.tpnet.pl] has joined #Code
23:06 mode/#code [+o AnnoDomini] by ChanServ
23:06
< Black_Phoenix>
cool xD
23:06
< Black_Phoenix>
Is thats some post-edit, or thats a really nice filter (for image resizing) I see on screenshots
23:06
< Black_Phoenix>
Oohh
23:06
< Black_Phoenix>
Nvm
23:06
<@McMartin>
It's a variant of SuperSAI, I believe.
23:07 You're now known as TheWatcher[T-2]
23:07
<@McMartin>
The latest version also has implementations of Scale2x and HQ2x.
23:07
< Black_Phoenix>
Theres nice filter called smartrezise if I remember
23:07
< Black_Phoenix>
No, wrong name, one sec
23:07
<@McMartin>
In more mundane applications, http://blorple.sf.net/
23:08
< Black_Phoenix>
Yeah, smart filter
23:10
< Black_Phoenix>
I've been writing physics engine lately, the one which would support deformations/breakable props
23:10
<@AnnoDomini>
Hrm. I think it'll be quicker if I write some kind of sorting script, and feed it the values obtained from the dice function, therafter getting X lowest values.
23:11
< Black_Phoenix>
http://phoenix.forest-tm.com/wp-content/uploads/2007/09/1e11260tmp.jpg meh, here's nice screenshot, kind of
23:11
< Black_Phoenix>
That thing fell from some height, just on its edge, and bounced so it landed on other edge
23:11 You're now known as TheWatcher[zZzZ]
23:12
< Black_Phoenix>
Gonna go now, see you later
23:13 Black_Phoenix [~phoenix@193.151.57.ns-4218] has quit [Quit: ]
23:18 * Kyrre sets AD on fire, sortof.
23:18 * AnnoDomini stops, drops and rolls. Sort of.
23:19 * Kyrre is amused. Sort of.
23:20 gnolam [lenin@Nightstar-10613.8.5.253.static.se.wasadata.net] has quit [Quit: Z?]
23:21
<@AnnoDomini>
Yay bubble sort.
23:33 ChalcyAFK is now known as Chalcedon
23:36
< MinceR>
merge sort.
23:41 Forj [~Forj@Nightstar-2472.ue.woosh.co.nz] has joined #code
23:41 mode/#code [+o Forj] by ChanServ
23:41 Forj [~Forj@Nightstar-2472.ue.woosh.co.nz] has quit [Quit: Gone]
23:42
<@AnnoDomini>
Whoah. It works on the first try.
23:58
<@AnnoDomini>
Hm. Given big numbers, it gives erroneous results. Eh. I'll try to fiddle with it in the morning.
--- Log closed Wed Sep 26 00:00:47 2007
code logs -> 2007 -> Tue, 25 Sep 2007< code.20070924.log - code.20070926.log >
 search of the:   for: