how to put the array of pointers into a vector
How do you copy the contents of an array to a std::vector in C++ without looping?
X,Y,Z missing in F3 I installed Drush for the first time (so it may be a configuration error) and I'm trying to update to the latest core version of Drupal.  Drush is giving me this error - I'm on an OSX box.  dev5:clientnamedirectory my.name$ drush pm-update projects drupal-7.25 &lt;h1&gt;Additional uncaught exception thrown while handling exception.&lt;/h1&gt;  &lt;h2&gt;Original&lt;/h2&gt;&lt;p&gt;PDOException: SQLSTATE[HY000] [2002] No such file or directory in drupal_get_installed_schema_version() (line 155 of /Users/my.name/Sites/proface/includes/install.inc).&lt;/p&gt;  &lt;h2&gt;Additional&lt;/h2&gt;  &lt;p&gt;PDOException: SQLSTATE[HY000] [2002] No such file or directory in system_list() (line 165 of /Users/my.name/Sites/clientnamedirectory/includes/module.inc).&lt;/p&gt;&lt;hr /&gt;  Drush command terminated abnormally due to an unrecoverable error. As a  developer I'm used to running through constructors:    class Test {     public Test() {         DoSomething();     }      public Test(int count) : this() {         DoSomethingWithCount(count);     }      public Test(int count, string name) : this(count) {         DoSomethingWithName(name);     } }   Is there a way to do this in C++?  I tried calling the Class name and using the 'this' keyword, but both fail. Why is defragmentation unnecessary? Create a tar archive split into blocks of a maximum size Equation numbering problems in AMSMath environments with \pause What are the different ways I can use to upgrade Ubuntu from one release to another? What's the difference between a Long Term Support Release and a Normal Release? What are the differences between an Ubuntu Long Term Support release (LTS) and a normal release? Dynamically Adding/Removing CSS in Nested Div What is the difference between const_iterator and non-const iterator in the C++ STL? What is the difference between a const_iterator and an iterator and where would you use one over the other? Installation problem QGIS I do not manage to install QGIS on my windows 10 machine using the osgeo4w installer.  During the installation I get this message:   At the end of the installation I get this message:   And when I subsequently try to run QGIS, I receive this message:    Similar issue can be found in various fora, but none of them provides a conluding answer or did help me to solve the problem.  Any propositions? Fatal Error: Allowed Memory Size of 134217728 Bytes Exhausted (CodeIgniter + XML-RPC) I have a bunch of client point of sale (POS) systems that periodically send new sales data to one centralized database, which stores the data into one big database for report generation.  The client POS is based on PHPPOS, and I have implemented a module that uses the standard XML-RPC library to send sales data to the service. The server system is built on CodeIgniter, and uses the XML-RPC and XML-RPCS libraries for the webservice component. Whenever I send a lot of sales data (as little as 50 rows from the sales table, and individual rows from sales_items pertaining to each item within the sale) I get the following error:  Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 54 bytes)   128M is the default value in php.ini, but I assume that is a huge number to break. In fact, I have even tried setting this value to 1024M, and all it does is take a longer time to error out.  As for steps I've taken, I've tried disabling all processing on the server-side, and have rigged it to return a canned response regardless of the input. However, I believe the problem lies in the actual sending of the data. I've even tried disabling the maximum script execution time for PHP, and it still errors out. Last digits, numbers Can anyone please help me?  1) Find the last digit of $7^{12345}$   2) Find the last 2 digits of $3^{3^{2014}}$.  Attempt: 1)  By just setting the powers of $7$ we have $7^1 = 7$, $7^2=49$, $7^3=343$, $7^4 = 2401$, $7^5 = 16807$, $7^6 = 117649$, $\dots$  After the power of $4$, the last digits will repeat. Then by noticing the pattern the digits will end in $7,9,3$ and $1$.  Then we can divide the exponent $(12345)$ by $4$ since this is the cycle that makes it repeat. Then $12345 : 4$ has remainder $1$. So $7^1 = 7$ is the unit digit to $7^{12345}$.   So the last digit is $7$.   I know how to do it like this, the problem does not state how to find the last digit, but I know it has something do do with Euler's theorem.  for part $2$) I don't know how to start. Can anyone please help me?   Thank you for the help. Is there a built-in that removes duplicates from list in Python, whilst preserving order? I know that I can use a set to remove duplicates, but that destroys the original order. I also know that I can roll my own like this:  def uniq(input):   output = []   for x in input:     if x not in output:       output.append(x)   return output   (Thanks to  for that .)  But I'd like to avail myself of a built-in or a more Pythonic idiom if possible.  Related question: Misplaced/Overlapping Navigation Item Text on iOS 10 The bug displayed in the attached screenshot occurs consistently for me while running the developer beta of iOS 10 using v1.5.2 of the Stack Exchange app on an iPhone 6.  I was able to recreate this by simply tapping on any question or answer in my feed with a long title. This doesn't appear to be a bug with iOS 10 itself since I haven't seen it in other apps, but I could be wrong. I want to store courseworks marks of n courseworks into n variables, such as cw1 and cw2 etc. Using variable variables how can I come with cw1, cw2 etc.   How can I dynamically create variables? I am on Ubuntu and I have forgotten the password for my Gnome Keyring (yes, stupid me, I know). Any way I can get it back? I have already looked at , but it says it's not possible if my home directory is encrypted and unfortunately my home directory is encrypted. Algebraic proof that if $a>0$ then $1+a^9 \leq \frac{1}{a}+a^{10} $ Prove that if $a&gt;0$ then $1+a^9 \leq \frac{1}{a}+a^{10} $.   Using the fact that $a \gt 0$, multiply by $a$ on both sides and get everything to one side we have; $a^{11}-a^{10}-a+1 \geq 0$. By factoring $(a^{10}-1)(a-1) \geq 0 $.  I am not sure how to proceed any further. Summer in Saint Helena The Winter Bash site is located at http://winterba.sh/.  Only one problem:   . Saint Helena is in the Southern Hemisphere. It's Summer in Saint Helena.   So shouldn't it be the Summer Bash? Don't forget our Aussie/Kiwi/South African/Southern Brazilian/Argentine/Uruguayan/Zimbabwean/Swazi/Tokelauan/Tuvaluan/Pitcairn Islander/ friends! how to extract multiple zipped and rar files recursively? I have a folder ExampleFolder which contains many zipped folders. These zipped folders also contains multiple zipped folders. How to go through ExampleFolder and extract all of its zipped folders recursively?   Note that ExampleFolder itself, is not zipped, it's just a normal folder  Okay now I know what's happening Rinzwind and nux answers are both correct (except that I have to keep pressing Y or A forever)  But it's seems that some of the zipped files, contained zipped files and rar files as well, the rar files will not be extracted by   while [ "`find . -type f -name '*.zip' | wc -l`" -gt 0 ]; do find -type f -name "*.zip" -exec unzip -- '{}' \; -exec rm -- '{}' \;; done    or whatever  Edit 2 Some files are named .r00 and r01, .r02 up to r14, they are rar files, but not .rar