[Git 1.7.8][1] offers a solution without using grep: 

[`git branch --list &lt;pattern&gt;`][2] and in bash `git branch --list &#39;&lt;pattern&gt;&#39;` with quotes around pattern.

This works with wildcards (`*`) as well, so you can do use `git branch --list *&lt;id&gt;*` to find your branch.

This filters the list of branch names returned by the rest of your `git branch` command (for example, local branches only by default, all branches with `git branch -a --list &lt;pattern&gt;`, etc.).


  [1]: https://github.com/git/git/blob/ecbdaf0899161c067986e9d9d564586d4b045d62/Documentation/RelNotes/1.7.8.txt#L25
  [2]: https://git-scm.com/docs/git-branch#git-branch---list

    git branch -a | grep selector
Or

    git branch -r | grep selector

-a shows all local and remote branches, while -r shows only remote branches.

**Find the branch Name where having specified text**

    git branch --list *text*

**For Ex- I want to find the branch that has &quot;production&quot; word**

    git branch --list *production*

Building of the answers that others have given, I added this to my `.gitconfig` 


    [alias]
      findb = &quot;!f(){ git branch -ra | grep $1; }; f&quot;

So on the command line I can type `git findb BUG-123`

Assuming that you are using GitHub, there is a drop down list for your branches and for tags in that drop down menu there is a search area.

You can use that search area to search for your branch name.


When using `AppBarLayout` widget in design support library, a shadow appears on the bottom of the toolbar. How can I remove that shadow?

remove shadow below AppBarLayout widget android

How can I do this in JavaScript?

    var num = 2046430; 
    num.toLocaleString();
    
    will give you &quot;2,046,430&quot;;

What I have tried is: 

    var num = 2046430; 
    num.toLocaleString().toFixed(2);
   

*Expected Output* 

&gt; &quot;2,046,430.00&quot;

How to use toLocaleString() and tofixed(2) in JavaScript

I&#39;d like to find a specific branch, and I know that its name would contain a specific substring (the id of the issue from our bug tracker), but I don&#39;t know the whole name of the branch (this is what I want to find out). 

How can I search for this branch?


How do I search for branch names in Git?

<p>I'd like to find a specific branch, and I know that its name would contain a specific substring (the id of the issue from our bug tracker), but I don't know the whole name of the branch (this is what I want to find out).</p>
<p>How can I search for this branch?</p>


I was able to find a way on GitHub Website to &lt;a href=&quot;https://github.com/blog/1436-moving-and-renaming-files-on-github&quot;&gt;rename&lt;/a&gt; a single file and did so with success.

I was also able to find a way to &lt;a href=&quot;https://stackoverflow.com/questions/13909398/how-to-rename-a-github-hosted-repository&quot;&gt;rename&lt;/a&gt; a whole repository and did that with success. 

Does anyone know how to do this to a single directory without using &lt;a href=&quot;https://stackoverflow.com/questions/11183788/in-a-git-repository-how-to-properly-rename-a-directory&quot;&gt;command line&lt;/a&gt;? For reference, I am trying to change a directory named InterviewTesting (that contains src files, etc) to something else. I tried doing it the single file way. [![enter image description here][1]][1]&lt;br&gt; But this didn&#39;t allow me to change the name of the directory (InterviewTesting), only the actual file name.


  [1]: http://i.stack.imgur.com/LjA2o.png

How to rename a directory/folder on GitHub website?

I recently discovered the [`git worktree`](https://git-scm.com/docs/git-worktree) command:

&gt; The new working directory is linked to the current repository, sharing everything except working directory specific files such as HEAD, index, etc.

But the docs also indicate 

&gt; … the support for submodules is incomplete. It is NOT recommended to make multiple checkouts of a superproject.

without further explanation as to what goes wrong.

Can someone enlighten me about the problems to expect? For example, will I be fine if I use the separate worktrees generated this way only for changes that do not affect the submodules?

What goes wrong when using git worktree with git submodules

Visual Studio 2015 creates a new folder called &quot;.vs&quot;. What is the purpose of it and should I add it to source control?

Should I add the Visual Studio 2015 .vs folder to source control?

So my history looks like this:

```
o---o---o---o  master
     \
      o---o---o  A
               \
                o B
```

So, to explain:

- I have branch `A` which was started from `master`
- I have branch `B` (with only 1 commit) which was started from `A`

What I want is this:

```
o---o---o---o  master
             \
              o---o---o  A
                       \
                        o B
```

---

What I did was:

1).

```
git checkout A
git rebase master
```

This resulted in a lot of conflicts which, after some significant time spent fixing, the following history emerged:

```
o---o---o---o  master
             \
              o---o---o  A
```

Which is exactly what I wanted.

(I don&#39;t know where `B` is right now)

---

2).

After this I did a lot of squashes and changed the order of commits on `A`, to make the history look like I want.

---

3).

Now, what I also want to do is:

```
git checkout B
git rebase A
```

However this doesn&#39;t seem to work and I don&#39;t know why. If I do `git log` I see the commits which were there before I did step 1.

Also, I get the same huge number of conflicts which I already solved at step 1. I spent significant time doing it, don&#39;t want to do it again.

