I'm trying to stop the foreach when $counter reaches 5 , but i can't , i've tried to change the &quot;break;&quot; place , my try/catch inside the if,  but with no success, i keep getting 103 games(image) and I only want 5 .........     $leagues= $api-&gt;getLeagueEntries(&quot;RANKED_SOLO_5x5&quot;, &quot;Gold&quot;, 'I');           $counter = 0;           foreach ($leagues as $t=&gt; $op) {          if (++$counter &lt; 5) {                      }                 try {                     $account_id = $api-&gt;getSummoner($op-&gt;summonerId);                     $date = time();                     $ab = $api-&gt;getMatchlistByAccount($account_id-&gt;accountId,  &quot;420&quot;, null, null, $date, NULL, null, null, null);                               echo &quot;&lt;pre&gt;&quot; ; var_dump($ab);   echo &quot;&lt;pre&gt;&quot; ;                       break;                 } catch (Exception $e) { }             }
I have a loop that is doing some error checking in my PHP code. Originally it looked something like this...  foreach($results as $result) {     if (!$condition) {         $halt = true;         ErrorHandler::addErrorToStack('Unexpected result.');     }      doSomething();  }  if (!$halt) {     // do what I want cos I know there was no error }   This works all well and good, but it is still looping through despite after one error it needn't. Is there a way to escape the loop?
Shape of the universe? What is the exact shape of the universe? I know of the balloon analogy, and the bread with raisins in it. These clarify some points, like how the universe can have no centre, and how it can expand equally everywhere in all directions. But they also raise some questions, like if you are on the surface of a balloon and travel in 1 direction, you will eventually return to your starting point, is it possible our universe have this feature?  If it has, or had, would this be a symmetry of sorts ($\psi(x)=\psi(x+R)$), and as such have a conserved quantity associated with it (by Noether)? Assuming "small curled up dimensions" wouldn't these dimensions have this type of symmetry, what are the associated conserved quantities? Is it known exactly what the geometrical shape of the universe is? (on a large scale) (I am not talking about only the observable universe). How does one define the "size" of a dimension, is this scale only applicable to curled up ones? Is it possible to describe to a layman the shape of the universe without resorting to inept analogies? Should you declare methods using overloads or optional parameters in C# 4.0? I was watching , and it got me thinking about when optional parameters are available in C# what is going to be the recommended way to declare methods that do not need all parameters specified?  For example something like the FileStream class has about fifteen different constructors which can be divided into logical 'families' e.g. the ones below from a string, the ones from an IntPtr and the ones from a SafeFileHandle.  FileStream(string,FileMode); FileStream(string,FileMode,FileAccess); FileStream(string,FileMode,FileAccess,FileShare); FileStream(string,FileMode,FileAccess,FileShare,int); FileStream(string,FileMode,FileAccess,FileShare,int,bool);   It seems to me that this type of pattern could be simplified by having three constructors instead, and using optional parameters for the ones that can be defaulted, which would make the different families of constructors more distinct [note: I know this change will not be made in the BCL, I'm talking hypothetically for this type of situation].  What do you think? From C# 4.0 will it make more sense to make closely related groups of constructors and methods a single method with optional parameters, or is there a good reason to stick with the traditional many-overload mechanism? How to fix "Notification access is not available" on Android Go? at least one element fixed by all the group $G$ is a p-group and $S$ is a set that $G$ acts on. p does not divide $|S|$. Why is there at least one element $a\in S$ such that $|O(a)|=1$, or in other words, $G_a=G$?  I tried to ask this question yesterday but did not word it right, so the one who helped me claim that this part is clearly true and I really do not understand why, and I couldn't get a straight answer for the past day.   Any of you are welcome to vote to delete this question (after some discussion with me about the problem I hope), but I just really want to know why it is "clearly true, because I still couldn't reason it right. How do I use one shape to delete a portion of another shape? I have created an arrow shape (rightmost in image), from which I wish to cut out the majority so that only two thin sides remain. The most accurate way to do this would be to duplicate the shape and to somehow use the duplicate (leftmost in image) to remove the chunk that I no longer desire from the original. I am not sure what to do after the duplication, however, or if this method is even possible? Is there a better one? How can I switch a 32-bit installation to a 64-bit one? I've got a 32-bit Ubuntu installation running on 64-bit hardware. Now that , I would like to switch to 64-bit without having to reinstall the OS.  This is one of the :  Shawn installed his system using the 32-bit version of Ubuntu, but his hardware is 64-bit and he wants to switch over. He manually installs the amd64 versions of dpkg and apt, replacing the i386 versions and changing which architecture is used as the default; then he installs the amd64 ubuntu-minimal package; then he installs the amd64 ubuntu-desktop package. Over time the remaining i386 packages are replaced automatically on upgrade.  However, when trying to follow the instructions in there, I cannot find any 64-bit version of dpkg or apt.  Did this user story got implemented in a different way in the final spec, or do I need to do something differently?  In short, how can I switch my 32-bit installation to 64-bit? Which PHP function can return the current date/time? Limit of ${a_n}^{1/n}$ is equal to $\lim_{n\to\infty} a_{n+1}/a_n$ Today my lecturer put up on the board that:  If $\lim\limits_{n\to\infty}\frac{a_{n+1}}{a_n}$ exists and $a_n&gt;0$ then   $\displaystyle \limsup\limits_{n\to\infty}\left(a_n^{\frac{1}{n}}\right)=\lim_{n\to\infty}\frac{a_{n+1}}{a_n}$  however I am not sure why this is true, can somebody give me a hint or something as to how to go about proving this.  thanks for any help using gb4e keeping interlinear glosses together on the same page I am using gb4e for several hundred interlinear glosses in my dissertation. Several of the examples span more than one page, that is, the vernacular and gloss will be on one page, while the free translation appears at the top of the next page.   How can I keep all three elements together on the same page? I often have subexamples (a, b, c) that don't need to stay together. That is, 1a can be on one page, and 1b on the next, as long as vernacular-gloss-free translation for each subpart stay together.  In the MWE below, the free translation is at the top of page 2, while the vernacular and gloss are at the bottom of page 1.  \documentclass[11pt,letterpaper]{article} \usepackage{lipsum} \usepackage{gb4e} \noautomath \begin{document} \lipsum[1-4] \begin{exe}     \ex \gll wuz x̃ũch it-ak xohish-em\\              1\textsc{sg.prn} bread eat-\textsc{inf} want.\textsc{prs}-1\textsc{sg}\\         \glt `I want to eat bread.'  \end{exe} \end{document}   A solution was proposed to a similar question (), but it requires me to manually look for what could be dozens of orphans throughout my dissertation (and doesn't work when applied to my example, since it still strands the FT). I would prefer a more elegant solution that takes care of the problem automatically. Differences among "It feels...", "It looks...", and "It seems..." JQuery Selector for dynamic id How many connected components does $\mathrm{GL}_n(\mathbb R)$ have? Started new job. Rollover previous employer 401k to new 401k, IRA or Roth IRA? I recently started a new job and have a 401k from my previous employer that I don't know what to do with.  Should I roll it into my new employer's 401k, a traditional IRA or a Roth IRA? Given a Lie group, how are you meant to find its Lie algebra?  The Lie algebra of a Lie group is the set of all the left invariant vector fields, but how would you determine them?  My group is the set of all affine maps $x \rightarrow A.x+v$ from $R^n$ to $R^n$ under function composition. Prove that $\sum_{r=1}^nr(r+1)=\frac{n(n+1)(n+2)}{3}$ using induction $$\sum_{r=1}^nr(r+1)=\frac{n(n+1)(n+2)}{3}$$  could you help me with how exactly I work this out? When should one use "should" and when should one use "must"? I tend to use should when it's a suggestion I don't have a strong opinion on, i.e. it could be done in many other ways than the one I'm suggesting and it can still happen.     You should stop by that gas station to go to the bathroom.   On the other hand, I usually use must for things that have to happen in a certain way; any other way would make that thing not to happen. The problem is that some people find this usage harsh, as they receive it like if I'm giving them an order.      You must cross the street to get to that store.   To me, it's just a depiction of reality, not an order. But I'm neither a native speaker nor a regular person. :-)  So, what's the proper use for must and should? Does this use differ among the English dialects? Alignment issue for the last modified information in the "Top Questions" page In the  (homepage), the asked/modified X mins ago text was left-aligned next to the tags. Previously the text was right-aligned. Seems some alignment issue introduced on that page recently. Screenshot for reference:      Configuration Version     Operating System Windows 10 Pro   Mozilla Firefox 89.0 (64-bit)   Google Chrome 91.0.4472.101 (Official Build) (64-bit)     Update: I see the same alignment issue in all other Stack Exchange site's &quot;Top Questions&quot; page too. With an  of archive/compression file formats, is there a single free/open-source command line tool to rule them all? Perhaps something with a consistent / unified set of flags? (note my  friendly )  I once run into a set of aliases meant to largely simplify the task of compressing/de-compressing files with bindings to tar and other utils, but I can't find this anymore.  Update: How can I configure something like atool to not use unzip to extract zip files (which apparently can't handle files larger than 4GB) and to use gunzip instead?  $ aunpack large_file.zip error:  Zip file too big (greater than 4294959102 bytes) Archive:  large_file.zip warning [large_file.zip]:  1491344848 extra bytes at beginning or within zipfile   (attempting to process anyway) error [large_file.zip]:  start of central directory not found;   zipfile corrupt.   (please check that you have transferred or created the zipfile in the   appropriate BINARY mode and that you have compiled UnZip properly) aunpack: unzip ...: non-zero return-code So, through typing several commands I've found that there's not only ls, but l and la too. There doesn't appear to be any man entries on Ubuntu 12.14. They all appear to do similar things with minor differences:  $ ls app        config     CONTRIBUTING.md  doc       Gemfile       Guardfile  LICENSE  MAINTENANCE.md  Procfile  Rakefile   script  tmp     VERSION CHANGELOG  config.ru  db               features  Gemfile.lock  lib        log      PROCESS.md      public    README.md  spec    vendor $ la app      CHANGELOG  config.ru        db   features  Gemfile       .git        Guardfile  LICENSE  MAINTENANCE.md  Procfile  Rakefile   .rspec  .secret     spec  .travis.yml  VERSION .bundle  config     CONTRIBUTING.md  doc  .foreman  Gemfile.lock  .gitignore  lib        log      PROCESS.md      public    README.md  script  .simplecov  tmp   vendor $ l app/       config/    CONTRIBUTING.md  doc/       Gemfile       Guardfile  LICENSE  MAINTENANCE.md  Procfile  Rakefile   script/  tmp/     VERSION CHANGELOG  config.ru  db/              features/  Gemfile.lock  lib/       log/     PROCESS.md      public/   README.md  spec/    vendor/   Just as a bit of trivia, are there more of these and what do they do? Is here any place to find this out? Unfortunately, google searching these commands gets ignored because they're so short. Get on what tile has mouse clicked I am writing a chess game using Java and Swing, And I wanted to get the tile position on which a mouse clicked. I searched through internet, but all of them were really off, and never accurate. When I clicked on a tile's first half, it said it was tile 1, but on the second half, it said it was tile 2, but it was still tile 1. So I was wondering, how can I do it? My tile size is (75, 75) This is the code I've written for tileX: Math.floor((double)evt.getX() / 75), and this is the code I've written for tileY: Math.floor((double)evt.getY() / 75). Code for drawing: ImageIcon l_winter = new ImageIcon(&quot;/Users/user/NetBeansProjects/chess/src/b/bibe/assets/winter/light.gif&quot;);         ImageIcon d_winter = new ImageIcon(&quot;/Users/user/NetBeansProjects/chess/src/b/bibe/assets/winter/dark.gif&quot;);         ImageIcon l_wood = new ImageIcon(&quot;/Users/user/NetBeansProjects/chess/src/b/bibe/assets/wood/light.png&quot;);         ImageIcon d_wood = new ImageIcon(&quot;/Users/user/NetBeansProjects/chess/src/b/bibe/assets/wood/dark.png&quot;);         String theme = th;         int color = 0;         for (int i = 0; i &lt; 600; i = i + 75) {             for (int j = 0; j &lt; 600; j = j + 75) {                 JLabel panel = new JLabel();                 panel.setText(null);                 panel.setSize(75, 75);                 if (color == 0) {                     if (theme.equals(&quot;wood&quot;)) {                         panel.setIcon(l_wood);                     } else if (theme.equals(&quot;winter&quot;)) {                         panel.setIcon(l_winter);                     } else {                         panel.setText(&quot;notexture&quot;);                     }                     //panel.setBackground(new Color(white[0], white[1], white[2]));                     color = 1;                 } else {                     if (theme.equals(&quot;wood&quot;)) {                         panel.setIcon(d_wood);                     } else if (theme.equals(&quot;winter&quot;)) {                         panel.setIcon(d_winter);                     } else {                         panel.setText(&quot;notexture&quot;);                     }                     //panel.setBackground(new Color(black[0], black[1], black[2]));                     color = 0;                 }                 panel.setLocation(j, i);                 getContentPane().add(panel);             }         if (color == 0) {             color = 1;         } else {                color = 0;             }         }