When Starting at 3rd Level as a Sorcerer, Can I Have Four 2nd Level Spells?
How do you choose Spells Known when creating a new character above 1st level?
Suppose I have a python object x and a string s, how do I set the attribute s on x? So:  &gt;&gt;&gt; x = SomeObject() &gt;&gt;&gt; attr = 'myAttr' &gt;&gt;&gt; # magic goes here &gt;&gt;&gt; x.myAttr 'magic'   What's the magic? The goal of this, incidentally, is to cache calls to x.__getattr__(). Namespaces and Operator Overloading in C++ When authoring a library in a particular namespace, it's often convenient to provide overloaded operators for the classes in that namespace.  It seems (at least with g++) that the overloaded operators can be implemented either in the library's namespace:  namespace Lib { class A { };  A operator+(const A&amp;, const A&amp;); } // namespace Lib   or the global namespace  namespace Lib { class A { }; } // namespace Lib  Lib::A operator+(const Lib::A&amp;, const Lib::A&amp;);   From my testing, they both seem to work fine.  Is there any practical difference between these two options?  Is either approach better? Combine the first two commits of a Git repository? Suppose you have a history containing the three commits A, B and C:  A-B-C   I would like to combine the two commits A and B to one commit AB:  AB-C   I tried  git rebase -i A   which opens up my editor with the following contents:  pick e97a17b B pick asd314f C   I change this to  squash e97a17b B pick asd314f C   Then Git 1.6.0.4 says:  Cannot 'squash' without a previous commit   Is there a way or is this just impossible? Improving "demonstrate a minimal understanding" close reason Note: the eventual outcome of this discussion involved dropping this particular off-topic reason, along with other changes. See:  &nbsp; &mdash;Shog     I was using the reason "demonstrate a minimal understanding" myself quite frequently, but the more I review, the more I have doubts about it and I think this reason can either be dropped entirely or at least rephrased, so I started to use "problems with code you've written must describe the specific problem" instead:     Questions asking for code must demonstrate a minimal understanding of the problem being solved.   So the poster has posted some description, maybe even a snippet of code and in his mind that already proves that he has that minimal understanding required. After all he described the problem and what he tried to solve. So telling him that he lacks that understanding is rather rude, and from the posters point of view doesn't even apply. What both version of the reason not emphasize is that a description of a problem is not various versions of     it doesn't work   but that we rather mean really specific details (see below). I can often see in the reopen review queue that the "improved" version just includes a more verbatim description, while what usually would be expected is some specific error message, a trace or a log, or whatever applies.  Then it continues with:     Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist   comparing it to:     problems with code you've written must describe the specific problem — and include valid code to reproduce it — in the question itself. See SSCCE.org for guidance.   Which says essentially the same, only in more detail.   So the "minimum understanding" reason is IMO a more rude version of the reason telling the user that an SSCCE is missing.  The intent of giving this reason is to tell the user that he needs to give exact details to be able to help him, so IMO a checklist would be much better. Something like:     Your question was closed because it may not provide enough details. Things you can do to improve your question to get an answer include:         Format the code in a way that makes it readable and easily understandable.   Provide the smallest working sample of code demonstrating the problem (link to SSCCE)   Include your input and output.   If applicable provide logs (i.e. Android debugging log, stack trace, etc.).   If applicable provide the exact error messages (compiler, etc.).      And something like this should be best included already in the banner that appears when a question is closed instead of being hidden in some pages you often enough have to actively looking for.  It might be helpful to adjust this, based on the tags or close reason, as I realize that I'm more focused on the programming area, and the above list may not apply to other areas of SO.  Update  Another thing I forgot to mention (but wanted to) is this:     Questions asking for code   Is IMO essentially an invitation of the type of questions     I have a problem, can you provide the solution? (with an optional please)   while     Questions concerning problems with code you've written   puts at least some emphasis on the fact that the poster has to put some effort himself in trying to solve the problem by providing the code which he used to attempt the solution. For $a, b \geq 0$, $0 < x < 1$, show $(a+b)^x \leq a^x + b^x$ Let $a, b$ be positive real numbers. Let $0 &lt; x &lt; 1$. Show that  $(a+b)^x &lt; a^x + b^x$.  The function $f(x) = (a+b)^x -a^x - b^x$ has $f(0) = -1$, $f(1) = 0$ and it seems to be an increasing function. But I am unable to show that it is increasing function. How to check if a thread is sleeping? Windows 7's PATH and environment variables are corrupted "I couldn't but laugh" - correct or not? ASP.NET MVC Default Project Structure and the Scripts Folder One single command to update everything in Ubuntu? How to execute hostapd command in cli? I always got error. When i execute hostapd command. I was changed everything in my hostapd.conf file but i got error.  hostapd_cli wps_pbc Failed to connect to hostapd - wpa_ctrl_open: No such file or directory  Can anyone help to me.? If $f$ is continuous and $\,f\big(\frac{1}2(x+y)\big) \le \frac{1}{2}\big(\,f(x)+f(y)\big)$, then $f$ is convex Let $\,\,f :\mathbb R \to \mathbb R$ be a continuous function such that $$ f\Big(\dfrac{x+y}2\Big) \le \dfrac{1}{2}\big(\,f(x)+f(y)\big) ,\,\, \text{for all}\,\, x,y \in \mathbb R, $$ then  how do we prove that $f$ is convex that is $$ f\big(tx+(1-t)y\big)\le tf(x)+(1-t)f(y) , \forall x,y \in \mathbb R , t\in (0,1)? $$ I can prove it for dyadic rational's $t=\dfrac k {2^n}$ and then argue by continuity ; but I would like a more direct proof . Thanks in Advance Rename all the files within a folder with prefix “Unix_” Rename all the files within a folder with prefix “Unix_” i.e. suppose a folder has two files a.txt and b.pdf than they both should be renamed from a single command to Unix_a.txt and Unix_b.pdf No such file or directory? But the file exists! I've downloaded a game (Shank) but the bin file doesn't run. The error that is shown when I try to launch the executable is:  bash: ./shank-linux-120720110-1-bin: No such file or directory I have recently started reading and watching Naruto. I was wondering in what aspect does the clones made by different techniques differ? They all have the same potential and capabilities. How to wrap lines correctly inside algorithmic I am having problems displaying algorithms. The wrapping is really ugly and I can't, for the life of me, find a fix that doesn't involve manually tweaking the hell out of everything, to the point that I might as well scrap the crappy algorithm packages and write everything out in TeX.  Is there any way to properly indent the following  \documentclass{article} \usepackage{algorithm} \usepackage{algpseudocode} \begin{document} \begin{algorithm}    \caption{My pseudo code.} \begin{algorithmic}[1]    \While{this line is sooooooooooo long and boring and too much for algorithmic to handle}       \State look at this state, this state is just too long for algorithmic to display it properly        \While{again this line is sooooooooooo long and boring and too much for algorithmic too handle}          \State look at this state again, this state is just too long for algorithmic to handle, I'm just going to switch to Word       \EndWhile    \EndWhile \end{algorithmic} \end{algorithm} \end{document}​     so that the output is similar to Solving $x^{x^x}=c$ with Lambert's W function VirtualBox error kernel headers I'm with Ubuntu 15.04 and I'm trying to create an emulator (genymotion), but when run virtualbox, i got the error:     Stopping VirtualBox kernel modules ...done.   Uninstalling old VirtualBox DKMS kernel modules ...done.   Trying to register the VirtualBox kernel modules using DKMSError! Your kernel headers for kernel 3.16.0-30-generic cannot be found.   Please install the linux-headers-3.16.0-30-generic package,   or use the --kernelsourcedir option to tell DKMS where it's located    ...failed!     (Failed, trying without DKMS)   Recompiling VirtualBox kernel modules ...failed!     (Look at /var/log/vbox-install.log to find out what went wrong)   I performed   uname -a   And the result is:     Linux douglas 3.16.0-30-generic #40-Ubuntu SMP Mon Jan 12 22:06:37 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux   Someone help me?Already I uninstalled and installed again. Is Einstein's Special Relativity completely inclusive of Newton's 3 laws of motion? Relativity has always been explained to me (in books I've read, etc) as a superset of newton's laws - that is; it encapsulates all of Newton's mechanics in addition to other effects (observer effect, time dilation, space-time geometry, etc).   I can kind of imagine 2 of Newton's 3 laws of motion to be incapsulated within Einstein's Special Relativity, but the one about "for every action there is an equal and opposite reaction", I'm struggling to find a place for that within Special Relativity.   Does this sit outside Special Relativity's explanatory power or is it inferred within somehow? Simple way to see a list of installed iOS apps with their storage space size? The storage on my iPhone is nearly full. Most of the space is used by apps. I'd like to see which apps consume the most space on my device.  Is there a way to get a list of the apps with their corresponding used space? By "used space I mean the installation size (bonus for added user data).