[GitHub] [apisix] jbampton commented on pull request #3584: chore: fix grammar

[GitBox]

jbampton commented on pull request #3584:
URL: https://github.com/apache/apisix/pull/3584#issuecomment-777171052


   The `secret` to finding the duplicated words of length 2 and 3 is by using 
regular expressions in a find / replace inside your editor.
   
   The regexs I used were:
   
   `(\S{2}) \1` and `(\S{3}) \1`
   
   But really I started at a higher quantifier number e.g. `(\S{10}) \1` and 
moved downwards doing some manual `sifting` etc.  Can also be setup with a 
script in a loop that counts down to 2 and prints matches for debugging.  Less 
false positives would be returned from better regexes. 
   
   Lots of editors provide global search through files.
   
   I've used a lot of different editors over the years and I think the best are:
   
   - Vim
   - GNU Emacs
   - GNU nano
   - Sublime Text
   - Atom
   - IntelliJ IDEA Community
   - PyCharm Community
   
   <img width="969" alt="Screen Shot 2021-02-11 at 12 22 02 pm" 
src="https://user-images.githubusercontent.com/418747/107596689-3e23e000-6c64-11eb-961b-6429fbfef7a2.png";>
   
   <img width="621" alt="Screen Shot 2021-02-11 at 12 35 31 pm" 
src="https://user-images.githubusercontent.com/418747/107597356-1afa3000-6c66-11eb-9988-70916c554ee3.png";>
   
   https://www.vim.org/
   https://www.gnu.org/software/emacs/
   https://www.nano-editor.org/
   https://www.sublimetext.com/
   https://atom.io/
   https://www.jetbrains.com/idea/download/
   https://www.jetbrains.com/pycharm/download/
   https://www.rexegg.com/


----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org