zoukankan      html  css  js  c++  java
  • More on vim tips

    1. dd will delete the whole line and cc will delete the whole line and change into insert mode.

    2. use / or ? to do search , and use n or N to move to the next or previous one.

    3. :set ignorecase

    4. :set hlsearch

    5. :nohlsearch

    6. :noh

    7. :800    this will go to the 800th line

    8. /.[aoeiu]     this will search any character followed by a vowel.

    9. /   this will search all the blank lines

    10. in normal mode, press d, then press /, and enter something, then press enter, it will delete from the cursor to the characters you entered. also we can use "c" rather than "d" to enter into switch mode.

    11. :s/aa/bb will substitute; if for the whole file, use :%s/aa/bb ; :%s/aa/bb/g will substitute several occurrences in the same line.

    12. shift v will go into visual line mode.

    13. in normal mode, say for a function, put your cursor under a bracket, then press v , then press "%" will select the whole block, then press ":" , then press s/echo/say/gc, here c for confirm.  we can use "gv" to select the previous block.

    Notes about using sublime text:

    1. option + ] will give left single quote, option + [ will give left double quotes. option + shift + [ will give right double quotes, shift + option + ] will give left right single quote. 

    2. cmd + ] will indent the line

    3. choose line->reindent will reindent the code you choose.

    4. cmd + i for incremental search;

    5. shift + cmd + f will give another finding method.

    6. option + -> will move one word at a time.

    7. command + p will go to everything

    8.  when you press "cmd + p", then press "#", this will go into fuzzy matching mode. 

    9. try css@ to see the elements related to css 

    10. shift + cmd + p will lead us to the command pallet

    11. shift + cmd + l will split into lines.

    12. ctrl + space to bring up the auto completion.

    13. 

  • 相关阅读:
    B-Tree(B树)原理及C++代码实现
    Select(快速选择顺序统计量)原理及C++代码实现
    BucketSort(桶排序)原理及C++代码实现
    RadixSort(基数排序)原理及C++代码实现
    CountingSort(计数排序)原理及C++代码实现
    面向对象之封装
    今日算法题
    面向对象之抽象类和接口
    面向对象之多态
    今日算法题
  • 原文地址:https://www.cnblogs.com/sun1030/p/3381514.html
Copyright © 2011-2022 走看看