« first day (1762 days earlier)      last day (3097 days later) » 

5:00 AM
@feersum Can you give an example of that besides speed?
 
Speed and memory are the main cases.
If you code in Java for example, there's no way to stop memory bloat, unless you stored all of the data in your program in a gigantic int array.
 
@El'endiaStarman I think 1.5 bytes might be a good balance
 
I mean, there's no way to avoid the presence of pointers for every object, when they may be unnecessary.
 
I certainly won't be coding in Java. Probably Python, maybe C#. I'm expecting this language to be quite complex, and I have relatively good ideas of what it would take to do certain features in Python, but C# is kinda a big unknown. On the other hand, it would be a fantastic way to learn C#, I think.
 
@Dennis No Bubblegum? :P
 
5:06 AM
@ThomasKwa So, maybe something like 1xxx denotes math, trig, graphics, etc? And 1000 would be something like switching instruction layers, as in (assuming math is 1001), 10001001 would be even more advanced/rare math operations.
 
@El'endiaStarman I think one thing that makes a language powerful to think in is the ability to just try stuff. It's pretty much required that it have a powerful REPL, especially one that lets you write stuff that takes multiple lines, leave it there, execute earlier stuff in random order. Like editing LISP in emacs.
 
@El'endiaStarman I'm fascinated by the idea that succinctness is just as important to readability as having each line be readable
@El'endiaStarman That sounds good!
 
@quintopia My plan for the parser should make it pretty easy to do a REPL.
 
@ThomasKwa succinctness as measured in the number of distinct elements, to be sure
 
Yeah, one goal is to make the number of distinct elements small.
 
5:07 AM
I think control-flow statements are inherently harder to read than data-flow ones, though
I think that's a reason that APL, despite having lots of elements, is acceptably readable.
 
@ThomasKwa Mind elaborating on the difference?
 
@ThomasKwa Under this theory, where does Pyth land?
 
The problem with APL is that no two people speak the same dialect.
 
@El'endiaStarman Hmm
 
@isaacg Pyth is inherently unreadable just on the basis of not-very-memorable tokens
@isaacg hence why explanations generally separate chunks of it onto separate lines and explain what each does (the lack of inherent chunking also makes it unreadable)
 
5:16 AM
Lack of automatic chunking is an issue
But many of the tokens are quite memorable
 
of course
to you
 
f is filter
m is map
Just not all of them
 
another threat to readability is just knowing what variable assignments are being done in the background
like
 
Yeah, that's getting changed in Pyth5
 
you have to remember when you see "m" to say "that assigns members of the sequence to d"
 
5:18 AM
to be easier to remember
It'll be assign to a in the first lambda, b in the second lambda, etc.
Thanks for the advice.
 
0
Q: Find a one liner in vb for case function when case increments every 5 natural numbers

cMinorHaving a number greater or equal to 10 and having a max case when is equal to 70 like: Select Case number Case 10 To 14 Return 10 Case 15 To 19 Return 14 Case 20 To 24 Return 17 Case 25 To 29 Return 20 Case 30 To 34 Return 25 Case 3...

 
...so now you have to count how many lambdas in you are?
 
What nesting depth you're at, actually.
 
that's what i meant
you know what would help more than any language changes?
a visual editor, with all the tokens given longer names
 
@quintopia, have you taken a look at Minkolang's online interpreter? If so, what did/do you think?
 
5:21 AM
you type "m" and "map(a:" appears or something like that
@El'endiaStarman no
 
this is amusing - gibberish passed off as a brainfuck answer
3
A: When is Thanksgiving?

Lane SurfaceBrainfuck, 84 Bytes This one's significantly shorter than my Jython version. Computes the date based of of an offset from the beginning of the year and adds one for leap years. ,+++[>++++++++++<-]>[>+++++++++++<-]>>++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>>>[<<<<+] Edit: 97 Bytes Forgot to s...

 
If you don't mind... --> n3;1-1Md1%-2;N. outputs the largest square less than N^3, where N is given through input.
 
i love how he continues to defend it after being called out
 
@quintopia I'll look into.
 
@ThomasKwa /me waits patiently
 
5:37 AM
does haskell have a way to count elements of a list that's shorter than length$filter(==x)?
or sum[1|y<-l,y==x]
 
