Can somebody help me to figure out a command to find a file recursively that is embedded in a tgz file which is within another tgz files recursively:  MainFile.tgz → SubFile1.tgz → SubFile2.tgz → SubFile3.tgz → abc.txt  My goal is to be able to list abc.txt without extracting MainFile.tgz nor SubFileX.tgz.  The command below is only listing the first level of files (i.e. SubFile.tgz); therefore the grep command cannot find abc.txt in the list:  tar tvf MainFile.tgz | grep abc
I'm trying to find out what modules  in cpan. So I've used  to mirror it. My problem is that I need to iterate through the archives that are downloaded, and grep the files that are in the archives. Can anyone tell me how I might do this? preferably in a way that tells me which file in the archive and what line it's on.  (note: they aren't all tarballs some are zip files)
How do I completly remove XP from my pc. I currently have a dual boot with XP and Windows 7. Since installing Windows 7, I have never used XP. Can I remove it without causing problems with Windows 7? I've tried several things already,  std::stringstream m; m.empty(); m.clear();   both of which don't work. I know the usage of     This is a new car.   This is singular.     These are some books for you.   These is plural.  Shall we use   There exists some people who agree with me. There exist some people who agree with me.   Which one is the correct usage and why? Is it (if at all) possible in Blender 2.6+?   If not, will future versions of Blender support it?  I see some old posts ( and ) saying that it is not possible. However, I found  referring to operators under  that allowed me to add sensors and controllers from python.  bpy.ops.logic.sensor_add(type='ALWAYS', object=my_obj.name) bpy.ops.logic.controller_add(type='LOGIC_AND', object=my_obj.name)   However I am not able to find any way to link them from python. I tried following (but did not work):  new_controller = my_obj.controllers[-1] new_sensor = my_obj.sensors[-1]   It throws AttributeError saying that object has no attribute 'controllers' :-/ I am having trouble with (a) and (b):  I evaluated (a) and I got that sun of the first three terms does not equal $\ln(5/8)$. I got that it is equal to $\ln(3/4) + \ln(2/3) + \ln(15/16)$ which is not equal to $\ln(5/8)$.  I am also having trouble with part (b). I cannot figure out how to calculate the math to cancel out the $(k+1)^2$ and turn it into $2(n  +1)$.  Any help would be amazing. Inverse of a Positive Definite Citing a range of papers using numeric keys as in \cite{a, b, c} -> [1-3] Is there a way to access wifi in Zurich airport without a phone service? I am traveling through Zurich and have a phone without any roaming there; I'm planning on picking up a SIM once I get to my final destination. Last time I was there, I couldn't access the airport wifi because it required a code sent via SMS.    In the event I need to contact someone or coordinate about flight delays, is there some alternate way to get wifi access? Is it possible to add non-number characters on the left of a code block?  Specifically, I want to add ... to correspond with some source code (see image).    I am currently using commands to stop / start the line numbers. Here is the code:  \documentclass[12pt]{article}  \usepackage[a4paper, margin = 20mm, top = 30mm, bottom = 25mm]{geometry} \usepackage{xcolor, soul} \usepackage{listings}  \definecolor{codebackground}{rgb}{0.95, 0.95, 0.92}  \lstset {     frame            = tb, % hrule above and below     keepspaces       = true,     columns          = flexible,     basicstyle       = {\normalsize\ttfamily},     escapeinside     = {(*@}{@*)}, % for escaping     backgroundcolor  = \color{codebackground},     showstringspaces = false,     language         = C,     keywordstyle     = \color{blue},     stringstyle      = \color{red},     commentstyle     = \color{teal},     numbers          = left, % {none, left, right}     firstnumber      = 1,     numberstyle      = \scriptsize\color{black},     numbersep        = 5pt }  \let\origthelstnumber\thelstnumber \makeatletter % for stopping line numbers \newcommand*\stopnumber {     \lst@AddToHook{OnNewLine}     {         \let\thelstnumber\relax         \advance\c@lstnumber-\@ne\relax     } } % for starting line numbers \newcommand*\startnumber[1] {     \setcounter{lstnumber}{\numexpr#1-1\relax}     \lst@AddToHook{OnNewLine}     {         \let\thelstnumber\origthelstnumber         \refstepcounter{lstnumber}     } } \makeatother  \begin{document} \begin{lstlisting}[firstnumber = 456] int third_function(const int c) {     /* error checking */     if(c &lt; 0)     {         return;     } (*@ \stopnumber @*)      ...     (*@ \startnumber{512} @*)     /* other stuff */     int d = 4;     char* word = "third function"; (*@ \stopnumber @*)      ...     (*@ \startnumber{678} @*)     return (c * d); } \end{lstlisting} \end{document} have already been created through .  have already completed their beta stage and are waiting for launch.  are in public beta stage.  are in commitment phase in   proposals are listed in   Now it is really confusing to find a suitable site to ask a question. As an example - I host a blog using . Now I have a question about this hosting. I want to post it in a . Where will I post? I have 2 options available now.     Are developers trying anything to solve this confusing matter? Searching for an equation to find the center of a sphere given 4 points, one finds that taking the determinant of the four (non-coplanar) points together with the variables $x$, $y$, and $z$ arranged like so:  $\left|\begin{array}{ccccc} x^2+y^2+z^2 &amp; x &amp; y&amp;z&amp;1\\ x_1^2 + y_1^2 + z_1^2 &amp; x_1 &amp; y_1 &amp; z_1 &amp; 1\\ x_2^2 + y_2^2 + z_2^2 &amp; x_2 &amp; y_2 &amp; z_2 &amp; 1\\ x_3^2 + y_3^2 + z_3^2 &amp; x_3 &amp; y_3 &amp; z_3 &amp; 1\\ x_4^2 + y_4^2 + z_4^2 &amp; x_4 &amp; y_4 &amp; z_4 &amp; 1\\ \end{array}\right| = 0$   yields the equation for the sphere.  Then one need only re-arrange terms into the more familiar form to find the center and radius.  This works fine.  My question is why.    This same approach also works for one or two dimensions.  I'm guessing it also works for finding hyperspheres in higher-dimensional spaces as long as you have a corresponding number of points.  But where did that determinant form come from?  Is there an intuitive meaning for what that relationship is saying? I hope somebody has already figured this one out. I just installed Geoserver 2.9 on a vanilla Ubuntu 16.04 distro. The Geoserver 2.8 method of enabling CORS with the shanbe.hezoun class does no longer work with Jetty 9.2.13.  There are mentions that CORS support is already packaged with Jetty 9.2.13 in the jetty-servlets.jar.  The Jetty lib which is compiled with Geoserver contains a jetty-servlet-9.2.13.v20150730.jar in geoserver/lib but not jetty-servlets.9.2.13.v20150730.jar. Are these supposed to be the same jar with a different name?  It should be possible to enable CORS either in geoserver/etc/webdefault.xml or in geoserver/webapps/geoserver/WEB-INF/web.xml.  My understanding is that the webdefault.xml is applied first and the web.xml thereafter.  I have tried following filter in both xml. I haven't got as far as adding a filter mapping. Adding the filter alone will cause the Geoserver/Jetty service to not start proper.  &lt;filter&gt;     &lt;filter-name&gt;cross-origin&lt;/filter-name&gt;     &lt;filter-class&gt;org.eclipse.jetty.servlets.CrossOriginFilter&lt;/filter-class&gt; &lt;/filter&gt; Duplicate:    I want an pseudo random number generator that can generate numbers with no repeats in a random order. For example: random(10) might return 5, 9, 1, 4, 2, 8, 3, 7, 6, 10 Is there a better way to do it other than making the range of numbers and shuffling them about, or checking the generated list for repeats?  Edit: Also I want it to be efficient in generating big numbers without the entire range.  Edit: I see everyone suggesting shuffle algorithms. But if I want to generate large random number (1024 byte+) then that method would take alot more memory than if I just used a regular RNG and inserted into a Set until it was a specified length, right? Is there no better mathematical algorithm for this. I am given this problem: let $a\ge0$,$b\ge0$, and the sequences $a_n$ and $b_n$ are defined in this way: $a_0:=a$, $b_0:=b$ and $a_{n+1}:= \sqrt{a_nb_n}$ and $b_{n+1}:=\frac{1}{2}(a_n+b_n)$ for all $n\in\Bbb{N}$    To prove is that both sequences converge and that they have the same limit. I don't know how to show this. I have spent 2 hours on this, no sign of success Uncountable subset with uncountable complement, without the Axiom of Choice Let $X$ be a set and consider the collection $\mathcal{A}(X)$ of countable or cocountable subsets of $X$, that is, $E \in \mathcal{A}(X)$ if $E$ is countable or $X-E$ is countable. If $X$ is countable, then $\mathcal{A}(X)$ coincides with the power set $\mathcal{P}(X)$ of $X$. Now suppose that $X$ is uncountable. Assuming the axiom of choice, we can conclude that $\mathcal{A}(X) \ne \mathcal{P}(X)$, since $|X| = |X| + |X|$. So the question is:     Can we prove in ZF that $\mathcal{A}(X) \ne \mathcal{P}(X)$ for every uncountable set $X$?   I'm assuming that a set $X$ is uncountable if there is no injective function $f : X \rightarrow \mathbb{N}$. In other words, can I do something like  for() {     for {        for {        }     } }   Except N times? In other words, when the method creating the loops is called, it is given some parameter N, and the method would then create N of these loops nested one in another?  Of course, the idea is that there should be an "easy" or "the usual" way of doing it. I already have an idea for a very complicated one. Generating Random Passwords When a user on our site loses his password and heads off to the Lost Password page we need to give him a new temporary password. I don't really mind how random this is, or if it matches all the "needed" strong password rules, all I want to do is give them a password that they can change later.  The application is a Web application written in C#. so I was thinking of being mean and going for the easy route of using part of a Guid. i.e.  Guid.NewGuid().ToString("d").Substring(1,8)   Suggesstions? thoughts? Is the sorting algorithm used by .NET's Array.Sort() method a  algorithm? What is an idiom/slang for "someone who pretends to be good when they're not"? This is not from real life, but from a movie on my local TV. A character in the movie is really bad, but when she talks with others, she pretends to be an innocent/ good woman. I want to know how to describe this kind of person. Time Capsule cryptography? Does there exist any cryptographic algorithm which encrypts data in such a way that it can only be decrypted after a certain period of time?  The only idea that I can think of, is something like this: Seed a PRNG with a public value. Run the PRNG for a week and use the final value it produces to encrypt the message. Now anyone who runs that PRNG for a week starting from the seed value you made public can decrypt the message. Obviously this breaks down since they could use more computational power than you; if the time span was years then Moore's Law would apply, etc.  Is there anything like this other than physically burying a private key on a USB stick in a literal time capsule?