HNHacker News
TopNewBestAskShowJobs

qazxcvbnm

280 karma · joined October 3, 2022

submissionscomments
qazxcvbnm··on The State of Vim
Some other things I do:

Invoke terminals on directories (instead of netrw). So, I can e.g. sp. to split to a new terminal.

  function! Isdir(dir) abort
   return !empty(a:dir) && (isdirectory(a:dir) ||
    \ (!empty($SYSTEMDRIVE) && isdirectory('/'..tolower($SYSTEMDRIVE[0])..a:dir)))
   endfunction
  
  augroup terminal-explorer
   au!
   au VimEnter * sil! au! FileExplorer *
   au VimEnter * sil! au! Network *
   au VimEnter * sil! au! AuNetrwEvent *
   " au FileType netrw cd % | bw | exe 'terminal ++curwin'
   au BufEnter * if &filetype != 'netrw' && Isdir(expand('%')) | lcd % | exe bufnr("%") ..'bufdo terminal ++curwin' | endif
   augroup end
Make <C-@>m close windows instead:

    noremap <C-@>m <C-w>c
    noremap! <C-@>m <Esc><C-w>c
    tnoremap <C-@>m <C-@>c
Make <C-@>p find the next window if there is no previous window:

    noremap <expr> <silent> <C-@>p ':<C-u>wincmd p <Bar> if win_getid () == ' .. win_getid () .. ' <Bar> wincmd w <Bar> endif <CR>'
    noremap! <expr> <silent> <C-@>p '<Esc>:<C-u>wincmd p <Bar> if win_getid () == ' .. win_getid () .. ' <Bar> wincmd w <Bar> endif <CR>'
    tnoremap <expr> <silent> <C-@>p '<C-@>:<C-u>wincmd p <Bar> if win_getid () == ' .. win_getid () .. ' <Bar> wincmd w <Bar> endif <CR>'
Use <C-@>~. to detach the GNU screen that my vim is running in (I put my vim in a screen with `unbindall` i.e. I use screen merely for keeping my vim alive) (<C-@>~. is in analogy to the SSH quit keybinding <CR>~.).

    noremap <expr> <silent> <C-@>~. ':<C-u>silent !screen -X detach<CR>'
    noremap! <expr> <silent> <C-@>~. '<C-@>:<C-u>silent !screen -X detach<CR>'
    tnoremap <expr> <silent> <C-@>~. '<C-@>:<C-u>silent !screen -X detach<CR>'
With gf and gF, opening files just from a terminal grep is practically more convenient than vim's :grep. For gf in a new tab:

    map <silent> <C-@><C-f> :<C-u>tab split<CR>gf
With terminal multiplexing in vim, you start getting a lot of buffers. You can consider getting a custom tabline. Other tab management features become more important too. You might expect [count]gt to behave just like gt for [count] times:

    nnoremap <expr> gt '@_' .. ((v:count1 + (tabpagenr () - 1)) % (tabpagenr('$') ) + 1) .. 'gt'
For ease of moving to the last tab:

    nnoremap <expr> g<C-t> '@_' .. (((v:count == 0) ? tabpagenr ('$') : v:count)) .. 'gt'
To consistently access the gt family of bindings regardless of mode:

    map <C-@>gt gt
    map <C-@>gT gT
    map <C-@>g<C-t> g<C-t>
    map! <C-@>gt <Esc>gt
    map! <C-@>gT <Esc>gT
    map! <C-@>g<C-t> <Esc>g<C-t>
    tmap <C-@>gt <C-@>Ngt
    tmap <C-@>gT <C-@>NgT
    tmap <C-@>g<C-t> <C-@>Ng<C-t>
When you use <C-w>T a lot to move your windows in to new tabs, you might sometimes want to move them to the previous tab instead of the next one:

    nnoremap <silent> <C-@><C-t> <C-w>T
    nnoremap <silent> <C-@>T <C-w>T:<C-u>tabm -1<CR>
To access these two in any mode consistently:

    map! <C-@><C-t> <Esc><C-@><C-t>
    map! <C-@>T <Esc><C-@>T
    tmap <C-@><C-t> <C-@>N<C-@><C-t>
    tmap <C-@>T <C-@>N<C-@>T
