raocow's talkhaus

WhattayaBrian wrote:Waits for modules

RenaBeach wrote:i wrapped those with swig

it was pretty easy to set up (swig just outputs a C/C++ source file that wraps your C/C++ types/functions for lua) - then you just link against it, or compile it as a dll and load it at runtime

i don't think lua really knows anything about the types - it just creates tables with pointers to wrapper functions that can be called

swig supports python too btw (and many other embeddable languages)

Horikawa Otane wrote:Playing around with javascript...

This code works:

Code: Select all

pies = 60;
ǃpies = 50;
while(ǃpies < pies) {
	console.log(ǃpies);
	ǃpies = ǃpies + 1;
}
console.log(!pies);

This code outputs...

Code: Select all

50
51
52
53
54
55
56
57
58
59
false 

Programming is weird.

ǃpies = 50

Horikawa Otane wrote:

WhattayaBrian wrote:I just read the wiki article on Javascript identifier syntax, and I still have no idea what this is doing. Is it nonstandard? That would explain everything.

I've updated it with python doing the same thing. It seems to only like outputting in loops.

C:\Users\Hawk>python
Python 3.3.0 (v3.3.0:bd8afb90ebf2, Sep 29 2012, 10:57:17) [MSC v.1600 64 bit (AMD64)] on win32
Type "help", "copyright", "credits" or "license" for more information.
>>> !pies = 50
  File "<stdin>", line 1
    !pies = 50
    ^
SyntaxError: invalid syntax

RenaBeach wrote:also AreRelated should obviously return bool

RenaBeach wrote:

return "normal"; //the person is normal

ableist :(

Prof. Air Check wrote:Create a report, called DNAanalysis.txt, that indicates whether each person
is anemic, a carrier, or normal. For example,
Person X is anemic.
Person Y is normal.
Person Z is a carrier.

Ashan wrote:I had a CS lab today and I only remembered it last night, and I was all worried because there was this optional thing last week to "practise" for it, and I kinda skimmed it and got completely lost (it was like some weird formula you were supposed to implement in like, a fake web search algorithm and their explanation made no sense) so I was expecting a really hard test.

It ended up being super easy. Take in an array of 10 integers, print out the array in reverse order, and then print out the sum of the odd integers.
No idea why their practice thing was so complicated.

doStuff :: (Show a, Integral a) => [a] -> IO ()
doStuff i = do
    sequence_ . map (putStrLn . show) . reverse $ i
    putStrLn . show . sum . filter odd $ i