You can use Script Runner plugin – Edit: It unfortunately is no longer free. The last version before 4.0 still is, though. Details here https://www.adaptavist.com/doco/display/SFJ/Downgrade+ScriptRunner It sports a ton of incredibly useful functions, one of these is hasLinks() Usage example: issueFunction in hasLinks(“blocks”) OR issueFunction in hasLinks(“is blocked by”)
The problem with VARCHAR being used for any KEY is that they can hold WHITE SPACE. White space consists of ANY non-screen-readable character, like spaces tabs, carriage returns etc. Using a VARCHAR as a key can make your life difficult when you start to hunt down why tables aren’t returning records with extra spaces at … Read more
In a depth-first search, you begin at some node in the graph and continuously explore deeper and deeper into the graph while you can find new nodes that you haven’t yet reached (or until you find the solution). Any time the DFS runs out of moves, it backtracks to the latest point where it could … Read more
You usually have similar analysis chain at both index time and query time. Similar doesn’t mean exactly the same, but usually the way you index documents reflects the way you query them. The ngrams example is a really good fit though, since it’s one of the main reasons why you would use different analyzers at … Read more
The problem is that people are really sloppy with terminology. There are 3 important but distinct classes here: O(1) worst-case This is simple – all operations take no more than a constant amount of time in the worst case, and therefore in all cases. Accessing an element of an array is O(1) worst-case. O(1) amortized … Read more
In order to efficiently search using levenshtein distance, you need an efficient, specialised index, such as a bk-tree. Unfortunately, no database system I know of, including MySQL, implements bk-tree indexes. This is further complicated if you’re looking for full-text search, instead of just a single term per row. Off-hand, I can’t think of any way … Read more
After running various benchmarks, I came to the conclusion that only a tree like structure can work here. A sorted list shows of course good lookup performance – O(log n) – but it shows horribly update performance (inserts and removals are slower by more than the factor 10 compared to trees!). A balanced binary tree … Read more
That can be done with include, here’s some simple example: Content of A/CMakeLists.txt function(foo) message(STATUS “heya”) endfunction() Content of B/CMakeLists.txt cmake_minimum_required(VERSION 2.8) include(${CMAKE_CURRENT_SOURCE_DIR}/../A/CMakeLists.txt) foo() Now, including another CMakeLists.txt will also run everything in that file, so you may want to avoid doing that if there are targets in B/CMakeLists.txt If you can modify your code, … Read more
Update: Vim now has cdo, see Sid’s answer. Original Answer: Vim has bufdo, windo, tabdo and argdo, which let you perform the same command in all open buffers, windows or files in the argument list. What we really need is something like quickfixdo, which would invoke a command on every file in the quickfix list. … Read more
args and argdo should do what you need, e.g. :args spec/javascripts/**/*.* :argdo %s/foo/bar/g See this page.