Inspecting the evaluation stack on computation abort
How to find out where an error occurs?
Evaluating string "3*(4+2)" yield int 18 Need help with proof for Dedekind cuts on $\mathbb{Q}^+$ I am working on a proof about Dedekind cuts on the positive rational numbers. I have been stuck for a while on the following point and would appreciate any help.  Given $x\in \mathbb{Q}^+$ such that $x^2&lt;2$, how to find $y\in \mathbb{Q}^+$ such $y&gt;x$ and $y^2&lt;2$? Cardinality of Irrational Numbers I know and I have proved more than once that the set of irrational numbers ($\mathbb{I}$) is uncountable, but now I'm given to solve this problem:   Show that $|\mathbb{I}|=|\mathbb{R}|$,  How can I do that?  Do I need to assume the Continuum Hypothesis in order to that statement to be true?  Thanks My attempt at value initialization is interpreted as a function declaration, and why doesn't A a(()); solve it? Working on a future method to post values to external web service. But since there is a limit of 50 callouts per invocation, I am getting error "Too many future calls : 51". Cases are loaded into salesforce from external ETL in bulk. So is there a way to workaround this error.   Class  public with sharing class caseTrigger {      //method invoked by trigger after insert     public void CaseInsert(List&lt;Case&gt; caseIns){           list&lt;Id&gt; caseIds = new list&lt;id&gt;();             List&lt;Case&gt; caseList = [Select id from case WHERE Id IN :caseIds];                 for(Case c : caseList){                     if(c.Status != 'closed'){                         caseIds.add(c.id);                     }                          if(f.caseId_User.size()&gt;0){PostCases(caseIds);}      }     //postCases (future method)     @future(callout = true)     public static void PostCases(List&lt;Id&gt; Ids){         //prepare Json to post to webservice    } } Okay setting the scene. I have three tables, (Table1, Table2 and DataTable) and I want to insert into Table1 and Table2 using DataTable as source. So for every row in DataTable I want a row in Table1 and Table2, and Table2 needs to have the inserted id (PK) from Table1...  If I were to do this...  INSERT INTO Table1 SELECT A, B, C FROM MyTable INSERT INTO Table2 SELECT IDENTITY_INSERT(), D, E, F FROM MyTable   I'd get the ID of the last inserted record into Table1.  Is a CURSOR or WHILE loop the only ways to do this? On the Bash on Ubuntu on Windows app, I only have   root@localhost:~# ls -a     .bash_history  .bashrc  .profile   How do I access all of the Windows folders like Documents, Downloads, etc.? Case-insensitive attribute-value selector with Jquery The question is pretty straight forward. I can get the exit code of the previous command by using $?. But what exactly is it?  I don't think it is a variable, because you can't have any special characters in the name of variable other than _.  foo?foo=10   will result in the error: foo?foo=10: command not found  So if it is not a variable, what is it? Are there others like it? How to hide quoted text in Lion Mail? In Mail's conversation view, by default, quoted text is hidden and can be shown by clicking "See More from XXX" in the bottom of each message. After clicking that, how can quoted text be hidden again? How does the secondary effect of the Heat Metal spell work? The  spell description states:  If a creature is holding or wearing the object and takes the damage from it, the creature must succeed on a Constitution saving throw or drop the object if it can. If it doesn't drop the object, it has disadvantage on attack rolls and ability checks until the start of your next turn...  I am unsure how this disadvantage mechanic functions as a whole. When do you suffer from it and in what ways (if any) can you end it? For example: What happens if you fail the save but cannot drop the object? Does dropping the object later, on your turn, do anything? What happens if you succeed on the save?  Does dropping the object later, on your turn, do anything? I would like it to be assumed that ; however, heat metal can still force you to drop the weapon. I would also like it to be assumed that . What should the character limit(s) for first/last name inputs be? We want to create input fields for a user's first and last names. What should the minimum and maximum limits be, if any, and why? Remove all files/directories except for one file I have a directory containing a large number of files. I want to delete all files except for file.txt . How do I do this?  There are too many files to remove the unwanted ones individually and their names are too diverse to use * to remove them all except this one file.  Someone suggested using   rm !(file.txt)   But it doesn't work. It returns:  Badly placed ()'s    My OS is Scientific Linux 6.  Any ideas? Installing from source - do I need to keep the extracted tarball directory If I'm installing from source, do I need to keep the extracted tarball directory?  So if I download the git tarball. I then do:  tar -xvzf git.tar.gz   This will create a git.x.x. directory, into which I cd, then run ./configure etc. Once I'm done with this process, and git, or whatever is installed, do I need to keep the original git.x.x extracted directory, or is that just used for compiling the program?  I'm somewhat confused by all the directories, and folders used for programs. Enable ADB and/or change USB connection mode on Galaxy S7 w/ broken screen I'm interested in the exact barrier of $$\ln(n!)= \Theta(n\ln(n))$$  and if it even exists.  This means, there is a $c_1, c_2$ , so that $$\ln(n!) \le  \Theta(n\ln(n) c_1$$  $$\ln(n!) \ge  \Theta(n\ln(n) c_2$$  or  $$0 \le \lim\limits_{n \to \infty}\frac{\ln(n!)}{n\ln(n)} \ge \infty$$  I could use de l'Hospital for the limit fraction, since it's $\frac{\infty}{\infty}$ but the derivate of $\ln(n!)$ causes problems. Also I don't know how I could prove the two statements above or how to prove them wrong. Any help is appreciated. When is assembly faster than C? One of the stated reasons for knowing assembler is that, on occasion, it can be employed to write code that will be more performant than writing that code in a higher-level language, C in particular.  However, I've also heard it stated many times that although that's not entirely false, the cases where assembler can actually be used to generate more performant code are both extremely rare and require expert knowledge of and experience with assembly.    This question doesn't even get into the fact that assembler instructions will be machine-specific and non-portable, or any of the other aspects of assembler.  There are plenty of good reasons for knowing assembly besides this one, of course, but this is meant to be a specific question soliciting examples and data, not an extended discourse on assembler versus higher-level languages.  Can anyone provide some specific examples of cases where assembly will be faster than well-written C code using a modern compiler, and can you support that claim with profiling evidence?  I am pretty confident these cases exist, but I really want to know exactly how esoteric these cases are, since it seems to be a point of some contention. Recurrence Inequality Define sequence ${a_n}$ as follows: $a_1 = \frac {1}{2}, 2ka_k = (2k-3)a_{k-1}.$  Show that for any natural number $n, \sum_{k=1}^{n} a_k &lt;1$ (No calculus is allowed).  I'm really just stuck on the right way to approach this. It is sufficient to show that $\sum_{k=1}^{\infty} a_k &lt;1,$ but this isn't a series I am familiar with. I tried defining a partial sum series $b_n$ such that $b_n = \sum_{k=n}^{\infty} a_k,$ but that didn't help to find a non-trivial relationship. I have a professor at my university who uses content from an un-cited textbook that he has never referenced anywhere, including his green sheet (syllabus), as an additional resource. At least some slides he has used include parts of content that have been re-worded and others that are 100% the same. I noticed this by Googling for textbooks on the material we're studying in class and found that examples given in one that I found were exactly the same as what he has provided.  Would this technically be plagiarism? Should he be given the benefit of the doubt in this situation? I am new to Force.com and trying to learn some concepts.  Currently I am using Single Email Message to send my emails, but I need to change that to mass email, but I don't quite understand how to do that.   I have also created a Visualforce email template, which I would like to use, but it doesn't seem to work.   It would be great if someone could help me out.  //email_disease_map contains pairs of email address and disease ID for (Id id : email_disease_map.keySet())   {     Messaging.SingleEmailMessage mail = new Messaging.SingleEmailMessage();     String[] defaultAddresses = new String[] {'id@test.com'};      List&lt;String&gt; toAddresses = new List &lt;String&gt; (email_disease_map.get(id));      if (!toAddresses.isEmpty())       {         //set addresses for email to be sent         mail.setToAddresses(defaultAddresses);         mail.setCcAddresses(toAddresses);         mail.setTemplateId(Notification);         //set up remaining email         mail.setReplyTo('test@mail.com');          mail.setSenderDisplayName('Ms Test');          Messaging.sendEmail(new Messaging.SingleEmailMessage[] { mail });       }  }