Analogously to gt and gT, sometimes you may want to move your tabs around, or split them:

    function! SSStabmadjust(tabmnum)
     if a:tabmnum < tabpagenr ()
      return a:tabmnum - 1
     else
      return a:tabmnum
      endif
     endfunction

    noremap <silent> <C-@><C-g>s :<C-u>tab split<CR>
    noremap <expr> <silent> <C-@><C-g>t '@_:<C-u>' .. SSStabmadjust ((v:count1 + (tabpagenr () - 1 )) % (tabpagenr('$') ) + 1) .. 'tabm<CR>'
    noremap <expr> <silent> <C-@><C-g>T '@_:<C-u>' .. SSStabmadjust (((- v:count1 + (tabpagenr () - 1 )) % (tabpagenr('$') ) + tabpagenr('$') ) % (tabpagenr('$') ) + 1) .. 'tabm<CR>'
    noremap <expr> <silent> <C-@><C-g><C-t> ':<C-u>' .. ((v:count == 0) ? "" : SSStabmadjust ((v:count % (tabpagenr ('$') )) )) .. 'tabm<CR>'
    map! <C-@><C-g>s <Esc><C-@><C-g>s
    map! <C-@><C-g>t <Esc><C-@><C-g>t
    map! <C-@><C-g>T <Esc><C-@><C-g>T
    map! <C-@><C-g><C-t> <Esc><C-@><C-g><C-t>
    tmap <C-@><C-g>s <C-@>N<C-@><C-g>s
    tmap <C-@><C-g>t <C-@>N<C-@><C-g>t
    tmap <C-@><C-g>T <C-@>N<C-@><C-g>T
    tmap <C-@><C-g><C-t> <C-@>N<C-@><C-g><C-t>
qazxcvbnm··on The State of Vim
vimrc for 4)

    vnoremap <C-@>s <C-w>sgv
    vnoremap <C-@>v <C-w>vgv

    nnoremap <expr> <C-@>w '@_' .. ((v:count1 + (winnr() - 1)) % (winnr('$')) + 1) .. '<C-w>w'
    nnoremap <expr> <C-@>W '@_' .. (((- v:count1 + (winnr() - 1)) % (winnr('$')) + winnr('$')) % (winnr('$')) + 1) .. '<C-w>w'
    nnoremap <expr> <C-@>t '@_' .. ((v:count1 - 1) % (winnr('$')) + 1) .. '<C-w>w'
    nnoremap <expr> <C-@>b '@_' .. (((- v:count1) % (winnr('$')) + winnr('$')) % (winnr('$')) + 1) .. '<C-w>w'
    inoremap <C-@><C-@> <C-@>
    map! <C-@>w <Esc><C-@>w
    map! <C-@>W <Esc><C-@>W
    map! <C-@>t <Esc><C-@>t
    map! <C-@>b <Esc><C-@>b
    tmap <C-@>w <C-@>N<C-@>w
    tmap <C-@>W <C-@>N<C-@>W
    tmap <C-@>t <C-@>N<C-@>t
    tmap <C-@>b <C-@>N<C-@>b
