jellylanguage VS swift-algorithms

At least on the Code Golf Stack Exchange, I see a lot of people using esolangs for golfing (two random examples: Jelly [1] and O5AB1E [2]). I expect that it could be a line or two shorter at least with a change of language. As I recall some of the golfing langs also have pretty sophisticated compression techniques for strings, although they might be optimized for dictionary words. Careful distinction: they are all optimizing for bytes used, not characters used.

I don't want to neglect your shameless plug, but I struggle enough to find a solution to some of the puzzles I wrote (hence the undo), so finding the shortest path is a little daunting.

[1] https://github.com/DennisMitchell/jellylanguage

[2] https://github.com/Adriandmen/05AB1E

ADDITIONAL COMMENTS: I am also solving most of these problems in Jelly, a recreational language designed for code-golf. They are in the same repository under the jelly folder.

Jelly (put the input in the first command line argument):

Yes it is totally possible, Batch script is Turing complete afterall. Since you found Python tutorials, you can just apply the same concepts in Batch. The difficulty depends on the complexity of the language you're trying to make. I would recommend trying to make a stack-based language first, with the syntax similar to golfing languages (ie, one character is one "command", check out https://github.com/DennisMitchell/jellylanguage), since that would be the easiest. But obviously if you're up to it you could make a fully fledged programming language.

This is a basic version of many commonly used ideas for string compression in golfing languages. Jelly [0] is a good example of a more practical and versatile approach that builds on ideas such as this.

[0] https://github.com/DennisMitchell/jellylanguage/wiki/Tutoria...

(As an aside, some people "stop" here and then make programming languages based on this - because that is a simple interpreter... you could write a compiler for this language, or extend it - and the great golfing languages take that starting spot and keep going - don't worry about trying to replicate it, it takes some insanity to go that far - the point is that a stack based language is the starting spot for some impressive systems... like the JVM itself)

If you like code to be as short and unreadable as possible, try out Jelly.

Arguably, however, if you think about "High Level" in terms of "how many keystrokes do you need to do X complex task" (kinda like some mean komolgorov complexity measure over a set of tasks) then code golf languages could probably be the most "high level". Take Jelly for instance. Incomprehensible garbage when written, but goddamn if it isn't character efficient.

I am waiting for a time when we get Angular or React in Jelly [1]

[1] https://github.com/DennisMitchell/jellylanguage/wiki/Tutoria...

Being honest with naming things is also a great roundabout way to ensure you write maintainable, readable code. If the name is honest and it feels awkward, it's a good red flag that there might be a problem with the approach you're taking. I think code golf languages (a-la [0]) are a good example of this approach as well, when your language is as terse as possible, giving very deep consideration to what the language actually does is crucial.

[0] https://github.com/DennisMitchell/jellylanguage/wiki/Atoms

While you are correct about the stdlib, check out swift-algorithms (https://github.com/apple/swift-algorithms). It's written by Apple and has several interesting methods.

We used Swift Algorithms once or twice. It just depends on the app. I suggest starting with the WWDC video.

Install swift-algorithms and use min/max(count:by:)

#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine() } } func markerEnd(for signal: String, markerLength: Int) -> Int { return Array(signal.windows(ofCount: markerLength)) .firstIndex { Set($0).count == markerLength }! + markerLength } let signals = StandardInput().compactMap { $0 } let part1 = signals.map { markerEnd(for: $0, markerLength: 4)}.reduce(0, +) let part2 = signals.map { markerEnd(for: $0, markerLength: 14)}.reduce(0, +) print("part 1 : \(part1)") print("part 2 : \(part2)")

#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms typealias Label = Character typealias Instruction = (amount: Int, source: Int, destination: Int) struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine(strippingNewline: false) } } let sections = StandardInput() .compactMap { $0 } .split(separator: "\n") .map { Array($0) } let stacks = parseStacks(from: sections[0]) let instructions = parseInstructions(from: sections[1]) print(apply(instructions, to: stacks, oneAtATime: true)) print(apply(instructions, to: stacks, oneAtATime: false)) // MARK: - Private private func parseStacks(from section: [String]) -> [[Label]] { let crates = section.map { let start = $0.index($0.startIndex, offsetBy: 1) return Array($0.suffix(from: start).striding(by: 4)) } let stackCount = crates[0].count var stacks: [[Label]] = Array(repeating: [Label](), count: stackCount) crates.reversed().forEach { for (index, label) in $0.enumerated() { stacks[index].append(label) } } return stacks.map { $0.filter { $0.isLetter } } } private func parseInstructions(from section: [String]) -> [Instruction] { return section.map { let tokens = $0.dropLast().split(separator: " ") return (Int(tokens[1])!, Int(tokens[3])! - 1, Int(tokens[5])! - 1) } } private func apply( _ instructions: [Instruction], to stacks: [[Label]], oneAtATime: Bool ) -> String { var stacks = stacks instructions.forEach { let cargo = Array(stacks[$0.source].suffix($0.amount)) stacks[$0.source] = stacks[$0.source].dropLast($0.amount) stacks[$0.destination].append( contentsOf: oneAtATime ? cargo.reversed() : cargo ) } return String(stacks.map { $0.last! }) }

Swift. Algorithms contains chunks(ofCount: 3) but I had to write chunks(totalCount:) myself.

Algorithms has `max(count:)` now. 💻🖥️

Create windows of 4 elements.

There is also a swift algorithm package that’s a precursor to the standard library if you want to examine legit implementation built into Swift.

I used Algorithms and took inspiration from Kotlin with it's zipWithNext function.