Search (e.g. using &lt;kbd&gt;/&lt;/kbd&gt;) for `\%x1b`.

You can also type control characters, including escape, into the command line by preceding them with &lt;kbd&gt;Ctrl&lt;/kbd&gt;-&lt;kbd&gt;V&lt;/kbd&gt;.  So type &lt;kbd&gt;/&lt;/kbd&gt;, &lt;kbd&gt;Ctrl-V&lt;/kbd&gt;, &lt;kbd&gt;Esc&lt;/kbd&gt;, &lt;kbd&gt;Enter&lt;/kbd&gt;.

Transform vim into a hex editor by doing  `[escape] :%!xxd`. Then search for 0x1B (`/1B`).

You can discover what a hex value of a character by putting the cursor on it and pressing `ga`

Below you will see a hex value of the character. Example for a `&lt;╬&gt;` character 

&gt; &lt;╬&gt;  &lt;|N&gt;  &lt;M-N&gt;  206,  Hex ce,  Oct 316, Digr I&gt;

Delete it by : 

    %s/\%xce//g 

I just want to add the subscription date in the User list in the Django CRUD&#160;Administration site.
How can I do that ?

Thank you for your help

How to customize the auth.User Admin page in Django CRUD?

Is there a way to load a 32bit DLL library (something with the same usage as LoadLibrary) I would like to use that function along with GetProcAddress.

I looked at WOW, but it does not seem to offer the functionality. The functionality should exist, since tools like DependencyWalker are able to read the symbols of a 32bit dll even though its 64bits.

thanks

Load 32bit DLL library in 64bit application

I need to clean up a file.  We have an xml parser that runs on it that is failing due to an escape character (0x1B) in the file.  How do I use vim to find where in the file that character is so I can remove it?



Example file:

    &lt;?php
    echo &quot;Hello, world.\n&quot;;                           
    ?&gt;

After conversion:

    0000000: 0a3c 3f70 6870 0a65 6368 6f20 2248 656c  .&lt;?php.echo &quot;Hel
    0000010: 6c6f 2c20 776f 726c 642e 5c6e 223b 0a3f  lo, world.\n&quot;;.?
    0000020: 3e0a  

  