qazxcvbnm··on The State of Vim
(equivalently, if you use screen; the key point is the \eP and the \e\\ between which the real xterm escape codes go, or else screen will eat your escape codes which will never see the light of day)

    augroup term_normal
     au!      
     autocmd WinNew * let w:winnew = 1
     autocmd CmdlineEnter * let w:outcmd = 0
     autocmd CmdlineLeave * let w:outcmd = 1
     autocmd WinEnter * if exists ('w:winnew') | unlet w:winnew | if (mode() == 't') | call Termcursor () | endif | elseif get(w:, 'outcmd', 1) && (mode() == 't') | call feedkeys("\<C-@>N", "") | endif
     autocmd WinLeave * if (mode() == 't') && (! exists('w:tu')) | call feedkeys("\<C-@>N", 'x') | call Normalcursor () | elseif (mode(1) == 'nt') && (exists('w:tu')) | call feedkeys("i", 'ix') | endif
    
     tmap <expr> <C-@><C-@> ((mode() == 't') && get(w:, 'outcmd', 1)) ? '<C-@>N' : '<C-@><C-@>'
     augroup end
    
    let &t_SI = "\eP\e[6 q\e]12;#FF00DF\<C-g>\e\\"
    let &t_EI = "\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
    let &t_ti = "\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
    let &t_te = "\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
    let &t_Us = "\eP\e[4:2m\e\\"
    let &t_ds = "\eP\e[4:4m\e\\"
    let &t_Ds = "\eP\e[58:5:3m\e[4:5m\e\\"
    
    function! Normalcursor ()
     let &t_ve ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" 
     let &t_vi ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
     endfunction
    function! Echonormalcursor ()
     call echoraw("\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\")
     endfunction
    function! Termcursor ()
     let &t_ve ="\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
     let &t_vi ="\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
     endfunction
    function! Echotermcursor ()
     call echoraw("\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\")
     endfunction
    
    augroup termcursor
     au!
     autocmd ModeChanged *:n* let &t_ve ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd ModeChanged *:n* let &t_vi ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd ModeChanged i:* if &t_ve == "" | let &t_ve ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" | endif
     autocmd ModeChanged i:* if &t_vi == "" | let &t_vi ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" | endif
     autocmd ModeChanged *:i* let &t_ve =""
     autocmd ModeChanged *:i* let &t_vi =""
     autocmd ModeChanged *:t call echoraw("\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\")
     autocmd ModeChanged *:t let &t_ve ="\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd ModeChanged *:t let &t_vi ="\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd ModeChanged t:* call echoraw("\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\")
     autocmd ModeChanged t:* if (mode(1) != 'ct') | let &t_ve ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" | endif
     autocmd ModeChanged t:* if (mode(1) != 'ct') | let &t_vi ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" | endif
     
     " TODO -- doesnt restore from redraw?
     let g:cmdlinedepth = 0
     autocmd CmdlineEnter * let g:cmdlinedepth = g:cmdlinedepth + 1 | let &t_ve = "\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\" | let &t_vi = "\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd CmdlineLeave * let g:cmdlinedepth = g:cmdlinedepth - 1 | if g:cmdlinedepth == 0 | if (mode(1) == 'ct') | call Termcursor () | else | call Normalcursor () | endif | endif
     autocmd CmdwinEnter * let &t_ve ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\" | let &t_vi ="\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\"
     autocmd CmdwinLeave * let &t_ve = "\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\" | let &t_vi = "\eP\e[4 q\e]12;#FF00DF\<C-g>\e\\"
    
     " autocmd WinEnter * call echoraw("\eP\e[2 q\e]12;#FF00DF\<C-g>\e\\")
     augroup end
qazxcvbnm··on The State of Vim
For me, some of the things that's really important for a terminal multiplexer include:

1) Keybindings having no conflicts with other terminal applications. For that, vim's default window-management key of <C-w> is unfortunate, as it is very important for delete words in bash and readline. I remap that to <C-@> (CTRL-Space) instead, which is basically used by no terminal program that I am aware of. The other key binding that trips me up are the default vim keybindings to kill the terminal (<C-w><C-c>). If I am midway attempting a window action, but realise something is taking too long and want to stop the job, the keybinding kills my whole shell. If I really want to kill my terminal, I can always issue ZQ or :q! in normal mode.

2) Change my cursor shapes based on which mode I'm in (normal, insert, or terminal/command), which helps me easily tell the mode.

3) Improve the default keybinding for going from terminal back to terminal normal mode. I find the default keybindings <C-\><C-n> and <C-w>N too difficult to type because I need to use this binding very much.

4) Be able to move between windows with the same, consistent set of keybindings no matter which mode I'm in (e.g. not having to go back to normal mode first, from insert or terminal mode). In the same vein, when I land on a buffer I always expect to be in normal mode, so I can start moving around immediately and yank stuff without remembering whether I'm in a terminal or a non-terminal buffer. When I need to manipulate the terminal program I can always `i` or `a`.

I have quite a few other customisations to my vim terminal, but I think these are the most essential ones.

vimrc for 1)

    set termwinkey=<C-@>
    noremap <C-@> <C-w>
    noremap <C-@><CR> <C-w><CR>
    noremap! <C-@> <Esc><C-w>

    noremap <C-@>c <Nop>
    noremap <C-@><C-c> <Nop>
    noremap <C-@><C-q> <Nop>
    noremap! <C-@>c <Nop>
    noremap! <C-@><C-c> <Nop>
    noremap! <C-@><C-q> <Nop>
    tnoremap <C-@>c <Nop>
    tnoremap <C-@><C-c> <Nop>
    tnoremap <C-@><C-q> <Nop>
    noremap <C-@>q <Nop>
    noremap! <C-@>q <Nop>
    tnoremap <C-@>q <Nop>
