summaryrefslogblamecommitdiffstats
path: root/2023/talks/parallel.md
blob: ea966383323d515189407f909feb301d7bc37206 (plain) (tree)












































                                                                                                    
[[!meta title="Parallel Text Replacement: Does P = NP?"]]
[[!meta copyright="Copyright © 2023 Lovro"]]
[[!inline pages="internal(2023/info/parallel-nav)" raw="yes"]]

<!-- Initially generated with emacsconf-publish-talk-page and then left alone for manual editing -->
<!-- You can manually edit this file to update the abstract, add links, etc. --->


# Parallel Text Replacement: Does P = NP?
Lovro - IRC: hokomo, <mailto:hokomo@airmail.cc>

[[!inline pages="internal(2023/info/parallel-before)" raw="yes"]]

We present our Emacs package for performing parallel text 
replacement.

"Parallel" in this context does not refer to improving 
efficiency through parallelism, but to the concept of performing 
more than one text replacement without them interfering with 
each other. This is in line with the usage of the term in the 
Lisp community when contrasting the behaviors of LET and LET\*, 
SETQ and PSETQ, etc. (e.g. 
<http://www.lispworks.com/documentation/lw60/CLHS/Body/s_let_l.htm>).

We will present the package's features and its integration with 
Emacs' query-replace system, a comparison with previous 
solutions, and a few notes on our implementation. We will 
describe some common use-cases and showcase how the package is 
used.

The package is currently not yet published in a package archive, 
but the code is already publicly available at 
<https://github.com/hokomo/query-replace-parallel>. The name 
"query-replace-parallel" is not yet final and we are thinking of 
alternatives. Our current best candidate is "replace-parallel" 
(similar to the built-in "replace.el"), but suggestions are 
welcome.



[[!inline pages="internal(2023/info/parallel-after)" raw="yes"]]

[[!inline pages="internal(2023/info/parallel-nav)" raw="yes"]]