I have 2 array as below :  Array 1 (   [0] =&gt; c1   [1] =&gt; c2   [2] =&gt; c3 )  Array 2 (    [0] =&gt; Son    [1] =&gt; Daughter    [2] =&gt; Son )   Output required :  Array (   c1  =&gt; Son   c2  =&gt; Daughter   c3  =&gt; Son  )   Can anyone please guide to generate this output ? Thank you.
I've got two arrays of the same size.  I'd like to merge the two so the values of one are the key indexes of the new array, and the values of the new array are the values of the other.  Right now I'm just looping through the arrays and creating the new array manually, but I have a feeling there is a much more elegant way to go about this.  I don't see any array functions for this purpose, but maybe I missed something?  Is there a simple way to this along these lines?  $mapped_array = mapkeys($array_with_keys, $array_with_values);
When clicking &quot;edit&quot; I see:  Your edit will be placed in a queue until it is peer reviewed. We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.  Like:     Likewise, when I am not logged in, clicking &quot;improve this question&quot; or &quot;improve this answer&quot; shows:  You are not . Your edit will be placed in a queue until it is .  And when I click 'Save', I get:  Thanks for submitting an edit. It is only visible to you until it's been approved by trusted community members  Like:     Who can suggest an edit? Where do suggested edits go? Who can vote on a suggested edit? How do suggested edits get reviewed? Can I earn reputation? What about abuse or bad edits? Sometimes the Community user approves or rejects my edit. Why is that? When can I not suggest an edit? Is there a minimum change requirement for a suggested edit? How do I check my suggested edit history? I disagree with the reasons why my suggested edit was rejected. What can I do? How do I know whether there are edits waiting for review? Someone suggested an edit to my own post, and the reviewers took the wrong action. What can I do? Are tag wikis included in this scheme? What do the &quot;Improve Edit&quot; and &quot;Reject and Edit&quot; buttons do? Why are apparently valid links to rejected edits resulting in 404 errors?   For more information about editing, see &quot;&quot; in the . Getting polygon boundaries of City in JSON from Google Maps API? Fitting text to a shape in TikZ I am designing a poster, which has some geometrical shapes (TikZ paths) surrounded by some text. I would like the text to flow neatly around these shapes. I bet there's some clever TikZ magic that could do this.  EDIT: This is the sort of effect I want, sorry to not be clear:    \documentclass[a4paper]{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \draw (0,0) to (2,-2) to (2,-4) to (4,-4) to [out=up, in=down] (6.5,0); \node [text width=6cm, anchor=north west] at (0,0) { \hspace{5pt}  This is the sort of effect I want to \\ \hspace{23pt} achieve, with text automatically \\ \hspace{36pt} constrained by some \\ \hspace{46pt} geometrical form. Here \\ \hspace{55pt} it's just a curve, \\ \hspace{57pt} but this could \\ \hspace{57pt} also be the \\ \hspace{57pt} text label \\ \hspace{57pt} of a node.}; \end{tikzpicture} \end{document} Prove $(x_1+.....+x_n)^2 \leq n(x_1^2 + .....+x_n^2)$ Prove that  $(x_1+\dots+x_n)^2 \leq n(x_1^2 + \dots+x_n^2)$  for all positive integers n and all real numbers $x_1,....,x_n$  I am attempting a proof by induction but wasn't sure if i need the Cauchy-Schwarz Inequality or perhaps another way other than induction to prove this.  Proof   $n=1$ true  assume true for $n=k$  Now for $n= k+1$  $(x_1 + \dots +x_k + x_{k+1})^2 \leq \dots$ Setting environment variables for latex and bibtex in .bashrc Possible Duplicate:          I recently started using TeX to write journal articles. I use TeX Live version 2009-10 on a laptop running Ubuntu 10.10 (64-bit). I edit and compile the tex files using vim and vim-latexsuite.   Currently for each journal article I have all associated tex, bib, eps, etc. files in individual folders. I would like to simplify my life a bit and have a dedicated folder containing a "master" bib file - And maybe another folder for my custom style files.   My problem is that can't figure out how I should define the PATH, and other environment variables in my .bashrc file to find the necessary support files (e.g., the .bib file). Which variables do I need to set? PATH? MANPATH? TEXINPUTS? BIBINPUTS? I'd like to add an invisible watermark to each PDF document that I produce so that in case it leaks, I know where it leaked from. Anyone knows what would a good way for an invisible watermark be in a PDF document and how to add one? Display solution/file path in the Visual Studio IDE I frequently work with multiple instances of Visual Studio, often working on different branches of the same solution.   used to display the full path of the current source file in its title bar, but Visual&nbsp;Studio 2005 doesn't appear to do this. This makes it slightly more awkward than it should be to work out which branch of the solution I'm currently looking at (the quickest way I know of is to hover over a tab so you get the source file's path as a tooltip).  Is there a way to get the full solution or file path into the title bar, or at least somewhere that's always visible, so I can quickly tell which branch is loaded into each instance? What is the difference between a predicate and function? I need to to understand the difference between predicates and functions in the context of Clasual Form Logic in order to define the Herbrand universe.  If I have p(x) :- q(f(x)) would I be right in saying that p and q are predicates while f is a function because it is "nested"?  By this thinking then if I have p(x) :- q(x) both p and q are predicates and I have no functions?  If this is incorrect then how can I tell the difference between a predicate and function? Pokemon Egg Disappearing So my Pokemon eggs are reaching "maturity" then they just disappear. I don't get a new Pokemon. The egg just disappears. I had this happen with a 2k and a 5k now. Is this happening to anyone else? When I make an animation, it always starts out slow, then speeds up, then slows down at the end.  I cannot figure out how to fix this. Comparing $\pi^e$ and $e^\pi$ without calculating them How should we deal with duplicate answers? Prime factorization of square numbers Let n be a natural number with unique prime factorization $p^m$... $q^k$ . Show that n can be written as a square if and only if  all (m, ...k) are even Does deleting iCloud photos affect them on devices? If I delete a photo from my iCloud will it also be removed from my devices that are connected to my account? Why do people not upvote, or accept answers that worked for them? I am regular Stack Exchange user, especially at Stack Overflow.  One of the things I really dislike about new and sometimes veteran users is that:   Either they do not accept an answer that works for them, Or they accept the answer but do not vote it up   I mean they can really both accept the answer and vote it up but somehow they wouldn't =(.  How many of you feel the same way? In what format does piped output get sent and received from one command/program to another? 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. What is the name of this castle part? Is Highschool of the Dead on hiatus again? If $(X_n)$ is i.i.d. and $ \frac1n\sum\limits_{k=1}^{n} {X_k}\to Y$ almost surely then $X_1$ is integrable (converse of SLLN) Let $(\Omega,\mathcal F,P)$ be a finite measure space.  Let $X_n:\Omega \rightarrow \mathbb R$ be a sequence of iid r.v's  I need to prove that if:  $ n^{-1}\sum _{k=1}^{n} {X_k} $ converges almost surely to $Y$ then all $X_k$ have expectation.  If I understand correctly then $X_k$ has expectations means $X_k$ is in $\mathcal L^1(\Omega)$.  And I know that on finite measure space Converging in expectations is converging in $\mathcal L^1(\Omega)$ and it's stronger than almost sure convergence.  And I know that from linearity of expectation even if one of the sequence is not in $\mathcal L^1(\Omega)$ then $Y$ is not in $\mathcal L^1(\Omega)$.  How do I continue?