@MitchSchwartz apparently deleted?
 
@quintopia Apparently, a 22k rep user telling them their code obviously didn't work and flagging it as not an answer helped.
 
@El'endiaStarman After some thought, I'm not so sure about it
 
@quintopia ^
 
Can you link that answer?
nevermind
I scrolled up
facepalm
 
5:48 AM
My current ideas for the 1xxx half-byte instructions (libraries): meta, math, string, arrays (including lists), graphics/images/audio, internet/network, physics?, ???.
"meta" meaning that "meta"-"math" will give access to even more math functions (another 128 more).
"meta"-"string" could be something else, though.
 
meta string could be something like python's "string", adding functions and constants to the standard "str"
 
More likely those would just be in "string".
Each of these libraries has 128 available commands.
File operations and I/O will almost certainly be exclusively in the ordinary (128) instruction set.
 
Have you thought about making the binary for commands in, say, the "arrays" block shorter after another "arrays" command?
 
I'm not sure how well that would work in practice. Do you mean something like \arrayCommands(\commC(\commA(x\commB(y|, where | signifies the end of array commands?
On further thought, if I want to leave the entire alphanumeric set for identifiers, then that restricts the number of ordinary commands to about 30 or so. Maybe more, depending on what I do with symbols like &.
 
6:07 AM
@El'endiaStarman I don't know exactly how
Just an idea
 
@El'endiaStarman time to reconsider my proposal to automatically compile identifiers to non-alphanumeric bytes :D
 
I'm not sure exactly what improvement you expect from that.
 
@El'endiaStarman Since you're using tokens anyway, why are you even worried about ASCII considerations?
 
@El'endiaStarman You're throwing away 52 of 256 characters.
 
carrot.jpg
 
6:12 AM
@ThomasKwa 52/128, actually, because of the 1xxx libraries.
 
62 even
 
Let's call it 56 out of 256
log(256)/log(256-62) is 1.053
 
