So I just discovered it's shorter to embed a cross call to C than it is to bypass the type safety even within the facilities offered by Clean. Does anyone know of a linux system call with a shorter name than time, which ideally takes no arguments and gives me an integer that changes frequently?
Wait no it has to take at least one argument, otherwise it just stays unevaluated.
[liveuser@localhost dev]$ sudo fsck -n /dev/sda
fsck from util-linux 2.32
e2fsck 1.43.8 (1-Jan-2018)
Warning! /dev/sda is in use.
ext2fs_open2: Bad magic number in super-block
fsck.ext2: Superblock invalid, trying backup blocks...
fsck.ext2: Bad magic number in super-block while trying to open /dev/sda
The superblock could not be read or does not describe a valid ext2/ext3/ext4
filesystem. If the device is valid and it really contains an ext2/ext3/ext4
filesystem (and not swap or ufs or something else), then the superblock
[liveuser@localhost dev]$ sudo e2fsck -n /dev/sda2
e2fsck 1.43.8 (1-Jan-2018)
ext2fs_open2: Bad magic number in super-block
e2fsck: Superblock invalid, trying backup blocks...
e2fsck: Bad magic number in super-block while trying to open /dev/sda2
The superblock could not be read or does not describe a valid ext2/ext3/ext4
filesystem. If the device is valid and it really contains an ext2/ext3/ext4
filesystem (and not swap or ufs or something else), then the superblock
is corrupt, and you might try running e2fsck with an alternate superblock:
Bus 002 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub
Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub
Bus 001 Device 005: ID 5986:0266 Acer, Inc
Bus 001 Device 004: ID 0a5c:21e6 Broadcom Corp. BCM20702 Bluetooth 4.0 [ThinkPad]
Bus 001 Device 003: ID 147e:2020 Upek TouchChip Fingerprint Coprocessor (WBF advanced mode)
Bus 001 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub
Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub
Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub
Model: ATA INTEL SSDSCMMW24 (scsi)
Disk /dev/sda: 240GB
Sector size (logical/physical): 512B/512B
Partition Table: gpt
Disk Flags:
Number Start End Size File system Name Flags
1 1049kB 945MB 944MB ext4
2 945MB 1285MB 340MB fat16 EFI System Partition boot, esp
3 1285MB 240GB 239GB lvm
Warning: The driver descriptor says the physical block size is 2048 bytes, but Linux says it is 512 bytes.
^ parted output
I'm just going to try to re install fedora and hope the installer picks up on my home partition
Background
I like my old 8-bit 6502 chip. It's even fun to solve some of the challenges here on PPCG in 6502 machine code. But some things that should be simple (like, read in data or output to stdout) are unnecessarily cumbersome to do in machine code. So there's a rough idea in my mind: Invent...
I'm trying to complete the challenge, (mostly for the experience) but I don't know a ton about low-level operations. I'm pretty good at programming though.
So I have it partially running in Excel, but the first test example shows the second byte of RAM increasing by 10... is that because the accumulator has a 10 stored in it? I thought that I should be incrementing by 1
If anyone wants to test dummy this quiz ill be giving out.. it would be greatly apreciated. Please try to complete it in 1 minute and let me know how it goes. If you guys can't solve it in that time I'm certain the intended audience won't either.
Hi! First time posting here, but I heard that it's the place to go to advertise new languages. I've started creating a golfing language called MathGolf, which takes most of its inspiration from CJam, 05AB1E, and some of my own ideas. The main idea behind it is to include 1-byte shorthands for many commonly used values and operators, combined with lots of implicit mapping. Same goes for strings and lists.
Without any boring builtins, I've managed to write a FizzBuzz program which is 22 bytes long, beating the 05AB1E solution by quite a bit. If you want to check it out, you can find it at github.com/maxbergmark/mathgolf , I'd love some feedback and some suggestions for future additions, since there are still 77 unused command bytes, and some operators that haven't been implemented for all data types.
Yeah I want to start doing some challenges with it, I've started doing it on my own. I was a bit unsure if the language needed to have an online interpreter for the answers to be valid, is that the case?
My colleague recently sent me the following piece of JavaScript as a joke:
let butScript = (nrOfButs) => {
for(var i = 0; i < nrOfButs; i++){
if(i % 3 == 0){
console.log("Yeah")
}
if(i % 2 == 0){
console.log("But")
}
if(i % 3 ==...
Is there a guide on how to make your language usable on TIO? I've just focused on getting it working, but I want to make sure that the code page and I/O works properly.
Just a quick poll: what do you think about keeping commutativity for operators? E.g. if 5[1]* gives [5], should [1]5* give the same result, or is it better if it gives another result, e.g. [1,1,1,1,1]?
@Adám That was my thinking, but I also find myself in situations where I have to swap the two items on the stack before applying my operator. I guess you'll have troubles either way.
@maxb a sacrifice of stack-based languages is that there's a lot of stack management to be done. IMO commutative things should stay commutative, and for commonly used things that aren't commutative (e.g. concatenation, subtraction) it's worth it sacrificing having 2 built-ins for each argument order (though of course that depends on what the language is for)
@dzaima I was thinking about implementing reverse-order division/subtraction, since I've had to deal with swapping elements too many times when I've used CJam. I'll see when I get around to it, hopefully this weekend.
Given a 2D array of integers, let's sort its rows and columns in blocks. This means that you only have to sort a given row or column, but applying the transformations needed for sorting it to every other row or column in the 2D array.
Rules
Input will be a 2D array of integers and a 1-indexed ...
When I received the code snippet from my colleague, I wrote a quick CJam program and sent it back to him. That's where I got the idea for the challenge.
@maxb Speaking of the sandbox, now that you've posted to main please edit your sandbox post to be only a link and then delete it to help keep the sandbox tidy. Thanks!
Does anyone know of any links to references of a turing machine that is called "worm" or something that results in very large numbers? I remember it having a property called an "active head"
I can't find specifically what I'm looking for on google
Haha, good one. Inbox is about the whole UI concept of Inbox. Bundling, pinning, no unread count to stress you. Gmail is never going to get these features, because it works differently at a basic level.
I think their motivation is pretty simple: Inbox = no ads, Gmail = ads.
@AshwinGupta I want to add though, that passing the arguments in the reverse order with the same names that they have in main is a bit confusing, and may lead to silly mistakes that aren't a result of being incompetent, but just visually missing the name swap. Something that wouldn't happen in reality because nobody should call their variables that.
Maybe use onetwothree? And keep the swap? That'll make them pay attention but still be clear.
@Οurous you're totally right, but it was done intentionally. The context is I am interviewing students for a very competetive STEM club at my high school and those who claimed to know C on their application are being tested. As long as the applicants get a 2/3 we are fine. If they switch o1 and o2 values, we will only take off 1 point (not two even though both are technically wrong).
Essentially 2/3 is good enough, but we just want to see who is really paying attention and gets a 3/3 also.
My colleague recently sent me the following piece of JavaScript as a joke:
let butScript = (nrOfButs) => {
for(var i = 0; i < nrOfButs; i++){
if(i % 3 == 0){
console.log("Yeah")
}
if(i % 2 == 0){
console.log("But")
}
if(i % 3 ==...
Given a 2D array of integers, let's sort its rows and columns in blocks. This means that you only have to sort a given row or column, but applying the transformations needed for sorting it to every other row or column in the 2D array.
Rules
Input will be a 2D array of integers and a 1-indexed ...