vimrc for 2) and 3)

    augroup term_normal
     au!      
     autocmd WinNew * let w:winnew = 1
     autocmd CmdlineEnter * let w:outcmd = 0
     autocmd CmdlineLeave * let w:outcmd = 1
     autocmd WinEnter * if exists ('w:winnew') | unlet w:winnew | if (mode() == 't') | call Termcursor () | endif | elseif get(w:, 'outcmd', 1) && (mode() == 't') | call feedkeys("\<C-@>N", "") | endif
     autocmd WinLeave * if (mode() == 't') && (! exists('w:tu')) | call feedkeys("\<C-@>N", 'x') | call Normalcursor () | elseif (mode(1) == 'nt') && (exists('w:tu')) | call feedkeys("i", 'ix') | endif

     tmap <expr> <C-@><C-@> ((mode() == 't') && get(w:, 'outcmd', 1)) ? '<C-@>N' : '<C-@><C-@>'
     augroup end
    
    let &t_SI = "\e[6 q\e]12;#FF00DF\<C-g>"
    let &t_EI = "\e[2 q\e]12;#FF00DF\<C-g>"
    let &t_ti = "\e[4 q\e]12;#FF00DF\<C-g>"
    let &t_te = "\e[2 q\e]12;#FF00DF\<C-g>"
    let &t_Us = "\e[4:2m"
    let &t_ds = "\e[4:4m"
    let &t_Ds = "\e[58:5:4m\e[4:5m"
    
    function! Normalcursor ()
     let &t_ve ="\e[2 q\e]12;#FF00DF\<C-g>" 
     let &t_vi ="\e[2 q\e]12;#FF00DF\<C-g>"
     endfunction
    function! Echonormalcursor ()
     call echoraw("\e[2 q\e]12;#FF00DF\<C-g>")
     endfunction
    function! Termcursor ()
     let &t_ve ="\e[4 q\e]12;#FF00DF\<C-g>"
     let &t_vi ="\e[4 q\e]12;#FF00DF\<C-g>"
     endfunction
    function! Echotermcursor ()
     call echoraw("\e[4 q\e]12;#FF00DF\<C-g>")
     endfunction
    
    augroup termcursor
     au!
     autocmd ModeChanged *:n* let &t_ve ="\e[2 q\e]12;#FF00DF\<C-g>"
     autocmd ModeChanged *:n* let &t_vi ="\e[2 q\e]12;#FF00DF\<C-g>"
     autocmd ModeChanged i:* if &t_ve == "" | let &t_ve ="\e[2 q\e]12;#FF00DF\<C-g>" | endif
     autocmd ModeChanged i:* if &t_vi == "" | let &t_vi ="\e[2 q\e]12;#FF00DF\<C-g>" | endif
     autocmd ModeChanged *:i* let &t_ve =""
     autocmd ModeChanged *:i* let &t_vi =""
     autocmd ModeChanged *:t call echoraw("\e[4 q\e]12;#FF00DF\<C-g>")
     autocmd ModeChanged *:t let &t_ve ="\e[4 q\e]12;#FF00DF\<C-g>"
     autocmd ModeChanged *:t let &t_vi ="\e[4 q\e]12;#FF00DF\<C-g>"
     autocmd ModeChanged t:* call echoraw("\e[2 q\e]12;#FF00DF\<C-g>")
     autocmd ModeChanged t:* if (mode(1) != 'ct') | let &t_ve ="\e[2 q\e]12;#FF00DF\<C-g>" | endif
     autocmd ModeChanged t:* if (mode(1) != 'ct') | let &t_vi ="\e[2 q\e]12;#FF00DF\<C-g>" | endif
    
     let g:cmdlinedepth = 0
     autocmd CmdlineEnter * let g:cmdlinedepth = g:cmdlinedepth + 1 | let &t_ve = "\e[4 q\e]12;#FF00DF\<C-g>" | let &t_vi = "\e[4 q\e]12;#FF00DF\<C-g>"
     autocmd CmdlineLeave * let g:cmdlinedepth = g:cmdlinedepth - 1 | if g:cmdlinedepth == 0 | if (mode(1) == 'ct') | call Termcursor () | else | call Normalcursor () | endif | endif
     autocmd CmdwinEnter * let &t_ve ="\e[2 q\e]12;#FF00DF\<C-g>" | let &t_vi ="\e[2 q\e]12;#FF00DF\<C-g>"
     autocmd CmdwinLeave * let &t_ve = "\e[4 q\e]12;#FF00DF\<C-g>" | let &t_vi = "\e[4 q\e]12;#FF00DF\<C-g>"
     
     " autocmd WinEnter * call echoraw("\e[2 q\e]12;#FF00DF\<C-g>")
