I am using Drupal 7 and drush 7.4.0. How do I handle array variables with drush?  For example, I have a variable, social_sharing, for which  drush vget social_sharing    Produces:  facebook: facebook google_plus: google_plus linkedin: linkedin twitter: twitter pininterest: pininterest   Using a drush command,   How can I get the value of only facebook using drush vget? How can I delete one specific variable? for example if I want to remove google_plus from the list using drush vdel?
I would like to configure a module () settings with drush. This is the variable:  addtoany_nodetypes: Array (     [about_us] =&gt; about_us     [contact] =&gt; contact     [page] =&gt; page     [legal] =&gt; 0     [webform] =&gt; 0 )   So that, for instance:  [page] =&gt; page [legal] =&gt; 0   becomes  [page] =&gt; 0 [legal] =&gt; legal   But I am rather new at drush and I am at a complete loss. Thanks for your time.
If no spell can reawaken the dead, how did the resurrection stone work? Dumbledore himself said that no spell can reawaken the dead. Isn't that the main objective of the resurrection stone? If one can't reawaken the dead then what is the use of the stone? Surely then one of the Hallows is flawed? A No-Nonsense Introduction to Quantum Field Theory I found Sean Carroll's "A No Nonsense Introduction to General Relativity" (about page .  pdf ), a 24-page overview of the topic, very helpful for beginning study.  It all got me over the hump of learning the meaning of various terms associated with GR, most of which I had heard before without understanding.  It also outlined the most important examples.  Is there a similar document for quantum field theory, which presents the main equations, briefly describes the main ideas, and summarizes the most important applications and results so that the reader can feel the lay of the land before studying in depth? Twisted serialport dataReceived() provides fragmented data I have attempted a proof of this, but upon looking at my notes, I feel it might be incorrect: it is noticeably simpler than the one in my notes.  Proposition: any permutation in $S_n$ can be written as a product of disjoint cycles.  Proof (attempt): $s\in S_n$. Let $\langle s\rangle$ act on $X=\{1,\cdots,n\}$. Define $x\sim x'\iff x'\in\text{Orb}(x)$ for $x,x'\in X:$ this is clearly an equivalent relation, hence the orbits partition $X$. Each orbit corresponds a cycle in $s$, so we are done.  Does this hold, or have I missed something vital? I need to make my (BibTeX) references section appear in the table of contents of my LaTeX document (documentclass: article), with section numbering too.  My approach until now has been making a new section and including the bibliography (references.bib) at that point:  \section{References} \bibliography{references}   However, the final document shows both the section title that I have written and the section title that BibTeX writes, which is quite redundant and I definitely dislike.  How can I either remove BibTeX's section title, or make the BibTeX bibliography appear in the table of contents without making a new section?  If I were to make the BibTeX bibliography appear in the table of contents without making a new section, how could I assure that the section title that BibTeX writes looks exactly like sections typeset with \section? What is the yield keyword used for in C#? In the  question one of the answers had the following code snippet:  IEnumerable&lt;object&gt; FilteredList() {     foreach(object item in FullList)     {         if(IsItemInPartialList(item))             yield return item;     } }   What does the yield keyword do there?  I've seen it referenced in a couple places, and one other question, but I haven't quite figured out what it actually does.  I'm used to thinking of yield in the sense of one thread yielding to another, but that doesn't seem relevant here. Live refresh shows "modified" on tagged questions even when unmodified if $x_i$ are IID  continuous random variables, with $E[x_i]=μ$, is the following correct?   $E\left[\prod_{i=1}^n(1+⍺\space x_i)^i\right] = \prod_{i=1}^nE\left[(1+⍺\space x_i)^i\right] =  \prod_{i=1}^n(1+⍺\space E\left[x_i\right])^i = (1+⍺\space μ)^n$  thanks! If a question is in all-uppercase or all-lowercase, our quality filters should automatically reject it Proposal If a question on an English-language Stack Exchange site does not contain at least one uppercase and one lowercase letter, our quality filter should reject it. (We can make exceptions for sites which don't use a mixed-case alphabet, such as .) Justification The quality filter currently rejects neither all-uppercase nor all-lowercase posts. I've checked. The best Stack Exchange users use mixed case. If an asker is too lazy to use their Shift key, their question tends not to be of very good quality. Don't take my word for it. You can see proof. Sam Saffron helped me write  which lets you see with your very own eyes that what I am saying is true. Single-case askers tend to ask poor-quality questions such as:      In addition, posts which use only uppercase or only lowercase — even if they aren't riddled with typos or grammatical errors — tend to be hard to read. Capitalization aids readability. Why is this proposal not a duplicate? This proposal is not a duplicate of the older proposal . This is because it also deals with all-lowercase questions. All-lowercase questions are 50 times more common than all-caps questions.  Stack Overflow gets only about 100 all-uppercase questions per year; see .  Yet it gets about 5,000 all-lowercase questions per year; see . (These statistics are for Stack Overflow only; the rest of our network wasn't considered.) I suspect that the older proposal was declined for two reasons:  All-uppercase questions are rare.  Therefore, the effort required to block all-uppercase questions is too much.   This proposal is better. For just a bit more effort, the Stack Exchange developers can get a much richer reward. Conclusion What do you think of my proposal? Agree? Disagree? Thoughts? PS: This idea is modified and adapted from  by Stack Exchange user Gilles. My dear sir Gilles, I thank you. Note There's even a  which automatically detects questions with all-caps titles and alerts interested users and moderators. Determine whether a number is prime How do I determine if a number is prime?  I'm writing a program where a user inputs any integer and from that the program determines whether the number is prime, but how do I go about that? I remember reading it while in middle school in English in the United States, so the latest it would have come out was 1998. I don't remember if it was all one author, or even the same universe. These are the stories I remember:   A man finds a way to create a medicine that prevents radiation poisoning (or possibly makes someone fireproof... it's a little confused in my head) and learns that part of the problem is finding a market for it. I vividly remember the inventor telling someone to not "let the doorknob ream you" as it slams shut. A bout of graffiti artists leads to the city buying anti-graffiti paint that dissolves any other paint put on top of it. After learning the futility of trying to paint over it, the protagonist consults with a friend and learns that the anti-graffiti paint will eat away at the paint above it at a steady rate, and will even eat successive layers of the anti-graffiti paint. he uses this property to engineer an animation involving a harlequin thumbing this nose at the officials even as they try to wash it away. Some guys (I want to say a gang) go to a clinic for an illegal nanotech transformation. The viewpoint character gets turned into a woman while a friend gets turned into a dog. After roaming about in their new forms, they return to find the clinic being raided, meaning there's no one to turn them back. I think I remember something bad happening to the one transformed into a dog where the transformation continued, erasing his human thought patterns. There was also a scene where the viewpoint character submitted to being sexually assaulted by his former friends as if it was simply to be expected given his form.   I don't remember if the first or the second story was the actual first story of the collection... I want to say that those are the order that they showed up as in the book. Can a git submodule be created retroactively? I have a question regarding classification in general. Let $f$ be a classifier, which outputs a set of probabilities given some data D. Normally, one would say: well, if $P(c|D) &gt; 0.5$, we will assign a class 1, otherwise 0 (let this be a binary classification).   My question is, what if I find out, that if I classify the class as 1 also when the probabilities are larger than, for instance 0.2, and the classifier performs better. Is it legitimate to then use this new threshold when doing classification?  I would interpret the necessity for lower classification bound in the context of the data emitting a smaller signal; yet still significant for the classification problem.  I realize this is one way to do it. However, if this is not correct thinking of reducing the threshold, what would be some data transformations, which emphasize individual features in a similar manner, so that the threshold can remain at 0.5? What's the fixed size of the suggested edit queue? We know that Stack Overflow has a suggested edit queue, visible to the users who have the  privilege. Someone said the queue has a fixed size.  What's the fixed size of the suggested edit queue?  Is it often that the queue gets filled up and users can no longer suggest edits? Prove that $a_{n}=0$ for all $n$, if $\sum a_{kn}=0$ for all $k\geq 1$ How to align a  to the middle (horizontally/width) of the page undelete big files - mission impossible? I've accidentaly deleted outlook.pst (6.7GB) file, while there was only 400MB free space left on primary NTFS partition (winxp).  I've tried several recovery tools to get this file back. "Ontrack Easy Recovery Pro" found 0 pst files (complete scan mode), while "Recover My Files" in sector scan mode found 5 pst's, but 4 of them of sizes from 3 to 28 KB, while the 5th one - 1Gb.  I've managed to succesfuly recover 1Gb pst file, which was 1 year old copy (the one used after the latest windows reinstall).  Now, I'm frustrated and confused   Why 1 year old file was succesfuly recovered if there were only 400MB left on primary partition? Where's 6.7GB file gone? I did some reading (), and it seems that there's almost no probability to retrieve the file I'm looking for, but wait - none of recovery tools i've used found zero-sized pst file, moreover - if due to fragmentation a file might be corrupted - we could use scanpst.exe to fix some errors and survive with 10 or 100 emails missing - whatever. Could you please recommend some more sophisticated recovery tools for this particular task?   Appretiate your help - thanks in advance How is Starkiller Base's beam visible from Takodana in The Force Awakens? On Takodana,      the main characters and various bar patrons can see the planet Hosnian Prime being destroyed by Starkiller Base with their (respective) naked eyes. How did they see this? Is the Hosnian system close enough to see? If it's not very close and they could just see the explosion, how did the light from it reach them so quickly? Does adverb placement affect meaning? He swam slowly to the island.  He slowly swam to the island.    Some experts say that there is a “slight difference” in meaning. Would you please tell me that difference? I have searched the web a lot and could not find an answer that fits my situation. Here are two links that are quite contradictory:       My situation:  I've visited Portugal in December 2012 for 29 days on a Schengen visa valid from December 1st, 2012 to February 1st, 2013 for research purposes (I am a Ph.D. student). I want to visit Sweden from February 10th, 2013 to May 10th, 2013 (89 days). I have applied for a Schengen visa again (for research). How will the 90/180 rule work in my situation?