|
Van Kraken posted:quick update on emulator:
|
# ? Aug 15, 2017 05:53 |
|
|
# ? May 25, 2024 21:40 |
|
Luigi Thirty posted:what the hell were you emulating that used a MIPS processor n64 was mips
|
# ? Aug 15, 2017 06:26 |
|
cis autodrag posted:n64 was mips i know lots of things were mips! it's just they're all mid-90s 3d poo poo that's hard to emulate for various reasons
|
# ? Aug 15, 2017 06:47 |
|
Star War Sex Parrot posted:Got this on a public repo? https://github.com/colevk/GameBoy it's currently configured for xcode 9 beta and swift 4, though, so if you don't have those i'm not sure how much effort it would be to convert it back.
|
# ? Aug 15, 2017 09:13 |
|
Lutha Mahtin posted:i think it's best to start out with the questions "who is my audience", "what is the point of this training supposed to be", and "what are my constraints" (i.e. time and other resources). it sounds like you have some flexibility in designing the class; imo this is good and might be a big key to your success this is a v. good post, thanks. i need to figure out what the actual point of this is first before i can figure out the rest, i guess
|
# ? Aug 15, 2017 09:31 |
|
I just wanted to say, CLion is good.
|
# ? Aug 15, 2017 11:40 |
|
Sapozhnik posted:but again, the actual music is hardware-encrypted and afaik nobody's figured out the fpga/cpld/whatever that sits between the cpu and the mp3 decoder chip. and if capcom cps3 is anything to go by then there were a lot of surprisingly competent bored amateur cryptographers working at japanese game companies around the turn of the century. weren't they just xor tables, though?
|
# ? Aug 15, 2017 15:45 |
|
cinci zoo sniper posted:how's the structure suited for ad hoc analytics by people used to generic row databases? column-oriented databases and olap poo poo in general assumes you are gonna spend most of your time doing complete table scans. it's "column-oriented" because it stores all the data for a given column contiguously, in order to be easily slurped up by a single read on a lovely spinny disk ordinary RDBMSes store data in rows because they expect you to have a schema designed for your common query patterns, with indices to support the queries. they want to be able to cherry-pick specific rows with a minimum number of seeks, and the index will tell them where the "answers" are for a given "question." with OLAP workloads you don't know what the common queries will be, so you can't design the schema or create indices ahead of time! -- map/reduce and hive and friends are the logical furthest extreme of a column-oriented database. every query will read the entire database and process all data. there's often no indexing, schema, or optimization whatsoever downside: simple queries can take literally 60 seconds to execute upside: extremely complex queries still only take 60 seconds to execute you have a very high floor and a very low ceiling on execution time. sucks for rendering a web page in real time, rules for answering analytics questions for your BI team
|
# ? Aug 15, 2017 15:56 |
|
CPColin posted:Apparently one of the teams at my new job uses COBOL.NET, which is bad enough, but they also have functionality that's basically a big string containing old COBOL code that's passed to an interpreter. migrating your legacy COBOL code to a modern platform is good and cool failing to test your legacy code because the harness would be more complicated than just pointing nunit at it is a big lovely ball of failure and sadness, though. fuckin fix that, you assholes
|
# ? Aug 15, 2017 15:58 |
|
Yeah, I was thinking, "There's really no output from this legacy code that you can check with an automated process? At all?" but I didn't want to be That Guy who comes in on his seventh day at a new job and tells everybody they're doing it wrong.
|
# ? Aug 15, 2017 16:03 |
Notorious b.s.d. posted:column-oriented databases and olap poo poo in general assumes you are gonna spend most of your time doing complete table scans. it's "column-oriented" because it stores all the data for a given column contiguously, in order to be easily slurped up by a single read on a lovely spinny disk hmm, this is something. i don't generally make complex queries, but consistency sounds good enough. the latency thing otoh is something to consider, given that we may intend to render some analytics to a web solution in real time-ish fashion. either way this and previous posts about my question should be good enough for the rnd day. ill probably return on thursday with more stupid columnar db questions
|
|
# ? Aug 15, 2017 16:17 |
|
CRIP EATIN BREAD posted:weren't they just xor tables, though? XOR tables aren't a crack, they're a way to "legally" distribute the decrypted data (by distributing them as a set of bit flips you apply to the illegally-distributed ciphertext). I can create XOR tables that "decrypt" any sufficiently-large file to hello.jpg for all that matters.
|
# ? Aug 15, 2017 16:20 |
|
Van Kraken posted:https://github.com/colevk/GameBoy
|
# ? Aug 15, 2017 16:32 |
|
cinci zoo sniper posted:hmm, this is something. i don't generally make complex queries, but consistency sounds good enough. the latency thing otoh is something to consider, given that we may intend to render some analytics to a web solution in real time-ish fashion. either way this and previous posts about my question should be good enough for the rnd day. ill probably return on thursday with more stupid columnar db questions it's not about the complexity of the query, it's about the predictability of the query. even a simple select will murder RDBMS performance if the schema + indices were not designed for that particular query. if you are going to make a similar pattern of complex queries over and over, you can design an appropriate schema for your RDBMS to handle the load. if you don't know what the query pattern will be ahead of time, you are in OLAP-land, and that is a really bad place to be.
|
# ? Aug 15, 2017 16:34 |
Notorious b.s.d. posted:it's not about the complexity of the query, it's about the predictability of the query. even a simple select will murder RDBMS performance if the schema + indices were not designed for that particular query. hm, this makes sense and kinda sounds where we are, even tho query pattern could be designed ahead of time (given time which we dont, as always)
|
|
# ? Aug 15, 2017 16:46 |
|
I've spent most of today working out how to scale Snapchat's company logo in JavaScript
|
# ? Aug 15, 2017 21:13 |
|
HoboMan posted:the only real bug is it crashes if a network call fails. it's a real important bug, but hopefully fixing it won't take much more than figuring out where to put the try-catches is the network call being made on the UI thread? if your previous person didn't understand try/catch, this is something i would check for also, check out OkHttp if you want an easy-mode way to do http networking on android
|
# ? Aug 15, 2017 22:58 |
|
well it took like 4 hours but I can rotate a shape around the origin and draw it on the screen ...in 320x200 1bpp graphics mode ...using the FPU library in AmigaOS
|
# ? Aug 16, 2017 01:11 |
So I'm trying to write a C++ function which takes a mapping of std::string -> <some stringified value>, and a list of std::string keys, and which returns an std::tuple of de-stringified values. The reason I would want to write such a thing is that I'm working with files which are basically a set of lines which look like key: stringified value. Like so:pre:height: 5.5 weight: 130 poops: nutty C++ code:
C++ code:
pre:test_file_cache.cpp:59:23: error: no viable overloaded '=' std::tie(person.height, person.weight, person.poops) = ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/tuple:501:29: note: candidate function (the implicit move assignment operator) not viable: no known conversion from 'tuple<(no argument), (no argument), (no argument)>' to 'tuple<double &, int &, std::__1::basic_string<char> &>' for 1st argument class _LIBCPP_TYPE_VIS_ONLY tuple ^ /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/tuple:501:29: note: candidate function (the implicit copy assignment operator) not viable: no known conversion from 'tuple<(no argument), (no argument), (no argument)>' to 'const tuple<double &, int &, std::__1::basic_string<char> &>' for 1st argument /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../include/c++/v1/tuple:693:26: note: candidate template ignored: disabled by 'enable_if' [with _Tuple = std::__1::tuple<>] __tuple_assignable<_Tuple, tuple>::value ^ edit: added full error edit 2: got it working! See post below. VikingofRock fucked around with this message at 03:44 on Aug 16, 2017 |
|
# ? Aug 16, 2017 02:06 |
|
lol if you don't do literally everything you can in the db. just lol
|
# ? Aug 16, 2017 03:01 |
Woohoo, I got it working!C++ code:
e: formatting VikingofRock fucked around with this message at 03:46 on Aug 16, 2017 |
|
# ? Aug 16, 2017 03:43 |
|
goddamn lua is a loving lovely language
|
# ? Aug 16, 2017 07:50 |
|
so i'm collaborating with a friend to produce a dumb video game and i've essentially been forced to code it using love2d, an otherwise fine API but for lua, which is by far one of the worst programming language i've ever experienced. i've been using it a couple of weeks and i can say it honestly hasn't grown on me.
|
# ? Aug 16, 2017 07:52 |
|
Why do you need more than one number type? Numbers are numbers
|
# ? Aug 16, 2017 08:26 |
|
Lua 5 runs on my Amiga 2000 so it is the only language I use for literally anything.
|
# ? Aug 16, 2017 08:28 |
|
Number of elements in a table is not easy to get and the result depends on how you do this (or what you mean by "length"). This is probably not surprising, given how powerful tables are in Lua and the fact that they support flexible indexing (by numbers and any other Lua type except nil). Tables in Lua have two parts: an "array/vector" part (generated with t = {1, 2, 3}) and a "hash" part (generated with t = {a = "foo", ["b"] = 2}); the two can be flexibly combined. #table returns the length of the shortest "array/vector" part (without any gaps) and table.maxn(t) returns the longest "array/vector" part (this function is removed in Lua 5.2). The "hash" part doesn't have a defined length. Both parts can be iterated over using the pairs method, which allows you to count the number of elements in them. However, print(#{1, 2, nil, 3}) prints 4 and not 2 as one may expect, whereas print(#{1, 2, nil, 3, nil}) prints 2. I'm sure there is a good reasonable explanation for this, but for now it is in the "ugly" bucket. [Updated 11/17/2012] As FireFly noted in the comments, in Lua 5.2 the length operator is only defined for tables that don't have holes in them.
|
# ? Aug 16, 2017 08:36 |
gonadic io posted:Number of elements in a table is not easy to get and the result depends on how you do this (or what you mean by "length"). This is probably not surprising, given how powerful tables are in Lua and the fact that they support flexible indexing (by numbers and any other Lua type except nil). Tables in Lua have two parts: an "array/vector" part (generated with t = {1, 2, 3}) and a "hash" part (generated with t = {a = "foo", ["b"] = 2}); the two can be flexibly combined. #table returns the length of the shortest "array/vector" part (without any gaps) and table.maxn(t) returns the longest "array/vector" part (this function is removed in Lua 5.2). The "hash" part doesn't have a defined length. Both parts can be iterated over using the pairs method, which allows you to count the number of elements in them. However, print(#{1, 2, nil, 3}) prints 4 and not 2 as one may expect, whereas print(#{1, 2, nil, 3, nil}) prints 2. I'm sure there is a good reasonable explanation for this, but for now it is in the "ugly" bucket. [Updated 11/17/2012] As FireFly noted in the comments, in Lua 5.2 the length operator is only defined for tables that don't have holes in them. what the gently caress did i just read
|
|
# ? Aug 16, 2017 08:54 |
|
lua is incredibly bad and unpleasant to code in. I might even say it's worse than javascript. it is very easy to embed though so I end up using it quite a lot anyway
|
# ? Aug 16, 2017 09:48 |
netcat posted:lua is incredibly bad and unpleasant to code in. I might even say it's worse than javascript. it is very easy to embed though so I end up using it quite a lot anyway explains lua in wow and garrys mod
|
|
# ? Aug 16, 2017 09:50 |
|
Lua for whatever reason reminds me of the Userland Frontier language and environment it was a hierarchical database with code in it, where database locations and variables and functions etc were all kind of interchangeable (sound familiar, mmmm?) except of course the language, being designed in the late 1980s, was actually superficially C-like here, have a look at all its System 7-esque weirdness
|
# ? Aug 16, 2017 13:17 |
|
neat
|
# ? Aug 16, 2017 15:01 |
|
redleader posted:lol if you don't do literally everything you can in the db. just lol so you're a fan of seeding a table with entropy and reading sequential rows as a RNG?
|
# ? Aug 16, 2017 15:05 |
|
lua is... ok
|
# ? Aug 16, 2017 15:28 |
|
if the choice was between making 2 db calls and making 1 but putting some business logic in the db we have gone with the putting logic in the db every time. would not recommend
|
# ? Aug 16, 2017 16:34 |
|
For some reason everything in lua has to be different purely to be different. Not equals operator is != Right? Wrong. It's ~=. So ~ must be the not operator. Wrong again, 'not' is the not operator. Props to anyone who can tell me how to inherit in lua without having to Google it. Don't even get me started on arrays being 1-indexed.
qhat fucked around with this message at 17:16 on Aug 16, 2017 |
# ? Aug 16, 2017 17:13 |
|
qhat posted:Props to anyone who can tell me how to inherit in lua without having to Google it. lua has no classes so "inherit" is a bit weird. i assume you mean metatable fuckery like this Lua code:
Pollyzoid fucked around with this message at 20:27 on Aug 16, 2017 |
# ? Aug 16, 2017 20:22 |
|
lua is cool because of how tiny the interpreter is, and how easy it is to bend it to your will. i have a ton of devices in the field (vehicle/asset tracking) that run lua with fake threads to provide services on a platform with very little power.
|
# ? Aug 16, 2017 20:39 |
|
use lovely javascript if you need a lovely embedded language https://docs.cesanta.com/v7/master/ i don't know about threading though
|
# ? Aug 16, 2017 22:11 |
|
lua is actually better than javascript, which is impressive
|
# ? Aug 16, 2017 22:54 |
|
|
# ? May 25, 2024 21:40 |
|
lua inheritance is still far better than javascript prototyping
|
# ? Aug 16, 2017 22:56 |