qazxcvbnm··on Dualities in functional programming
A formal account regarding what the author puts as effects and pre conditions https://arxiv.org/abs/1001.1662
qazxcvbnm··on The State of Vim
Just for the other side of the picture, I live in vim and use it as my terminal multiplexer. Vim’s my shell. I have thousands of buffers in vim and practically never leave it. I’ve used terminal multiplexers for years before I switched to vim in that capacity and never looked back. The integration it’s allowed between all my buffers and commands and shells is difficult to match in my opinion.
qazxcvbnm··on Five years of React Native at Shopify
By the way, is it Shopify’s open source policy to ignore outside PRs, or are they simply understaffed? My PR which addresses a major issue in one of Shopify’s big React Native libraries has received zero acknowledgement from Shopify for almost a year.
qazxcvbnm··on The Shepherd 1.0.0 released
I don’t know how Guile does this, but note that finding a fixed point does not generally require a lazy language; you just can’t do it naively — you can still take a bunch of functions that act on a config and ‘while (changing) keep applying’ — equivalently, the Y combinator can’t be evaluated strictly to get your fixed points, but the Z combinator can.
qazxcvbnm··on Transcendental Syntax
It may not help with clarity, but I do love dearly how, so refreshingly, he allows me to feel how he himself feels of the world and its significance with his work, and in that I do feel I understand his point of view better.
qazxcvbnm··on Transcendental Syntax
Thank you for pointing out these distinctions which I had not grasped, and the relevant literature! Time for me to dig back into Girardesque pages.

Is "Logique 2.0" this paper https://girard.perso.math.cnrs.fr/logique2.0.pdf? Is there an English translation available?

qazxcvbnm··on Transcendental Syntax
On the topic of Girard, I've been very attracted to his ideas about the "dynamics" of logic and "communication without understanding". It always appears to me that such ideas and things like the "execution formula" should have profound implications on static analysis of algorithms and things like abstract interpretation and collapsing stacks of interpreters.

Has there been any literature on concrete steps in this direction, or is there anything holding back Girard's theories from practical application (I know that Girard's Geometry of Interaction was supposed to have problems with additives, of which exact implications I do not quite comprehend, which may or may not be relevant)?

qazxcvbnm··on Developing inside a virtual machine
I do something similar, and one more tip is to remember to provide your pbcopy and pbpaste with `LANG=en_US.UTF-8`, or else non-ASCII will be garbled.
qazxcvbnm··on An 83-year-old short story by Borges portends a bleak future for the internet
“The truth is that it longed to yield. Ten years ago any symmetry with a semblance of order — dialectical materialism, anti-Semitism, Nazism — was sufficient to entrance the minds of men. How could one do other than submit to Tlön, to the minute and vast evidence of an orderly planet?”

To me, this suggests rather clearly something similar to the OP’s interpretation. His drawing on of this story as allegory for our future occurs to me also as apt, and what I imagine as what Borges would have envisioned.

I also don’t quite follow your assertion that “social perception obviously wholly creates the real and only reality”, as social perception clearly varies by each persons’ distinct society - and anyhow even if considered on the level of the entire society, such a vast, sprawling perception could hardly be considered a singular “only” reality.

