The only issue I've ever really had with vim is that it's bad with displaying large single line files. If there is a plugin that solves that I'd install it I suppose
These settings will help you immensely:
"Make long lines wrap
set wrap
"Make wraps *not* occur in the middle of a word
set linebreak
"Make the last line look OK
set display+=lastline
"Make 'j' and 'k' go down a visual line, not an entire line
nnoremap j gj
nnoremap k gk
"Make the arrow keys ...
Crab Canon
A crab canon is a piece of music where the same tune is played backwards and forwards at the same time, and it somehow sounds nice. The most famous example is this one by Bach. In Godel, Escher, Bach, Douglas Hofstadter wrote a crab canon in dialog form, in which the characters of Ach...
Mini challenge: Find 3 4-letter words that have the format [consonant][aeiou][2*different consonant] with no shared letters across words. e.g. doff, tall, kiss
Mini challenge: Find 3 4-letter words that have the format [consonant][aeiou][2*different consonant] with no shared letters across words. e.g. doff, tall, kiss
> a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event.
Given try train train train train test testing as a context, the generated trie is [null,0,[[t,0,[[r,0,[[y,1,[]],[a,0,[[i,0,[[n,4,[]]]]]]]],[e,0,[[s,0,[[t,1,[[i,0,[[n,0,[[g,1,[]]]]]]]]]]]]]]]], almost thrice as long
@Quill i know how to do that but like how to integrate with apache virtual hosts or whatever. essentially i am hosting the various subdomains on same machine. how to route nodejs to different domain
Initials. Basically the idea is that you have a string s as the root node and you have subtrees 1 to n such that the strings in the subtree have a edit distance of n from s
PCRE flavor, 261 289 210 184 127 109 71 53 51 44 40 bytes
Yes, it is possible!
<^<()(?R){2}>\z|\1\Q^<()(?R){2}>\z|\1\Q>
Try it here. (But / is shown to be the delimiter on Regex101.)
The version works more correctly on Regex101 (44 bytes):
/^\/()(?R){2}\/\z|\1\Q^\/()(?R){2}\/\z|\1\Q/
Try ...
because clearly we are all well qualified to rank the submissions on this site by impressiveness, having read and understood approximately 1% of the ones we've read
Brainfuck, 78 bytes
Open-ended bounty: If anyone can improve this score, I will pass the bounty (+500) on to them.
--<-<<+[+[<+>--->->->-<<<]>]<<--.<++++++.<<-..<<.<+.>>.>>.<<<.+++.>>.>>-.<<<+.
Try it online!
The first 28 bytes --<-<<+[+[<+>--->->->-<<<]>] initialize the tape with the foll...
Java, 79
class H{public static void main(String[]a){System.out.print("Hello, World!");}}
Earlier versions of Java may allow you to use a static block (51 bytes), but currently I don't know of a way to bypass the main method.
Question: My language Ouroboros has a stack snippet interpreter, which I've been copying into my Ouroboros answers (per Helka Homba's statement, "The point is to make something that can be easily copied and used in future PPCG questions and answers"). It's like a TryItOnline, but embedded in the post itself. Is that appropriate? See, for example, this one.
Ouroboros, 30 bytes
;T...!59*\1=33*++o.9=\1=2*+(1"
The T should be replaced with a literal tab character.
About Ouroboros
Each line of an Ouroboros program represents a snake eating its own tail, with the beginning of the line being the head and the end being the tail. The only control flow ...
Title TBD
Given an input string, in ASCII, output "+_+" as many times as the word "mime" appears in input, and output ";_;" as many times as the word "sad" appears in input. The order is irrelevant. If and only if no occurences of these words are in input, output "._."
Program in python
a program that picks 'k' largest (L) or smallest (S) elements from an array (length n). The program should take k, L or S, and n as arguments.
These settings will help you immensely:
"Make long lines wrap
set wrap
"Make wraps *not* occur in the middle of a word
set linebreak
"Make the last line look OK
set display+=lastline
"Make 'j' and 'k' go down a visual line, not an entire line
nnoremap j gj
nnoremap k gk
"Make the arrow keys ...
PCRE flavor, 261 289 210 184 127 109 71 53 51 44 40 bytes
Yes, it is possible!
<^<()(?R){2}>\z|\1\Q^<()(?R){2}>\z|\1\Q>
Try it here. (But / is shown to be the delimiter on Regex101.)
The version works more correctly on Regex101 (44 bytes):
/^\/()(?R){2}\/\z|\1\Q^\/()(?R){2}\/\z|\1\Q/
Try ...
Brainfuck, 78 bytes
Open-ended bounty: If anyone can improve this score, I will pass the bounty (+500) on to them.
--<-<<+[+[<+>--->->->-<<<]>]<<--.<++++++.<<-..<<.<+.>>.>>.<<<.+++.>>.>>-.<<<+.
Try it online!
The first 28 bytes --<-<<+[+[<+>--->->->-<<<]>] initialize the tape with the foll...
Java, 79
class H{public static void main(String[]a){System.out.print("Hello, World!");}}
Earlier versions of Java may allow you to use a static block (51 bytes), but currently I don't know of a way to bypass the main method.
Ouroboros, 30 bytes
;T...!59*\1=33*++o.9=\1=2*+(1"
The T should be replaced with a literal tab character.
About Ouroboros
Each line of an Ouroboros program represents a snake eating its own tail, with the beginning of the line being the head and the end being the tail. The only control flow ...
Title TBD
Given an input string, in ASCII, output "+_+" as many times as the word "mime" appears in input, and output ";_;" as many times as the word "sad" appears in input. The order is irrelevant. If and only if no occurences of these words are in input, output "._."
Program in python
a program that picks 'k' largest (L) or smallest (S) elements from an array (length n). The program should take k, L or S, and n as arguments.