[This example](https://stackoverflow.com/questions/27445747/how-to-rebase-over-already-rebased-branch) suggested to use `--onto`, which I did:

```
git checkout B
git rebase --onto A
```

But this deletes the commit on `B` entirely and makes `A` and `B` point to the same commit i.e. the last one on `A`.

---

My question is: **How can I effectively rebase B off A so that it looks like B started from A** ? (which was actually true in the beginning).

My best guess is that I&#39;m using `--onto` wrong. Or that I should use something else (like `cherry-pick`).

How to rebase a branch off a rebased branch?

I am trying to search some code in a branch in a GitHub repository.

However [this][1] indicates that I can only search the default branch.

Is there a way I can search code in non-default branch in my GitHub repository?

  [1]: https://help.github.com/articles/searching-code/


Searching code in a specific GitHub branch

I wish to create a fuzzy search algorithm. 
However, upon hours of research I am really struggling.

I want to create an algorithm that performs a fuzzy search on a list of names of schools.

**This is what I have looked at so far:**

Most of my research keep pointing to &quot;**string metrics**&quot; on Google and Stackoverflow such as:

 - **Levenshtein distance**
 - **Damerau-Levenshtein distance**
 - **Needleman–Wunsch algorithm**

However this just gives a score of how **similar** 2 strings are. The only way I can think of implementing it as a **search algorithm** is to perform a linear search and executing the string metric algorithm for each string and returning the strings with scores above a certain threshold. (Originally I had my strings stored in a trie tree, but this obviously won&#39;t help me here!)

Although this is not such a bad idea for small lists, it would be problematic for lists with lets say a 100,000 names, and the user performed many queries.

Another algorithm I looked at is the **Spell-checker method**, where you just do a search for all potential misspellings. However this also is highly inefficient as it requires more than 75,000 words for a word of length 7 and error count of just 2.  

**What I need?**

Can someone please suggest me a **good efficient fuzzy search algorithm**. with:

 - Name of the algorithm
 - How it works or a link to how it works
 - Pro&#39;s and cons and when it&#39;s best used (optional)

I understand that all algorithms will have their pros and cons and there is no *best* algorithm.

Fuzzy search algorithm (approximate string matching algorithm)

How can I *find a file by name* in Visual Studio Code?

A Visual Studio shortcut I&#39;m used to is &lt;kbd&gt;CTRL&lt;/kbd&gt;+&lt;kbd&gt;,&lt;/kbd&gt;, but it does not work here.

Find a file by name in Visual Studio Code

I&#39;m trying to use [GitHub&#39;s code search](https://github.com/search) to search for some lines of code containing characters like `=`, `+`, etc.

I understand from https://help.github.com/articles/searching-code/#considerations-for-code-search that these characters are wildcards and have to be escaped, otherwise they will be ignored.

Here&#39;s an example: [&quot;if \$done is True\$&quot;][1], and another: [&quot;if (done is True)&quot;][2]. 

Both return the same `&quot;your query contains a character that is ignored&quot;` warning on the right side of the search bar. My escaping doesn&#39;t seem to be doing anything and the results I get are with the characters ignored.

  [1]: https://github.com/search?q=%22if%20%5C%28done%20is%20True%5C%29%22&amp;ref=searchresults&amp;type=Code&amp;utf8=%E2%9C%93
  [2]: https://github.com/search?utf8=%E2%9C%93&amp;q=%22if%20%28done%20is%20True%29%22&amp;type=Code&amp;ref=searchresults

How do I escape characters in GitHub code search?

Recently I had an interview, where they asked me a &quot;*searching*&quot; question.  
The question was:

&gt; Assume there is an array of (positive) integers, of which each element is either `+1` or `-1` compared to its adjacent elements.
&gt;
&gt; **Example:**
&gt;
&gt;     array = [4,5,6,5,4,3,2,3,4,5,6,7,8];
&gt;
&gt; Now search for `7` and return its position.

I gave this answer:

&gt; Store the values in a temporary array, sort them, and then apply binary search.
&gt;
&gt; If the element is found, return its position in the temporary array.  
(If the number is occurring twice then return its first occurrence)

But, they didn&#39;t seem to be satisfied with this answer.

What is the right answer?

Efficient way to search an element

There are a couple of things I do not yet understand the VIM way.

One of these is searching in a project like so (using VIM in Atom):

[![enter image description here][1]][1]


  [1]: http://i.stack.imgur.com/fIdMK.gif

I use CtrlP currently for file names, but what about the contents? 

How can I search with a string, and then look through a list of all occurrences using VIM and/or VIM plugins?

Content Type	Original Author	Original Content on Stackoverflow
Question	user650309	View Question on Stackoverflow
Solution 1 - Git	Evil Toad	View Answer on Stackoverflow
Solution 2 - Git	Calvin Li	View Answer on Stackoverflow
Solution 3 - Git	Roy Shmuli	View Answer on Stackoverflow
Solution 4 - Git	user6609090	View Answer on Stackoverflow
Solution 5 - Git	Snekse	View Answer on Stackoverflow
Solution 6 - Git	Fosterdn007	View Answer on Stackoverflow

How do I search for branch names in Git?

Git Problem Overview

Git Solutions

Solution 1 - Git

Solution 2 - Git

Solution 3 - Git

Solution 4 - Git

Solution 5 - Git

Solution 6 - Git

How to use toLocaleString() and tofixed(2) in JavaScript

remove shadow below AppBarLayout widget android

Attributions