I want to get only the number of ms from a ping command to a file Without piping to a file it works as intended. I'm a little bit lost on why > to a file does not write anything.  This works:  ping 192.168.1.1 |egrep --line-buffered -v 'PING|timeout' |sed -l -e 's/^.* time=\(.*\) ms$/\1/g'   This does not write anything to ping.dat  ping 192.168.1.1 |egrep --line-buffered -v 'PING|timeout' |sed -l -e 's/^.* time=\(.*\) ms$/\1/g' &gt; ping.dat   What am I doing wrong?
So, I understand that by using 'tee' I can redirect the output of a command such as 'ping' to stdout as well as a file.  For example:  &gt; ping google.com | tee somefile   This would display the ping statistics on terminal and write them to 'somefile'.  Now, if I wish to modify the output from 'ping', I can use 'cut' in such a way:  &gt; ping google.com | cut -d' ' -f 1   But, if I wish to use all the three commands together, I get a no output on stdout and an empty file.  &gt; ping google.com | cut -d' ' -f 1 | tee somefile   What am I doing wrong? Is there a better way to do this? Somehow I feel I am not using 'tee' properly. Any insight would be appreciated.  I'm using bash shell, if this is relevant.
I'd like to work on a bbcode filter for a php website. (I'm using cakephp, it would be a bbcode helper) I have some requirement.    Bbcodes can be nested. So something like that is valid.  [block]       [block]       [/block]       [block]           [block]           [/block]       [/block]   [/block]     Bbcodes can have 0 or more parameters.     Exemple:     [video: url="url", width="500", height="500"]Title[/video]   Bbcodes might have mutliple behaviours.     Let say, [url]text[/url] would be transformed to [url:url="text"]text[/url] or the video bbcode would be able to choose between youtube, dailymotion....  I think it cover most of my needs. I alreay done something with regex. But my biggest problem was to match parameters. In fact, I got nested bbcode to work and bbcode with 0 parameters. But when I added a regex match for parameters it didn't match nested bbcode correctly.   "\[($tag)(=.*)\"\](.*)\[\/\1\]"  // It wasn't .* but the non-gready matcher  I don't have the complete regex with me right now, But I had something that looked like that(above).  So is there a way to match bbcode efficiently with regex or something else.  The only thing I can think of is to use the visitor pattern and to split my text with each possible tags this way, I can have a bit more of control over my text parsing and I could probably validate my document so if the input text doesn't have valid bbcode. I could Notify the user with a error before saving anything.  I would use sablecc to create my text parser.   Any better idea? or anything that could lead to a efficient flexible bbcode parser?  Thank you and sorry for my bad english... What determines the number of comments that are displayed? I'm curious how it is decided how many comments to display before the "Show more comments" link. Sometimes I see a dozen comments on a question and no "Show more comments" link, in other occasions no comments are visible at all, only the link. I shall come, not will Native speakers, how can you comment such a sentence:  I shall come, not will  Can I use it for  I will definitely come, not maybe    Adding some information other people asked me about.  How I came to such a question.  Here   I asked about "Shall I win?" pointing that it could have some variants of understanding:  1) Shall I win? = Should I win? (suggestion)  2) Shall I win? = Will I win? (archaic with 1st person)  3) Shall I win? = is it 100% that I will win? (predestination\inevitability)  The excellent guy Mixolydian said either variant was possible, that it didn't matter what person you used "shall" with, it could have this "predestination\inevitability" anyway. Out of this we're getting that nowadays we can use "will" for simple future actions and "shall" for almost predicted (almost 100% surety of happening) future actions.  If I want to say to someone:  Don't be afraid, I will come anyway.  Don't get panicked, I will definitely come  Be sure, I will come in any case  I can use "shall" for it meanining an action into which I will put 100% effort:  I shall come!  And what if my original sentence is  Don't doubt, I will definitely come, not maybe or probably  Can I use  I shall come, not will  pointing that "shall" guarantees me putting all my strengths into it while "will" doesn't give any assuarance that I will do everything to finally come.  As I understood, it wasn't very easy to ask such a question because English was different everywhere - US, UK, Australie, Ireland etc. I heard it was acceptabse to use even "thee\thou" in Ireland or somewhere like that while all other world has already forgotten such words...  P.S. What I got from the answers ias that it was better to forget about the existence of "shall" cause it created so many misunderstandings:D Fraleigh(7ed) Theorem33.12. Let $p$ be a prime and let $n\in\mathbb{Z}^+$. If $E$ and $E&#39;$ are fields of order $p^n$, then $E \simeq E&#39;$.   Proof in the text: Both $E$ and $E&#39;$ have $\mathbb{Z}_p$ as prime field, up to isomorphism. By Corollary 33.6(A finite extension $E$ of a finite field $F$ is a simple extension of $F$), $E$ is a simple extension of $\mathbb{Z}_p$ of degree $n$, so there exists an irreducible polynomial $f(x)$ of degree $n$ in $\mathbb{Z}_p[x]$ such that $E\simeq \mathbb{Z}_p[x]/ \langle f(x) \rangle$. Because the elements of $E$ are zeros of $x^{p^n}-x$, *we see that $f(x)$ is a factor of $x^{p^n}-x$ in $\mathbb{Z}_p[x]$*. Because $E&#39;$ also consists of zeros of  $x^{p^n}-x$, we see that $E&#39;$ also contains zeros of irreducible $f(x)$ in $\mathbb{Z}_p[x]$. Thus, because $E&#39;$ also contains exactly $p^n$ elements, $E&#39;$ is also isomorphic to $E\simeq \mathbb{Z}_p[x]/\langle f(x) \rangle$.  I don't know why $f(x)$ divides $x^{p^n}-x$. $E$ has a zero $\alpha$ of $f(x)$, but it doesn't need to have all the zeros of $f(x)$. So $f(x)=(x-\alpha)g(x)$ in $E[x]$ and $g(x)$ need not be splitted into linear factors. How can $f(x)$ divide $x^{p^n}-x$? Is it possible to trade Pokemon from the 1st generation games to the most recent ones? I know that you can trade Pokemon between games of the same generation (Gold/Silver, Ruby/Sapphire) and even trade between 1st gen and 2nd gen. However, I haven't been able to find a way to trade Pokemon so that I can play with my 1st generation Pokemon in HeartGold, for instance. If it is possible, how many steps would it take and what equipment would I need? is there a way to request a new tag be created? Possible Duplicate:          I do not have sufficient reputation on any site to create new tags, but I do on occasion find myself in need of a tag that does not exists.  Is there a feature that allows for a person with sub-1500 reputation to request a new tag? Possible to perform cross-database queries with PostgreSQL? Prove that $\mathbb Z_{m}\times\mathbb Z_{n} \cong \mathbb Z_{mn}$ implies $\gcd(m,n)=1$. Prove that $\mathbb Z_{m}\times\mathbb Z_{n} \cong \mathbb Z_{mn}$ implies $\gcd(m,n)=1$.  This is the converse of the Chinese remainder theorem in abstract algebra. Any help would be appreciated.  Thanks! Using past tense when referencing a still-true fact In the sentence: "I didn't know she had a son,"   Can I say "I didn't know she has a son" instead, because he is a teenager now?  Or are both correct? I have an application that reads a CSV file with piles of data rows.  I give the user a summary of the number of rows based on types of data, but I want to make sure that I don't read in too many rows of data and cause OutOfMemoryErrors.  Each row translates into an object.  Is there an easy way to find out the size of that object programmatically?  Is there a reference that defines how large primitive types and object references are for a VM?  Right now, I have code that says read up to 32,000 rows, but I'd also like to have code that says read as many rows as possible until I've used 32MB of memory.  Maybe that is a different question, but I'd still like to know. I ran into this site:  But I can't find it on here:  Is it even an &quot;official&quot; Stack Exchange project? An instructor has an exam of 5 questions and a question bank of 50 questions. Are there $50\choose 5$ or $(50)_5$ possible exams? Where $(50)_5 = 50! / 45! $ and $50\choose 5$ $= 50!/(5!45!)$   I've narrowed it down to these two possibilities (though even these may be wrong), but I think I'm confusing myself as to which one I use. Can anyone suggest a good way of thinking of this problem that will make it apparent whether I need use use the falling factorial or the binary coefficient?   Edit: thank you for all the answers! Indeed, I meant $50!/45$ as the falling factorial. Also, the question doesn't specify whether it was meant to be ordered or unordered, but I think I understand my confusion now! How do I resize my partition in Ubuntu? I had Windows 8 installed on my system, which I screwed up, and now I run Ubuntu 12.04. While installing, Ubuntu used all the 461 GB of HDD space (one partition).   Now I want to make a new partition of maybe 100 GB or so, in order to install Windows 7 alongside Ubuntu (with a dual-boot). But I can't even get a partition done. I can't change the partition in GParted either - the option is disabled. getting exception while putting list data into the map Getting percent sign into an URL in a footnote I'm using the url package. Now, I have some some url with a percent sign in it and want to place it in a footnote. When I let the % where it is, I get a comment, and the whole thing fails to compile because of some unmatched brackets. When it's at the end of a line, it doesn't show up at all in the result. When I write \% instead, this gets literally into the output—but I want the url to be displayed correctly.  What could I do? Regression: Transforming Variables When transforming variables, do you have to use all of the same transformation? For example, can I pick and choose differently transformed variables, as in:   Let, $x_1,x_2,x_3$ be age, length of employment, length of residence, and income.  Y = B1*sqrt(x1) + B2*-1/(x2) + B3*log(x3)   Or, must you be consistent with your transforms and use all of the same? As in:   Y = B1*log(x1) + B2*log(x2) + B3*log(x3)    My understanding is that the goal of transformation is to address the problem of normality. Looking at histograms of each variable we can see that they present very different distributions, which would lead me to believe that the transformations required are different on a variable by variable basis.   ## R Code df &lt;- read.spss(file="http://www.bertelsen.ca/R/logistic-regression.sav",                  use.value.labels=T, to.data.frame=T) hist(df[1:7])      Lastly, how valid is it to transform variables using $\log(x_n + 1)$ where $x_n$ has $0$ values? Does this transform need to be consistent across all variables or is it used adhoc even for those variables which do not include $0$'s?  ## R Code  plot(df[1:7]) When an option expires does that constitute a buy or sell A similar question recently asked about stock sales and option buys triggering wash sale rules.  If an option expires, is that considered a buy/sale ?  What I mean is: let's assume I have a call option with a target date of August 16. Now I sell the underlying stock somewhere before that (after July 16th). Does that trigger wash sale rules (if the option expires in the money, exercised by default) ?  Is an option expiring out of the money considered a sale ? Is it possible to log back into a Pokemon Go account? So I had 20+ Pokemon on my account and today when I tapped on the app, it brought me back to the original screen when you first start playing. My friend who signed up tested using my username when she first started and my username was unavailable, meaning the account still exists. I don't have the password for the account, but I do have the email. So I wanted to know if it was possible to log back into an account? I have a new computer with a Seagate ST500DM002 SATA internal hard drive.  I am trying to install Ubuntu 11.10 64-bit on it but the installer does not recognize/detect/see the hard drive. When I reach the Installation type step, the panel which is supposed to show devices and partitions looks empty.  sudo fdisk -l shows only /dev/sda1, the USB drive from which I am running the installation. I have already tried the following two solutions without any success:   sudo apt-get remove dmraid Switch the SATA mode in the BIOS from IDE to AHCI   I am sure it's not a hardware related problem as I have already successfully installed another operating system on the same computer.  The output of sudo lshw -class storage -class disk follows:    *-ide UNCLAIMED                 description: IDE interface        product: ASMedia Technology Inc.        vendor: ASMedia Technology Inc.        physical id: 0        bus info: pci@0000:06:00.0        version: 01        width: 32 bits        clock: 33MHz        capabilities: ide msi pm pciexpress cap_list        configuration: latency=0        resources: ioport:d040(size=8) ioport:d030(size=4) ioport:d020(size=8) ioport:d010(size=4) ioport:d000(size=16) memory:fe400000-fe4001ff   *-storage        description: SATA controller        product: 6 Series/C200 Series Chipset Family 6 port SATA AHCI Controller        vendor: Intel Corporation        physical id: 1f.2        bus info: pci@0000:00:1f.2        logical name: scsi1        version: 05        width: 32 bits        clock: 66MHz        capabilities: storage msi pm ahci_1.0 bus_master cap_list emulated        configuration: driver=ahci latency=0        resources: irq:44 ioport:f0b0(size=8) ioport:f0a0(size=4) ioport:f090(size=8) ioport:f080(size=4) ioport:f060(size=32) memory:fe705000-fe7057ff      *-cdrom           description: DVD-RAM writer           product: DVDRAM GH22NS70           vendor: HL-DT-ST           physical id: 0.0.0           bus info: scsi@1:0.0.0           logical name: /dev/cdrom           logical name: /dev/cdrw           logical name: /dev/dvd           logical name: /dev/dvdrw           logical name: /dev/scd0           logical name: /dev/sr0           version: EX00           capabilities: removable audio cd-r cd-rw dvd dvd-r dvd-ram           configuration: ansiversion=5 status=nodisc   *-scsi:0        physical id: 1        bus info: usb@1:1.2        logical name: scsi6        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           physical id: 0.0.0           bus info: scsi@6:0.0.0           logical name: /dev/sda           size: 14GiB (16GB)           capabilities: partitioned partitioned:dos           configuration: signature=0004e5a4   *-scsi:1        physical id: 2        bus info: usb@1:1.3        logical name: scsi7        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           product: Storage Device           vendor: USB Mass           physical id: 0.0.0           bus info: scsi@7:0.0.0           logical name: /dev/sdb           capabilities: removable         *-medium              physical id: 0              logical name: /dev/sdb   Any idea on what I could do to fix this problem? What is the simplest way to prove the Earth is round? Assume you've come in contact with a tribe of people cut off from the rest of the world, or you've gone back in time several thousand years, or (more likely) you've got a numbskull cousin.  How would you prove that the Earth is, in fact, round?