The Nineteenth Byte

« first day (5083 days earlier) ← previous day next day → last day (56 days later) »

Seggan

01:42

Why is webpack

Ginger

because internet

Seggan

But webpack pain

lyxal

02:18

@Seggan I find myself asking similar questions about the js ecosystem

Like why must jest be not friendly with es6 but be happy with common js

Why express.js not be friendly with es6 but be happy with common js

Why Vue not be friendly with vyxal 3?

All these and more

Leads me to the conclusion that js is hostile to those who aren't common js

And to anyone with any shred of sanity

4 hours later…

rydwolf

05:57

@Seggan Webpack was so much nicer than Vite

I switched to Vite because people yelled at me for using webpack but I miss webpack

mousetail 'he-him'

06:25

@lyxal Half libraries work only with common JS, but the other half work only with ESM. You are screwed either way

@rydwolf What do you miss about webpack?

lyxal

06:38

@mousetail'he-him' amazing

1 hour later…

l4m2

08:03

CMC Given n, get (∑(n mod i))mod n

lyxal

08:18

@l4m2 Vyxal 3 -l, 5 (literate) bytes: one->n mod sum swap mod Vyxal It Online!

New Posts

Q: Determine the biggest rectangle containing only one "X"

Your input is a rectangular 2D char array, such as so: .X.......X .......... .....X.... ..X....... ........X. .X........ ..X.....X. X......... ....X..... Your goal is to find the biggest rectangle within this input data which contains only one "X". In this case it's 40. Other testcases: 1 X 0, ...

3 hours later…

mousetail 'he-him'

11:26

@NewPosts This challenge is basically the challenge TactitQuery was made for

But it will be a bit before it's implemented

lyxal

It's also really good with the new multi-dimensional overlaps built-in in vyxal 3.5, giving 19 bytes theoretically

/newline parallel: length vlength max cartesian-product filter<
  input n overlaps flatten 'X count 1 ==
} v: product max

roughly

mousetail 'he-him'

Uiua's requirement that all arrays be rectangular is really annoying for this

l4m2

11:43

@NewPosts What complexity can it be?

2 hours later…

mousetail 'he-him'

13:34

@l4m2 In 1d, it could be O(n), so for 2d at most O(n^3). I don't know if it can be more efficient.

Hello, World!

14:07

A: "Hello, World!"

Hum, 4 Instructions 'Hello, world!'@# ATO

4 hours later…

Simd

18:05

What new year plans does the nineteenth hole crew have?

Sorry, 19th byte!

Dannyu NDos

18:38

Last night, I dreamt of they adding Logic SE.

Simd

18:49

This is a good dream

Unless they then proved something that ended the world

Seggan

19:07

thisisnothappeningthisisnothappeningthisisnothappening

New Posts

20:02

Q: Distinct characters and distinct sizes

In this challenge you will write a program or function which takes a string and calculates its score. The score is the number of distinct characters, plus each integer \$n\$ such that there is a character appearing exactly \$n\$ times. For example the string abcaaccac should score 8, since there ...