« first day (691 days earlier)      last day (1084 days later) » 

00:02
structures are considered elements for modifier purposes
mhm
00:47
50-150 bounty if anyone wanna help with implementing elements in Jyxal
4
@Seggan how do i implement elements in Jyxal?
well I know what I'm doing tonight then
Doo you know Java, first of all?
ok then sorry, you wont be able to
wipes forehead bc less rep to give away
@BgilMidol Jyxal is written in Java with a few JVM bytecode elements sprinkled here and there
00:49
@Seggan looks at my uni assignments and the courses that have taught Java in the last year I think so.
I mean judging by the fact two of my assignments require Java, I'd say I know Java
as long as you can do an instanceof check i think ure fine
50 rep for 30 elements for me I think is a good deal
As long as theyre not half broken lol
deal
Obviously
@Seggan as someone who made the same kind of bounty in October last year, I get what you mean by the bounty
all elements go in io/github/seggan/jyxal/compiler/Elements.java
@lyxal really? cool
00:52
Nov 8, 2021 at 5:15, by lyxal
that's why if you implement a minimum of 5 elements, I'll give you 50 rep
turns out it was november
then determine if the element is a monad i.e. takes one input and gives one output
all elements are linked to their implementation by the name; if youve got an element SORT_BY_FUNCTION, the implementation will be a public static Object sortByFunction in runtime/RuntimeMethods.java
if it is a monad, the enum element will be like SORT_BY_FUNCTION("theElement", true/false)
where the true/false is whether the element vectorises or not
and the implementation method will be public static Object sortByFunction(Object obj)
if it is not a monad, you simply give the enum no args except the text, as in SORT_BY_FUNCTION("theElement")
But dyads can vectorise though
and the implementation will be public static Object sortByFunction(ProgramStack stack)
@lyxal im getting to that
for vectorisation, add this to the top of the implementation method: Object o = RuntimeHelpers.vectorise(1, RuntimeMethods::halve, stack);\nif (o != null) return o;
where the number is the arity
i know this is kind of complicated and all, but its all in the name of reducing excess push-pops
@Seggan Nice, do you get more rep per element you implement?
@user eh, ill judge myself. in general, yes
tho do remember that i only have 515 spare rep
01:05
That'll be 715 in a few days
why
i got all my bounty rep
I don't think razetime has awarded bounty yet
oh nvm
I didn't know that
can we have a digraph for various random-generating algorithms
 