qazxcvbnm··on The Art of Manually Editing Hunks
Sounds like a problem for rediff (https://github.com/twaugh/patchutils).

Instead of directly editing the unified diff file, make a copy and edit the copy. Once you’re done, call rediff original-patch edited-patch to get a patchfile with fixed offsets.

Note that rediff only fixes your offsets, and doesn’t remove empty hunks. patch is not happy about empty hunks existing, so if you happen to revert all changes in a hunk, remember to delete the hunk after rediff. Probably this ought to be contributed back upstream.

qazxcvbnm··on Delta: A syntax-highlighting pager for Git, diff, grep, and blame output
Ranger seems quite slow for the directories I tried to use it on. Use lf, may give broot a try.
qazxcvbnm··on Evaluate Markdown code blocks within Vim
Another way:

    yy@"
In other words, execute the " register (what you just copied) as a macro. In the same vein, yy@0 would work as well (the 0 register is the last yank).

Also, what do you mean without a native map structure? Vimscript has Dictionaries just fine.

qazxcvbnm··on Streaming joins are hard
Yes, I might have misworded my question. My question is in relation to this paragraph on page 12:

"Note that the SQL ORDER BY directive can be modelled as a non-linear aggregate function that emits a list. However, such an implementation is not efficiently incrementalizable in DBSP. We leave the efficient handling of ORDER BY to future work."

My understanding is that Feldera does indeed support ORDER BY, which I imagine it does incrementally, thus my question.

The statement in the paper that ordering is not efficiently incrementalisable seems to makes sense to me. It is clear that even though Z-sets are not naively able to represent diffs of ordered relations (since Z-sets are unordered), ordering can be modelled as an aggregate that first builds up the first row, then the second row, and so on. Even as formulated this way however, I fail to see how the entire "incrementalised" computation would still be practically incremental, in the sense that the size of the output diff (Z-set) is small as long as the diff of the input is small.

For example, consider the query `select x from y order by x asc`, and the following values respectively occur in the stream of x: 5, 4, 3, 2, 1. Now, consider the incremental diff for the last value of 1. If presumably one models order by a list aggregation, then the Z-set for the entire computation seems to be

    - [ 2, 3, 4, 5 ]
    + [ 1, 2, 3, 4, 5 ]
which grows with the size of the output set rather than the size of the input diff. If presumably one models order by e.g. adding an order column, the diff would be

    - 2 (index: 0)
    - 3 (index: 1)
    - 4 (index: 2)
    - 5 (index: 3)
    + 1 (index: 0)
    + 2 (index: 1)
    + 3 (index: 2)
    + 4 (index: 3)
    + 5 (index: 4)
which once again varies with the size of the output set.
qazxcvbnm··on Streaming joins are hard
Hi, I’ve read the DBSP paper and it’s a really well-thought out framework; all the magic seemed so simple with the way the paper laid things out. However, the paper dealt with abelian Z-sets only, and mentioned that in your implementation, you also handle the non-abelian aspect of ordering. I was wondering if you guys have published about how did you that?
qazxcvbnm··on Amazon reveals first color Kindle, new Kindle Scribe, and more
Happened to me too… Yes, it happened during syncing. I searched up on how to disable Kindle auto update and it’s happening less, but last time I bought a book from Kindle store I got bit again. I guess it’s a sign to stop feeding the hand that bites me.
qazxcvbnm··on Show HN: Makedown – A Markdown powered Makefile alternative
For myself, I just make a directory `workflows` and put all my scripts in it, and organise related scripts into subdirectories, so that I can use tree and filesystem tools to check what subcommands are available.
qazxcvbnm··on Optimizing Postgres table layout for maximum efficiency
Is there any potential that indexes could be created over foreign key joins in the future? I know that as of today, no multi-table indices or statistics exist for Postgres, which has had led me to do some further denormalisations.
qazxcvbnm··on The Data Visualisation Catalogue: find the right method for your data
Would you mind posting a link as well? Would be much appreciated.
qazxcvbnm··on Offline UX Patterns
I’ve known them through their work on Wish List and Flash List. They’re one of the bigger supporters in work on list rendering in React Native (a vital, devilish, and often overlooked area).
qazxcvbnm··on Normans and Slavery: Breaking the Bonds
Song was eliminated by Qi. I imagine you are referring to the Battle of Changping where the Qin buried 400,000 of Zhao’s surrendered armies.
qazxcvbnm··on Feldera Incremental Compute Engine
Incredible… I hadn’t even noticed, and people found the holy grail and open-sourced it!

By the way, I was wondering about a related question. Do streaming engines typically store a copy of the data streamed to them? For instance, if I had a view to get the maximum value of a table, and the maximum value was removed, the streaming engine surely needs to get the next value from somewhere. It seems clear that the streaming engine needs at least its own snapshot of the data to have a consistent state of the computation, but duplicating the persisted data seems somewhat wasteful.

qazxcvbnm··on FoundationDB/fdb-record-layer: A record-oriented store built on FoundationDB
That sounds incredibly cool - have you written up anything about it? I would love to learn more about it.
qazxcvbnm··on PostgreSQL 17
I think OrioleDB is picking up from where zheap left things, and seems quite active in upstreaming their work, you might be interested to check it out.
qazxcvbnm··on pgroll: PostgreSQL zero-downtime migrations made easy
This sounds quite nice, but what would be a good way to generate their JSON format from SQL?
qazxcvbnm··on Ask HN: Why is .NET never talked about as an option for solo/small team dev?
Hard to believe that .NET is now on Linux - .NET 4.0 feels like yesterday. The Windows factor was a big scare factor for me for sure; I won’t forget the time a client spent more than 70% of their hosting budget on Microsoft licensing fees…
qazxcvbnm··on Some remarks on the mathematical structure of the multiverse (2016)
I’m still not very sure of where the paradox is supposed to be for the materialist. Is the paradox supposed to be something like that the materialist accepts that consciousness is material, and that mathematical structures are not material?
← PreviousPage 2 of 6Next →