So I delete a char: (in this example, the &#39;H&#39;)

    0000000: 0a3c 3f70 6870 0a65 6368 6f20 22 656c  .&lt;?php.echo &quot;Hel
    0000010: 6c6f 2c20 776f 726c 642e 5c6e 223b 0a3f  lo, world.\n&quot;;.?
    0000020: 3e0a

Notice how the first line isn&#39;t wide enough anymore.    When I convert it back, I get:

    ^@&lt;?php
    echo &quot;el^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@&gt; 



Use vim to search by hex code

I need to clean up a file. We have an xml parser that runs on it that is failing due to an escape character (0x1B) in the file. How do I use vim to find where in the file that character is so I can remove it?
Example file:
<pre><code class="hljs language-php">&#x3C;?php
echo "Hello, world.\n"; 
?>
</code></pre>
After conversion:
<pre><code class="hljs language-php">0000000: 0a3c 3f70 6870 0a65 6368 6f20 2248 656c .&#x3C;?php.echo "Hel
0000010: 6c6f 2c20 776f 726c 642e 5c6e 223b 0a3f lo, world.\n";.?
0000020: 3e0a 
</code></pre>
So I delete a char: (in this example, the 'H')
<pre><code class="hljs language-php">0000000: 0a3c 3f70 6870 0a65 6368 6f20 22 656c .&#x3C;?php.echo "Hel
0000010: 6c6f 2c20 776f 726c 642e 5c6e 223b 0a3f lo, world.\n";.?
0000020: 3e0a
</code></pre>
Notice how the first line isn't wide enough anymore. When I convert it back, I get:
<pre><code class="hljs language-php">^@&#x3C;?php
echo "el^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@^@> 
</code></pre>

I&#39;d like to search for an upper case word, for example COPYRIGHT in a file. I tried performing a search like:

    /copyright/i    # Doesn&#39;t work

but it doesn&#39;t work.  I know that in Perl, if I give the `i` flag into a regex it will turn the regex into a case-insensitive regex. It seems that Vim  has its own way to indicate a case-insensitive regex.

How to do case insensitive search in Vim

I&#39;ve [asked a simlar question on Meta Stack Overflow][1], but that deals specifically with whether or not [Lucene.NET][2] is used on Stack&amp;nbsp;Overflow.

The purpose of the question here is more of a hypotetical, as to what approaches one would make if they were to use Lucene.NET as a basis for in-site search and other factors in a site *like* Stack&amp;nbsp;Overflow [SO]. 

As per the entry on the Stack&amp;nbsp;Overflow blog titled &quot;[SQL 2008 Full-Text Search Problems][3]&quot; there was a **strong** indication that Lucene.NET was being considered at some point, but it appears that is definitely not the case, as per the comment by [Geoff Dalgas][4] on February 19th 2010:

&gt; Lucene.NET is not being used for Stack
&gt; Overflow - we are using SQL Server
&gt; Full Text indexing. Search is an area
&gt; where we continue to make minor
&gt; tweaks.

So my question is, how would one utilize Lucene.NET into a site which has the same semantics of Stack&amp;nbsp;Overflow?

Here is some background and what I&#39;ve done/thought about so far (yes, I&#39;ve been implementing most of this and search is the last aspect I have to complete):

**Technologies:**

- [ASP.NET MVC][5]
- [SQL Server 2008][6]
- [.NET 3.5][7]
- [C# 3.0][8]

And of course, the star of the show, Lucene.NET.

The intention is also to move to .NET/C# 4.0 ASAP. While I don&#39;t think it&#39;s a game-changer, it should be noted.

Before getting into aspects of Lucene.NET, it&#39;s important to point out the SQL Server 2008 aspects of it, as well as the models involved.

**Models**

This system has more than one primary model type in comparison to Stack&amp;nbsp;Overflow. Some examples of these models are:

- Questions: These are questions that people can ask. People can reply to questions, just like on Stack&amp;nbsp;Overflow.
- Notes: These are one-way projections, so as opposed to a question, you are making a statement about content.  People can&#39;t post replies to this.
- Events: This is data about a real-time event.  It has location information, date/time information.

The important thing to note about these models:

- They all have a Name/Title (text) property and a Body (HTML) property (the formats are irrelevant, as the content will be parsed appropriately for analysis).
- Every instance of a model has a unique URL on the site

Then there are the things that Stack&amp;nbsp;Overflow provides which IMO, are decorators to the models. These decorators can have different cardinalities, either being one-to-one or one-to-many:

- Votes: Keyed on the user
- Replies: Optional, as an example, see the Notes case above
- Favorited: Is the model listed as a favorite of a user?
- Comments: (optional)
- Tag Associations: Tags are in a separate table, so as not to replicate the tag for each model.  There is a link between the model and the tag associations table, and then from the tag associations table to the tags table.

And there are supporting tallies which in themselves are one-to-one decorators to the models that are keyed to them in the same way (usually by a model id type and the model id):

- Vote tallies: Total postive, negative votes, [Wilson Score interval][9] (this is important, it&#39;s going to determine the confidence level based on votes for an entry, for the most part, assume the lower bound of the Wilson interval).

Replies (answers) are models that have most of the decorators that most models have, they just don&#39;t have a title or url, and whether or not a model has a reply is optional.  If replies are allowed, it is of course a one-to-many relationship.

**SQL Server 2008**

The tables pretty much follow the layout of the models above, with separate tables for the decorators, as well as some supporting tables and views, stored procedures, etc.

It should be noted that the decision to not use full-text search is based primarily on the fact that it doesn&#39;t normalize scores like Lucene.NET. I&#39;m open to suggestions on how to utilize text-based search, but I will have to perform searches across multiple model types, so keep in mind I&#39;m going to need to normalize the score *somehow*.

**Lucene.NET**

This is where the big question mark is. Here are my thoughts so far on Stack&amp;nbsp;Overflow functionality as well as how and what I&#39;ve already done.

**Indexing**

**Questions/Models** 

I believe each model should have an index of its own containing a unique id to quickly look it up based on a Term instance of that id (indexed, not analyzed).

In this area, I&#39;ve considered having Lucene.NET analyze each question/model and each reply individually.  So if there was one question and five answers, the question and each of the answers would be indexed as one unit separately.  

The idea here is that the relevance score that Lucene.NET returns would be easier to compare between models that project in different ways (say, something without replies).

As an example, a question sets the subject, and then the answer elaborates on the subject.

For a note, which doesn&#39;t have replies, it handles the matter of presenting the subject and then elaborating on it.

I believe that this will help with making the relevance scores more relevant to each other.

**Tags**

Initially, I thought that these should be kept in a separate index with multiple fields which have the ids to the documents in the appropriate model index. Or, if that&#39;s too large, there is an index with just the tags and another index which maintains the relationship between the tags index and the questions they are applied to. This way, when you click on a tag (or use the URL structure), it&#39;s easy to see in a progressive manner that you only have to &quot;buy into&quot; if you succeed:

- If the tag exists
- Which questions the tags are associated with
- The questions themselves

However, in practice, doing a query of all items based on tags (like clicking on a tag in Stack&amp;nbsp;Overflow) is *extremely easy* with SQL Server 2008. Based on the model above, it simply requires a query such as:

    select
         m.Name, m.Body
    from
        Models as m
            left outer join TagAssociations as ta on
                ta.ModelTypeId = &lt;fixed model type id&gt; and
                ta.ModelId = m.Id
            left outer join Tags as t on t.Id = ta.TagId
    where
        t.Name = &lt;tag&gt;

And since certain properties are shared across all models, it&#39;s easy enough to do a `UNION` between different model types/tables and produce a consistent set of results.

This would be analagous to a [`TermQuery`][10] in Lucene.NET (I&#39;m referencing the [Java documentation][11] since it&#39;s comprehensive, and Lucene.NET is meant to be a line-by-line translation of [Lucene][12], so all the documentation is the same).

The issue that comes up with using Lucene.NET here is that of sort order. The relevance score for a TermQuery when it comes to tags is irrelevant. It&#39;s either 1 or 0 (it either has it or it doesn&#39;t).

At this point, the confidence score (Wilson score interval) comes into play for ordering the results.

This score could be stored in Lucene.NET, but in order to sort the results on this field, it would rely on the values being stored in the field cache, which is something I really, really want to avoid. For a large number of documents, the field cache can grow very large (the Wilson score is a double, and you would need one double for every document, that can be one large array).

Given that I can change the SQL statement to order based on the Wilson score interval like this:

    select
         m.Name, m.Body
    from
        Models as m
            left outer join TagAssociations as ta on
                ta.ModelTypeId = &lt;fixed model type id&gt; and
                ta.ModelId = m.Id
            left outer join Tags as t on t.Id = ta.TagId
            left outer join VoteTallyStatistics as s on
                s.ModelTypeId = ta.ModelTypeId and
                s.ModelId = ta.ModelId
    where
        t.Name = &lt;tag&gt;
    order by
        --- Use Id to break ties.
        s.WilsonIntervalLowerBound desc, m.Id

It seems like an easy choice to use this to handle the piece of Stack&amp;nbsp;Overflow functionality &quot;get all items tagged with &amp;lt;tag&amp;gt;&quot;.

**Replies**

Originally, I thought this is in a separate index of its own, with a key back into the Questions index.

I think that there should be a combination of each model and each reply (if there is one) so that relevance scores across different models are more &quot;equal&quot; when compared to each other.

This would of course bloat the index.  I&#39;m somewhat comfortable with that right now.

Or, is there a way to store say, the models and replies as individual documents in Lucene.NET and then take both and be able to get the relevance score for a query treating *both documents as one*?  If so, then this would be **ideal**.

There is of course the question of what fields would be stored, indexed, analyzed (all operations can be separate operations, or mix-and-matched)? *Just how much would one index?*

What about using special stemmers/porters for spelling mistakes (using Metaphone) as well as synonyms (there is terminology in the community I will service which has it&#39;s own slang/terminology for certain things which has multiple representations)?

**Boost**

This is related to indexing of course, but I think it merits it&#39;s own section.

Are you **boosting** fields and/or documents? If so, how do you boost them? Is the boost constant for certain fields? Or is it recalculated for fields where vote/view/favorite/external data is applicable.

For example, in the document, does the title get a boost over the body? If so, what boost factors do you think work well? What about tags?

The thinking here is the same as it is along the lines of Stack&amp;nbsp;Overflow. Terms in the document have relevance, but if a document is tagged with the term, or it is in the title, then it should be boosted.

[Shashikant Kore][13] suggests a document structure like this:

- Title
- Question
- Accepted Answer (Or highly voted answer if there is no accepted answer)
- All answers combined

And then using boost but not based on the raw vote value. I believe I have that covered with the Wilson Score interval.

The question is, should the boost be applied to the entire document? I&#39;m leaning towards no on this one, because it would mean I&#39;d have to reindex the document each time a user voted on the model.

**Search for Items Tagged &lt;tag&gt;**

I originally thought that when querying for a tag (by specifically clicking on one or using the URL structure for looking up tagged content), that&#39;s a simple TermQuery against the tag index for the tag, then in the associations index (if necessary) then back to questions, Lucene.NET handles this really quickly.

However, given the notes above regarding how easy it is to do this in SQL Server, I&#39;ve opted for that route when it comes to searching tagged items.

**General Search**

So now, the most outstanding question is when doing a general phrase or term search against content, what and how do you integrate other information (such as votes) in order to determine the results in the proper order? For example, when performing this search on [ASP.NET MVC on Stack Overflow][14], these are the tallies for the top five results (when using the relevance tab):

        q votes answers accepted answer votes asp.net highlights mvc highlights
        ------- ------- --------------------- ------------------ --------------
             21      26                    51                  2              2
             58      23                    70                  2              5
             29      24                    40                  3              4
             37      15                    25                  1              2
             59      23                    47                  2              2

Note that the highlights are only in the title and abstract on the results page and are only minor indicators as to what the true term frequency is in the document, title, tag, reply (however they are applied, which is another good question).

How is all of this brought together?  

At this point, I know that Lucene.NET will return a normalized relevance score, and the vote data will give me a Wilson score interval which I can use to determine the confidence score.

**How should I look at combining tese two scores to indicate the sort order of the result set based on relevance and confidence?**

It is obvious to me that there should be *some* relationship between the two, but what that relationship should be evades me at this point.  I know I have to refine it as time goes on, but I&#39;m really lost on this part.

My initial thoughts are if the relevance score is beween 0 and 1 and the confidence score is between 0 and 1, then I could do something like this:

    1 / ((e ^ cs) * (e ^ rs))

This way, one gets a normalized value that approaches 0 the more relevant and confident the result is, and it can be sorted on that.

The main issue with that is that if boosting is performed on the tag and or title field, then the relevance score is outside the bounds of 0 to 1 (the upper end becomes unbounded then, and I don&#39;t know how to deal with that).

Also, I believe I will have to adjust the confidence score to account for vote tallies that are completely negative.  Since vote tallies that are completely negative result in a Wilson score interval with a lower bound of 0, something with -500 votes has the same confidence score as something with -1 vote, or 0 votes.

Fortunately, the upper bound decreases from 1 to 0 as negative vote tallies go up. I could change the confidence score to be a range from -1 to 1, like so:

    confidence score = votetally &lt; 0 ? 
        -(1 - wilson score interval upper bound) :
        wilson score interval lower bound

The problem with this is that plugging in 0 into the equation will rank all of the items with zero votes below those with negative vote tallies.

To that end, I&#39;m thinking if the confidence score is going to be used in a reciprocal equation like above (I&#39;m concerned about overflow obviously), then it needs to be reworked to always be positive.  One way of achieving this is:

    confidence score = 0.5 + 
        (votetally &lt; 0 ? 
            -(1 - wilson score interval upper bound) :
            wilson score interval lower bound) / 2

My other concerns are how to actually perform the calculation given Lucene.NET and SQL Server.  I&#39;m hesitant to put the confidence score in the Lucene index because it requires use of the field cache, which can have a huge impact on memory consumption (as mentioned before).

An idea I had was to get the relevance score from Lucene.NET and then using a [table-valued parameter][15] to stream the score to SQL Server (along with the ids of the items to select), at which point I&#39;d perform the calculation with the confidence score and then return the data properly ordred.

As stated before, there are a lot of other questions I have about this, and the answers have started to frame things, and will continue to expand upon things as the question and answers evovled.

  [1]: https://meta.stackexchange.com/questions/39950/how-is-lucene-net-utilized-on-stackoverflow-if-at-all
  [2]: http://incubator.apache.org/lucene.net/
  [3]: https://blog.stackoverflow.com/2008/11/sql-2008-full-text-search-problems/
  [4]: https://meta.stackoverflow.com/users/2/geoff-dalgas
  [5]: http://www.asp.net/mvc/
  [6]: http://msdn.microsoft.com/sqlserver
  [7]: http://msdn.microsoft.com/netframework
  [8]: http://msdn.microsoft.com/netframework
  [9]: http://en.wikipedia.org/wiki/Binomial_proportion_confidence_interval#Wilson_score_interval
  [10]: http://lucene.apache.org/java/2_4_0/api/org/apache/lucene/search/TermQuery.html
  [11]: http://lucene.apache.org/java/3_0_1/
  [12]: http://lucene.apache.org/java/docs/
  [13]: https://stackoverflow.com/users/77308/shashikant-kore
  [14]: https://stackoverflow.com/search?q=asp.net+mvc
  [15]: http://msdn.microsoft.com/en-us/library/bb510489.aspx


How would one use Lucene.NET to help implement search on a site like Stack Overflow?

I have a part of HTML source file that contains strings that I want to select and copy at once, using the regex functionality of Notepad++.

Here is a part of the text source:

    &lt;option value=&quot;Performance&quot;
    &gt;Performance&lt;/option&gt;
    &lt;option value=&quot;Maintenance&quot;
    &gt;Maintenance&lt;/option&gt;
    &lt;option value=&quot;System Stability&quot;
    &gt;System Stability&lt;/option&gt;

I&#39;m using the regex `&quot;[0-9a-zA-Z ]*&quot;` to search the &quot;value&quot; values. I have also selected the feature in Notepad++ search to highlight/mark the found text. This working fine I now want to copy or cut only the highlighted text to clipboard for further processing. But I&#39;m not able to find this functionality in Notepad++. Is this simply not possible or am I too dumb?

How to copy marked text in notepad++

I have 2 arrays, the value will be loaded from database, below is an example:

    $arr1 = array(1,2,3);
    $arr2 = array(1,2,3,4,5,6,7);

What I want to do is to check if **all the values** in `$arr1` exist in `$arr2`. The above example should be a `TRUE` while:

    $arr3 = array(1,2,4,5,6,7);

comparing `$arr1` with `$arr3` will return a `FALSE`.

Normally I use `in_array` because I only need to check single value into an array. But in this case, `in_array` cannot be used. I&#39;d like to see if there is a simple way to do the checking with a minimum looping.

UPDATE for clarification.

First array will be a set that contains unique values. Second array can contain duplicated values. They are both guaranteed an array before processing.


How can I use in_array if the needle is an array?

I was recently given this interview question and I&#39;m curious what a good solution to it would be.

&gt; Say I&#39;m given a 2d array where all the
&gt; numbers in the array are in increasing
&gt; order from left to right and top to
&gt; bottom.
&gt; 
&gt; What is the best way to search and
&gt; determine if a target number is in the
&gt; array?

Now, my first inclination is to utilize a binary search since my data is sorted.  I can determine if a number is in a single row in O(log N) time.  However, it is the 2 directions that throw me off.

Another solution I thought may work is to start somewhere in the middle.  If the middle value is less than my target, then I can be sure it is in the left square portion of the matrix from the middle.  I then move diagonally and check again, reducing the size of the square that the target could potentially be in until I have honed in on the target number.

Does anyone have any good ideas on solving this problem?

Example array:  

Sorted left to right, top to bottom.

    1  2  4  5  6  
    2  3  5  7  8  
    4  6  8  9  10  
    5  8  9  10 11  

How do I search for a number in a 2d array sorted left to right and top to bottom?

I like that the long lines are displayed over more than one terminal line;  I don’t like that vim inserts newlines into my actual text. Which part of .vimrc I should change?

How to stop line breaking in vim

Instead of deleting the word and retyping all the letters once again in the opposite case, I&#39;d like to find some smart way in Vim to solve the problem.

How to change letters in a word from upper case to lower case or the other way around (swap case)?

So when I want to create a new file by using the :e command I don&#39;t want to specify the whole path, just the new filename.  Can it be done?

How to set working/current directory in Vim?

I checked the documentation and I couldn&#39;t find a way o renaming or copying files and folder using NERDTree. Is it possible?

Renaming or copying files and folder using NERDTree on Vim. Is it possible?

I want to take an integer (that will be &lt;= 255), to a hex string representation

e.g.: I want to pass in `65` and get out `&#39;\x41&#39;`, or `255` and get `&#39;\xff&#39;`.

I&#39;ve tried doing this with the `struct.pack(&#39;c&#39;, `65`)`, but that chokes on anything above `9` since it wants to take in a single character string.

How to convert an int to a hex string?

I am trying to use `str.encode()` but I get

    &gt;&gt;&gt; &quot;hello&quot;.encode(hex)
    Traceback (most recent call last):
      File &quot;&lt;stdin&gt;&quot;, line 1, in &lt;module&gt;
    TypeError: must be string, not builtin_function_or_method

I have tried a bunch of variations and they seem to all work in Python 2.5.2, so what do I need to do to get them to work in Python 3.1?

Python 3.1.1 string to hex

How do I create an **unmodified** hex dump of a binary file in Linux using bash? The `od` and `hexdump` commands both insert spaces in the dump and this is not ideal.

Is there a way to simply write a long string with all the hex characters, minus spaces or newlines in the output?

How to create a hex dump of file containing only the hex characters without spaces in bash?

Why are hexadecimal numbers prefixed as `0x`?
 I understand the usage of the prefix but I don&#39;t understand the significance of why `0x` was chosen.

Why are hexadecimal numbers prefixed with 0x?

When defining colors using &quot;shorthand hexidecimal&quot; (`style=&quot;color: #FFF;&quot;`), is there a defined method for expanding the shorthand? (`style=&quot;color: #F0F0F0;&quot;` or `style=&quot;color: #FFFFFF;&quot;`)

Do all browsers use the same expansion method? Is this behavior by specification (if so, where is it defined)? Does the expansion method perhaps vary between CSS 1/2/3?

I&#39;ve observed that &quot;most browsers&quot; expand to `#FFFFFF`.

Are there any other places (outside of HTML/CSS) where this shorthand notation is allowed, but the expansion method is different?

I&#39;ve always avoided using shorthand hex, because I&#39;ve never known the answers to these questions...

Content Type	Original Author	Original Content on Stackoverflow
Question	David Oneill	View Question on Stackoverflow
Solution 1 - Search	Nefrubyr	View Answer on Stackoverflow
Solution 2 - Search	Alexander Gessler	View Answer on Stackoverflow
Solution 3 - Search	Dani Konoplya	View Answer on Stackoverflow

Use vim to search by hex code

Search Problem Overview

Search Solutions

Solution 1 - Search

Solution 2 - Search

Solution 3 - Search

Load 32bit DLL library in 64bit application

How to customize the auth.User Admin page in Django CRUD?

Attributions