8 hours later…
08:44
Accoroding to sloc Vyxal has 33k lines of code, of which 24k is block comments.
I think something may be a bit sussy here...
(This is after excluding most coden't stuff)
08:59
hmmmm maybe it’s the element.py part
I thought of that, but...
def all_less_than_increasing(lhs, rhs, ctx):
    """Element Þ<
    (any, num): All values of a up to (not including) the first greater
                than or equal to b
    """
    lhs = iterable(lhs, ctx)

    @lazylist
    def gen():
        for elem in lhs:
            if elem < rhs:
                yield elem
            else:
                return

    return gen()
That's four lines of docstring and twelve of code
My guess is it's a parsing error
 
3 hours later…
11:52
@VyxalBot How do you approve prs? I can't seem to find an "approve" button.
one second
either of those will lead to the review page
cgccuser approved on PR #774 (Vyxal/Vyxal): "Cool modifier, fancy name "
@lyxal ok
cgccuser approved on PR #770 (Vyxal/Vyxal): "I feel like these digraphs might be getting a little too specific but lgtm"
@lyxal also, for some reason, I don't see a "review now" button
@BgilMidol it's a little finicky sometimes
Lyxal opened PR #775 (Vyxal/Vyxal) (Vyxal:add-sorting-digraphs → Vyxal:main): Add Sorting Digraphs (ÞṠ, ÞṘ, ÞȮ, and ÞĊ)
and that's how you knock out 6 feature requests in less than an hour
the real question is will everything go through without merge conflicts?
I placed things in spots where there wouldn't be conflicts
so hopefully it works
Lyxal deleted branch Vyxal/find-nearest-elements
11 messages moved to ­Trash
12:22
@lyxal copilot? That was res Fast
part copilot part actual fast speed
Ifk if an extra element is needed
13:05
Hey so quick question on when y'all think the second anniversary of vyxal creation is: is it on the day of this chat room being made, the day of the first commit to the repo or on the day of the release of version 0.0.0 or v1.0.0?
Because the first commit is April 2, the chat room creation date is April 16, v0.0.0 was sometime in July and v1.0.0 was in (probably) December
(crossposted in the discord btw)
@lyxal first commit obviously
its seems logical
SE-Nitro opened issue #776 in Vyxal/Vyxal: Counter for while loop
13:46
!!/info
@AaroneousMiller I didn't understand this issue
If there already is a built-in to take the full input list, then why use a?
> Context variable, value of the current loop or function.
!!/run 1(n,)
@PyGamer0 1
yeah, but does not work for while-loops
!!/run 1{n,}
13:48
hmm
so you have to do this if you want a counter in a while-loop
14:07
Is there a list of modifers I can steal from look at?
one sec
I have .yaml open
~₌₍ƒɖß&v, ¨=(together)
ok thanks
 
1 hour later…
15:33
@mathcat works in Jyxal already 👀
nice
15:51
whatcha think about moving the lexer/parser to ANTLR?
would resolve the problem of not being able to print pipes
could use the Jyxal grammars as a start
How do while-else loops work again?
I forgor
else if if not broken
   while x:
       if cond:
           break;
   else:
       print("Break did not execute")
in vyxal
ooh i got infinite edits now 👀
@mathcat you mean while with condition?
yeah
15:58
{pop_and_execute_only_if_truthy|body}
can you give me an example? I tried it, but it somehow didn't work
20 hours ago, by Seggan
https://vyxal.pythonanywhere.com/#WyIiLCIiLCIkTMKjezpMwqU8fDpVSiIsIiIsIlsxLDJdXG5bMSwyLDMsNSw2XSJd
see that ^^
ah
thanks
 
1 hour later…
17:09
wth no
I didn't read the comments
@VyxalBot well
I'll make a poll
@AaroneousMiller wow gg, 5 bytes
@VyxalBot @Seggan no lol
I was here before lyxal
and before jon skeet
good first issue means that the issue is easy to solve
wat really
you broke my chain
I was here before
uh
17:22
I saw Vyxal before it was developed
okay
I made a poem!
wait how can I find my first message?
I think july last year I came across Vyxal
¯_(ツ)_/¯
17:52
Seggan opened issue #4 in Vyxal/Jyxal: Elements To Implement
 
1 hour later…
19:04
20 messages moved to ­Trash
chunkybanana closed issue #741 (Diagraphs for checking sortedness, Vyxal/Vyxal)
chunkybanana merged PR #775 (Vyxal/Vyxal) (Vyxal:add-sorting-digraphs → Vyxal:main): Add Sorting Digraphs (ÞṠ, ÞṘ, ÞȮ, and ÞĊ)
chunkybanana deleted branch Vyxal/add-sorting-digraphs
0 because (
!!/run 5(n,
[@emanresuA: 60610672]
1
2
3
4
5
Or not...
yeah
my idea is: M flag makes start at 0
19:14
¯\_(ツ)_/¯
19:35
@Seggan is for a user's first issue, as the description says "Good for newcomers." If it's easy to solve, there's a tag for that
@mathcat saving bytes, like using the j flag instead of
oh, ok
@AaroneousMiller hmm, didnt think of it like that. thanks for clarifying
for #777, should we have a new flag which makes it start at 1?
btw 777 yay!
I got the most codical number
19:45
just make it obey the range flags
@mathcat because M is set to 1 by default
not 0
and the majority want 0 as the default
I think to keep it consistent with other implicit generation, it should start at 1, but be affected by the M flag
+1 ^^
so 0 as default?
then M can be negated
well not negated
0 is 1 and 1 is 0
1 default
M makes 0
19:55
okay
is there any "filter by length"? or will i need 'L4=;
20:32
any idea on how i can get the first index of the top of the stack in the input? i tried the find element but it kept returning -1 even when b was in a vyxal.pythonanywhere.com/…
^^ thats the code that generates the substring to search for. here is the code that does not work: vyxal.pythonanywhere.com/…
 
3 hours later…
23:15
@Seggan I would be good with that

« first day (691 days earlier)      last day (1084 days later) »