But consider this: \nLargest(L3 only works because identifiers are alphabetic.
 
does it? i thought \nLargest got mapped to a single byte?
 
That means your code will be 5% longer without using the alphanumerics in the regular command space.
 
6:15 AM
Otherwise I'd have to do something like \nLargest("L"3, 5 bytes at best, or something like \nLargest(3\retrieve(L, 4 bytes at best.
 
yes, perhaps. but in bytes, \nLargest(var_L3 may not even be larger than \nLargest(L3
 
\var(L would be two bytes.
 
yes, but \var_L would be 1!
 
Not if I want arbitrary identifiers.
 
6:17 AM
Why would you want that?
 
hurray for automatic compilation of arbitrary identifiers to bytes!
 
@ThomasKwa I've said before that I want to actually use this for projects.
Try writing, say, Tetris in this language.
 
You could have both
 
carrotetris
 
Half a dozen reserved variables, and arbitrary other ones
 
6:19 AM
or not even that!
again, the magic of compilers is: you don't have to decide what the reserved bytes are called in advance. you can name them when you use them!
in fact, if you're smart, you could make a compiler automatically reuse bytes with different names when it knows the other name won't be used again for instance when it goes out of scope
 
I'll be constructing an AST, so I can definitely do that.
Okay.
How should I distinguish var_L, 3 and var_L3?
Assuming that L3 is an identifier I used.
 
I think I might win Thanksgiving with TI-BASIC. 14 bytes
 
6:36 AM
Hmm. That might be something like \holiday("Thanksgiving\getInt(\input. 2 or 2.5 bytes for \holiday, 13 bytes for "Thanksgiving, and 2 bytes for \getInt(\input. 15ish bytes altogether. Doing it the math way would likely be shorter.
Now, if I implemented \holiday( such that it can do matching on partial names, I could, perhaps, get away with \holiday("Than\getInt(\input. 7ish bytes.
 
6:48 AM
@El'endiaStarman separate them with a comma. you could even make the comma mandatory. it's only for the parser anyway.
 
hmm
In the compiled byte code, how would I separate them?
I've been planning to use the hexdump as the guide for how many bytes a program is.
 
@El'endiaStarman a hex dump would give you how many bytes it is, since that's exactly what a hex dump is
 
@phase Aye, but I mean in the sense that \map( would not count as five bytes, but one.
 
@El'endiaStarman You could just use a single byte char for that
 
Why do all commands begin with `\`? Is it TeX-based?
 
7:00 AM
I plan to have an interpreter/compiler that turns \map( into, say, 0x56.
@feersum I'm drawing inspiration from TeX, yes.
 
Is teh interpreter in it?
 
`\` is like, the universal escape character. Seems like a good choice for saying "what follows is a command".
Noooo, I wouldn't use TeX for programming. I only know LaTeX.
2 hours ago, by El'endia Starman
I certainly won't be coding in Java. Probably Python, maybe C#. I'm expecting this language to be quite complex, and I have relatively good ideas of what it would take to do certain features in Python, but C# is kinda a big unknown. On the other hand, it would be a fantastic way to learn C#, I think.
 
j.[$[$,]{n_0}%]\[$,r]\(;${n}d] negative input to positive input range, only 30 bytes. ;-;
@El'endiaStarman Why is Java worse than C#?
 
@phase I barely know any Java.
 
> it would be a fantastic way to learn C#
sounds like you don't know C# either
 
7:03 AM
Companies in my area want C# programmers and I've heard often that C# is a good language.
 
It only runs on Windows, so not every can use your inter/compiler
 
when did mego last come?
 
@TanMath Wasn't on all day today (I think)
He pushed to Seriously 14 hours ago
 
@phase I'd make an online interface for it, like I did with Minkolang.
(When I say online interpreter, I really mean online interface.)
 
@El'endiaStarman But what about things that won't work online? (Such as infinite loops)
 
7:07 AM
@phase that is sad.. I want to know something about Seriously so I can finish up two of my seriously answers!
 
@TanMath I may be able to halp
 
@phase how can you do i[1:] in seriously? i is a list...
 
@TanMath what about reversing the array and popping a value off?
 
@phase code pls? what if there is already stuff on the stack?
 
7:13 AM
Reverse, pop, reverse.
 
I can't find an operator to pop an array, but R is reverse
 
Why is there no wiki page for Seriously :c
 
so?
 
What kind of wiki page were you looking for?
 
7:18 AM
X pops, I think.
And I found this by looking through the code. I must be a madman. :P
 
no
@TanMath d pops an array, dequeues it, pushes back array and dequeued value
so
RdXR
 
@quintopia gracias!
 
OH. DUH. Seriously has arrays!
I was thinking of popping off the front of the stack...
 
@El'endiaStarman claps
 
the seriously github appears to have no licensing info
 
7:23 AM
@quintopia (c) Mego 2x15
 
in what file?
 
@quintopia no file, just default copyright on github
 
eh it doesn't matter. if it's not explicitly free-licensed, it's copyright
oh well
I was going to make a wiki page for it
I still could, but it would just be all links
(a page with the command list would be better)
@Mego!
Speak of the devil
 
Anonymous
@TanMath [1,2,3]p -> [2,3],1
 
Anonymous
Actually that looks broken right now
 
Anonymous
7:30 AM
So you'll have to do [1,2,3]RdXR
 
@Mego figured you would have a shorter way. it'd be easier to read the commands file if the different type signatures were on separate lines. or something.
 
and hex values too
 
Anonymous
That's on the list
 
Idea:pure functional language where every function has arity 2, and the source is just a compact representation of a binary tree.
 
Anonymous
Idea: stop having ideas :P
 
7:43 AM
Aaand there's mortarboard #2 on SO.
 
what is mortarboard
 
Hitting the rep cap of 200 from upvotes.
Accepts and bounties not included.
 
Anonymous
Doesn't have to be from upvotes
 
Anonymous
You just have to hit 200
 
100 edits sure is a lot... :P
But yes, not strictly upvotes.
 
Anonymous
7:47 AM
I got my first mortarboard largely due to bounties
 
Is there a negative reputation cap?
 
Not that I know of.
 
Anonymous
Idk ask Geobits
 
Any serial downvoting would be caught and corrected, though.
 
We need to find out.
 
7:48 AM
I'll start posting questions
 
What could an answer do to get 100 downvotes?
Without getting deleted.
 
Anonymous
Abuse a loophole
 
Might get lots of upvotes anway.
 
Anonymous
Specifically abuse a loophole through rules-lawyering, one that later gets closed in the standard loopholes thread
 
We could have a mod stand by and continually undelet it.
If the question says "print the square of x" and I print the text "the square of x", that could be annoying enough.
 
7:50 AM
-3
Q: My Squiggly Lamp

phaseWhile moving, I broke my lamp. Now, I need a new one. It's your job to make me a lamp! I'm not sure what size I want, though I know I want a squiggly one. Your program/function must take in a number input, and print out a lamp with that many squiggles/bumps. Examples: Input:2 Output: /--\ ...

has 8 downvotes ;-;
 
Anonymous
@feersum That's a standard loophole
 
 
@Mego It needs to be an obvious and annoying loophole to get downvotes.
Doesn't matter if it's in the meta post.
One that's not in there is probably too weird and will get upvotes.
 
Anonymous
@feersum If it is a standard loophole, it'll get deleted
 
This is why we need @AlexA. to sit at the computer and repeatedly click undelete.
 
7:56 AM
You need to add "obviously not well golfed" in there somewhere, for extra irony (loophole abuse but can't loophole abuse properly)
 
Mini-challenge: Write the simplest-sounding task that takes more than 50 chars to golf in Python.
 
Find the first place that Li(x) < pi(x) (I think that's the right direction).
Nevermind that it hasn't been found yet...[whistles]
 
Not at a computer so can't test: Sort a list of newline separated numbers via STDIN, outputting newline separated to STDOUT
 
Anonymous
@xnor Print out all the ASCII alphanumeric characters in ascending order, sorted by ASCII ordinal
 
xnor: write a program that prints "AzpGoengJuifiPelfnmAAAjfoeow[qasdghyiviuYVGIYGUVkjdheygqie;GFUIADEFeiugf;qe"
 
8:05 AM
@Sp3000 That should be doable, in 3 at least.
print(*sorted(map(int,open(0))),sep='\n')
 
@Mego import string\nstring.digits+string.ascii_letters (Where \n is a newline, of course.)
 
What's open(0)?
 
That opens stdin in Python 3.
 
Anonymous
@El'endiaStarman string.ascii_letters is lowercase first
 
@feersum open(0) o.0
oh
 
8:06 AM
@feersum it reads multiline STDIN?
 
...dang
 
Anonymous
@Sp3000 print'\n'.join(sorted(map(int,open(0))), 39 in 2
 
Darn, didn't know about that one. Was hoping for something that would require try/except or os for multiline input
 
Using a file as in iterable always splits it by lines.
@Mego open(0) doesn't work in 2.
 
@Mego Not sure you can join ints by str there
 
8:08 AM
@feersum i get OSError: [Errno 9] Bad file descriptor
is it for a specific filesystem?
@Sp3000 i was also thinking along the lines of taking multiline input
 
Anonymous
@feersum Darn
 
@xnor That's odd. fd 0 being stdin is a Linux thing, but they hacked it to work in Windows too.
 
Anonymous
@phase Your constant wish has been granted: commands.txt now has hex instead of decimals for ordinals
 
What OS?
 
windows 7
 
8:09 AM
@Mego yasssssssssss
 
Works for me.
 
@xnor I got that, try Command Prompt instead of MinGW or whatever you're using
 
i'm doing it from IDLE
 
well..... don't do it from idle....?
 
^
 
Anonymous
8:11 AM
^
 
^
 
4: well..... don't do it from idle....?
 
@phase agreed with himself so it's invalid input.
 
^
 
Anonymous
Hey @phase, I'm trying out a new feature in the IDE, can you help me test it?
 
8:13 AM
@Mego Chrome shows you what links go to when you hover over them
 
Anonymous
@phase Whatevs
 
@xnor Tell me if you get it working, I'm curious :)
 
Anonymous
Now, sleep time
 
Anonymous
Early morning cooking tomorrow for turkeyday
 
gobble gobble
 
8:15 AM
^
 
Anonymous
I'll try to make Seriously suck less after the food coma ends
 
Anonymous
But in all actuality it'll just suck more
 
Anonymous
\o/
 
Suckerously
 
Ah Thanksgiving, one of two days where... nothing much changes over here in comparison, really (along with Halloween)
Alternative for the 50 byte challenge (also not sure if it'll work): Given a float via stdin, output to STDOUT rounded to 3 sig fig
o_O okay...
 
8:21 AM
@Sp3000 print'%.2e'%input() ? Or am I missing something?
 
one second, i think i messed up
@Sp3000 never mind, it works in cmd
how does I terminate the input though?
 
ctrl-Z (in windows)
 
Should probably have specified not scientific notation
 
@feersum thanks
the open(0) thing is a useful trick i didn't know about. you should write a tip
 
^
 
8:24 AM
I'm not very proficient in Python 3. I don't feel qualified to write tips about it.
 
oh okay. well...do it anyway?
 
1 and 2 are the standard Unix file descriptors for stdout and stderr, FYI.
 
I await the day we see print(...,file=open(2))
 
for printing errors?
 
And not halting, unless there's better
 
8:30 AM
how about "Determine if one list is a contiguous sub-list of another list"?
 
should be easy?
something like
 
`a[1:-1]` in `b` ? :P
 
yeah that
 
@xnor Might be doable with string reps in Py 2, but can't try atm
 
ah right
 
8:32 AM
Depends on what's in the lists.
 
@feersum you fast
 
nvm phone lag beaten by feersum :P
 
it's weird how many more built-ins there are for strings than lists
 
You probably need to tack a few spaces so you don't get false positives though, eg [2] in [12]
 
I think it can be done for real in under 50 anyway.
f=lambda a,b:b and(b[:len(a)]==a or f(a,b[1:]))
 
8:35 AM
@xnor One thing that gets me all the time is that I forget lists don't have find :/
 
@feersum that gives the empty list on False, I was assuming actual bools, not truthy/falsey
are there enough chars to patch that?
also, the empty list is a sublist of the empty list
 
We can reshuffle it.
 
What's in the lists?
 
let's say integers
 
f=lambda a,b:b[:len(a)]==a or b>[]and f(a,b[1:]) seems to work.
 
8:40 AM
Does something like a+['']>b>=a work?
 
that's nice
I forgot that startswith replacement
 
What's larger, strings or functions in Py 2?
 
strings
 
Darn, was hoping to handle strings as well if id worked :/
How about dicts/tuples/lists?
 
[0, <built-in function id>, {}, set(), 'a']
 
8:46 AM
:/ does anything beat strings? (Apart from I think Ellipsis)
 
Where do lambda functions or generators fit in?
 
[0, <built-in function id>, {}, <function <lambda> at 0xa72da0>, <listiterator object at 0xc65000>, set([]), '']
 
You can also compare to random objects like files...
 
[None, 0, <built-in function id>, bytearray(b''), {}, <function <lambda> at 0xc64440>, <listiterator object at 0xa732c0>, set([]), '', xrange(3)]
 
Home now, apparently I was wrong about Ellipsis (and NotImplemented doesn't help either...)
I thought there was something bigger than everything though...
(just like how None is smaller than everything)
 
8:53 AM
[None, 0, NotImplemented, <built-in function id>, <built-in method viewkeys of dict object at 0xbabf40>, bytearray(b''), {}, frozenset([]), <function <lambda> at 0xbab760>, [], <listiterator object at 0xbaba60>, <memory at 0xbabc60>, set([]), '', xrange(3)]
 
float('inf')?
 
That's a number, so it's smaller than str actually
 
[None, 0, inf, NotImplemented, <built-in function id>, <built-in method viewkeys of dict object at 0xba99c0>, bytearray(b''), {}, frozenset([]), <function <lambda> at 0xc62920>, [], <listiterator object at 0xa71140>, <memory at 0xbab180>, set([]), '', xrange(3)]
 
Should probably read the code at this point :P
 
On it :P
 
8:55 AM
Could be getting an order based on random memory addresses.
lol reference counting for True and False?
 
Hmm I'm getting slightly different results from xnor for a few in the middle, so you might be right...
Oh nvm, xnor's got the viewkeys function, not an actual dict_keys([])
 
the docs say "objects are ordered consistently but arbitrarily "
 

« first day (1762 days earlier)      last day (3097 days later) »