« first day (36 days earlier)      last day (685 days later) » 

4:33 AM
idea: ill ask my brother to select the glyphs for me
wow Adám's keyboard layout has so many glyphs
 
5:07 AM
ok pyhof v0.1.2 has been released
let me release pyhof v0.1.3
^ done
ok i fixed the 10I problem
 
5:30 AM
and i made the debug mode better
 
nice
 
ill make a better version of join
[1, 2, 3], 1 → [1, 1, 2, 1, 3, 1]
[1, 2, 3], [2, 2] → [1, 2, 2, 2, 3, 2]
[1, 2, 3, 4, 5, 6], [3, 4] → [1, 3, 2, 4, 3, 3, 4, 4, 5, 3, 6, 4]
@Razetime @lyxal ^?
 
that's a merge sort innit
oh
you're doing an interleaving thing
 
yeah
[1, 2], [3, 4] → [1, 3, 2, 4]
 
5:46 AM
so that is just flatten(zip(a,b)) right
 
really?
no
i need some sort of repeated zip
that repeats the second argument when it runs out
 
ah yes
an imperative algo looks simpler then
 
or maybe more_itertools has a that zip
or maybe i just cycle the second argument
def join(x, y):
    x = iterable(x)
    y = it.cycle(iterable(y))
    return flatten(zip(x, y))
 
does zip of a cycle return a finite result
 
hmmmmmmMMMMM
no
it looks like it doesnt
i hate it
zip_longest goes into an infinite loop
 
5:55 AM
zip_shortest i guess?
 
thats zip right
anyways im taking a break rn
 
6:08 AM
i found mit.collaspe
 
huh
 
its flatten but it can collaspe tuples
i think if i use it instead of flatten it should work
 
 
2 hours later…
8:07 AM
@Razetime this works:
def join(x, y):
    x = iterable(x)
    y = it.cycle(iterable(y))
    return flatten(zip(x, y))
where flatten is:
flatten = compose(list, mit.collapse)
CMP: Separate experimental branch of flax in C++ (or maybe even Haskell)
 
8:25 AM
@PyGamer0 sure, go ahead but this will take double the time
 
8:43 AM
@Razetime i am not gonna do it now, ill do it when i have a robust python version
 
or you can start from scratch now and maintain the C++ version as the main one
 
why would i do that
 
because C++ is much faster
 
true but harder also
i am not very familiar with it
 
good time to learn
 
8:46 AM
@Razetime i am in the process of learning it
 
i don't think C++ will be terribly hard but the errors definitely worse
 
i found 2 symbolic c++ libraries
@Razetime there is a symengine wrapper for python
maybe i should use it
 
9:14 AM
@PyGamer0 no clue
don't hastily jump languages
 
10:02 AM
PyGamer0 has made a change to the feeds posted into this room
 
uh i am testing ^
now ill wait
 
10:24 AM
posted on January 01, 0001 by PyGamer0

should i call this readable code golfing

posted on January 01, 0001 by PyGamer0

a

posted on January 01, 0001 by PyGamer0

flax_print

posted on January 01, 0001 by PyGamer0

Update README.md

posted on January 01, 0001 by PyGamer0

Update README.md revert

 
i guess ill remove it lol
 
PyGamer0 has stopped a feed from being posted into this room
 
 
3 hours later…
1:43 PM
^ a diagraph for that would,be good
29
A: Get all the diagonals in a matrix/list of lists in Python

flakesI came across another interesting solution to this issue. The row, column, forward, and backward diagonal can all be immediately discovered by looking at a combination of x and y. Column = x Row = y F-Diag = x+y B-Diag = x-y B-Diag` = x-y-MIN | 0 1 2 | 0 1 2 | 0...

 
2:28 PM
and note to future self, use ÇŒṘ in the footer (jelly) for python output
 

« first day (36 days earlier)      last day (685 days later) »