Capturing Multiple Bracketed Sequences with Regex, Python 3 I'm using Python 3 and working with title strings that have a bracketed tag with a pair of names separated by a +. Like this: [John+Alice] A title here.  I've been using the regex expression re.search('\[(.+)\]', title) to get the tag [John+Alice], which is fine, but it's a problem when encountering a title with more than one bracketed tag:  [John+Alice] [Hayley + Serene] Another title.   That gives me [John+Alice] [Hayley + Serene], when I would prefer [John+Alice] and [Hayley + Serene].   How can I modify the regex to give me all bracketed tags that have + between [ and ]? Thanks.
My regex is matching too much. How do I make it stop? I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?
In SQL Server 2005, are there any disadvantages to making all character fields nvarchar(MAX) rather than specifying a length explicitly, e.g. nvarchar(255)? (Apart from the obvious one that you aren't able to limit the field length at the database level) How rare are magic items and how many should I be handing out? How to make a package manager wait if another instance of APT is running? I have seen many softwares such as Update Manager and Synaptic Package Manager, they wait if some other program is using the /var/lib/dpkg/lock and is locked. How can we do this through the Terminal? I saw apt-get's manual but didn't find anything useful. Can a union be initialized in the declaration? I have set up my site with sample pages and data (lorem ipsum, etc..) and Google has crawled these pages. I deleted all these pages and actually added real content but in webmaster tools, i still get a lot of 404 errors Google trying to crawl these pages. I have set them to "mark as resolved" but some pages still come back as 404.   Furthermore, I have a lot of these sample pages still listed when i do a search of my site on Google. How to remove them. I think these irrelevant pages are hurting my rating.   I actually wanted to erase all these pages and start getting my site being being indexed as a new one but I read it's not possible? (I have submitted a sitemap and used "Fetch as Google.") In  it states that      [xkcd] means calling the Ackermann function with Graham's number as the arguments just to horrify mathematicians.   $A(g_{64},g_{64})$  In  it states that      Even simply making $g_{65}$ dwarfs the number $A( A(g_{64}, g_{64}), A(g_{64}, g_{64}))$ into insignificance.   So:  Is $g_{65}$ greater than $A(g_{64}, g_{64})$?  And is it greater than $A( A(g_{64}, g_{64}), A(g_{64}, g_{64}))$? How is it possible that quantum phenomenons (e.g. superposition) are possible when all quantum particles are being constantly observed? I don't understand how quantum mechanics (and therefore also quantum computers) can work  given that while we work with quantum states, particles that this quantum state consist of cannot be observed, which is the most fundamental requirement.  If I am not mistaken, by "observed" we mean interaction with any other particle (photon, gluon, electron or whatever else). So my very important questions:   Aren't the particles this quantum state consists of interacting with each other? Why doesn't that cause the state to collapse? Aren't all particles in the universe interacting with Higgs field and gravitons etc? Why doesn't that cause every quantum state to collapse?   I feel there is something very fundamental in quantum mechanics that I am not aware of, hence I would be very pleased to have these questions answered. Should moderators be allowed to decline flags on their own comments? Forward vs Forwards The default in lyx is to have   I. First part (roman number)   Section 1   1.1 Subsection 1  and I'd like to have   First part (arabic number)   1.1 Section 1  1.1.1 Subsection 1  etc.   Any suggestion? Thanks a lot in advance! Retrieving n rows per group I often need to select a number of rows from each group in a result set.  For example, I might want to list the 'n' highest or lowest recent order values per customer.  In more complex cases, the number of rows to list might vary per group (defined by an attribute of the grouping/parent record). This part is definitely optional/for extra credit and not intended to dissuade people from answering.  What are the main options for solving these types of problems in SQL Server 2005 and later? What are the main advantages and disadvantages of each method?  AdventureWorks examples (for clarity, optional)   List the five most recent recent transaction dates and IDs from the TransactionHistory table, for each product that starts with a letter from M to R inclusive. Same again, but with n history lines per product, where n is five times the DaysToManufacture Product attribute. Same, for the special case where exactly one history line per product is required (the single most recent entry by TransactionDate, tie-break on TransactionID. Virtualbox: OS cannot use the new extended disk space (.vdi) Render result is completely blank A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [ How to determine if .NET code is running in an ASP.NET process? I have an instance of a general purpose class that will be executed both under ASP.NET and a stand alone program. This code is sensative to the process where it is being run - that is, there are certin methods that should not called if running under ASP.NET. How do you determine if the code is executing in an ASP.NET process?  The solution I am currently using is answered below.    I wish someone would add a comment as to why this question has gotten downvoted and/or propose a better way to ask it! I can only assume at least some folks have looked at the question and said "what an idiot, ASP.NET code is .NET code". Is it a bad practice to catch Throwable? What is a single word for a person who, as a habit, exaggerates a lot when relating information?   So for example, they relate something that happened but exaggerate so much that they are including clear falsehood and they are well known for doing that. I would like to show that   $$ \int_{0}^{1} \frac{x-1}{\ln(x)} \mathrm dx=\ln2 $$  What annoys me is that $ x-1 $ is the numerator so the geometric power series is useless.  Any idea? Can a class overload methods that also exist in the publicly inherited interface? It seems like this is unambiguous and useful, but compilers (VC, Intel, GCC) all complain, at least by my construction. Below is a toy example. The inherited rebound() function has two clear overloads, yet this will not compile.  If you rename the rebound() method in either class, it works fine, but if they share the same member function name (even though they're overloaded with different argument types!) you get a fatal error of "too few arguments to function call."  The workaround is trivial (I'll just rename the methods) but I'm just trying to understand if this is a C++ restriction (and why it would be).   #include  class Bound { public:   Bound() : x0(0.0), x1(0.0) {};   Bound(double x) : x0(x), x1(x) {};   double width() const {return x1-x0;}   void rebound(const Bound *a, const Bound *b); private:   double x0, x1; };  void Bound::rebound(const Bound *a, const Bound *b) {   if (a && b) {     x0=std::min(a->x0, b->x0);     x1=std::max(a->x1, b->x1);   } }  class Node : public Bound { public:   Node(double x) : Bound(x), left(0), right(0) {};   Node(Node *a, Node *b) : left(a), right(b) {rebound();}   void rebound() { rebound(left, right); } private:   Node *left;   Node *right; };   int main() {   Node A(1.0);   Node B(2.0);   Node C(&A, &B); } How can I assign a Func conditionally between lambdas using the conditional ternary operator? Generally, when using the conditional operator, here's the syntax:  int x = 6; int y = x == 6 ? 5 : 9;   Nothing fancy, pretty straight forward.  Now, let's try to use this when assigning a Lambda to a Func type. Let me explain:  Func&lt;Order, bool&gt; predicate = id == null     ? p =&gt; p.EmployeeID == null     : p =&gt; p.EmployeeID == id;   That's the same syntax, and should work? Right? For some reason that doesn't. The compiler gives this nice cryptic message:     Error  1   Type of conditional expression cannot be determined because there is no implicit conversion between 'lambda expression' and 'lambda expression'   I then went ahead and changed the syntax and this way it did work:  Func&lt;Order, bool&gt; predicate = id == null     ? predicate = p =&gt; p.EmployeeID == null     : predicate = p =&gt; p.EmployeeID == id;   I'm just curious as to why it doesn't work the first way?  (Side note: I ended up not needing this code, as I found out that when comparing an int value against null, you just use object.Equals) Why is "high" pronounced "hiy" but is not spelled that way?