How do I copy all the folder, subfolders and files permissions (recursively) from /www_03062018 to my new /www ?  I came across this post:   chmod --reference=RFile file   Which didn't help much, it did apply a change for the main folder /www but didn't apply on its subfolders and files.    i have tried:   chmod -R --reference=/www_03062018 /www   and it didn't work.   My situation:   I have 2 folders on my Ubuntu machine: /www and /www_03062018.   /www is a "git clone" from the production machine.   /www_03062018 is my old directory that i used to work on and upload files via FTP.   I started to use GIT and when I clone a directory - all its folder ownerships and file accesses settings doesn't get cloned too.
I have two files in a directory. One has correct permissions and the other has not. Is there a way I can "copy" the set of permissions from one file to another?
I've heard Google's algorithm is based on PageRank, and that it has something to do with the links to your site. Can someone explain it, and more importantly, how I can increase my site's PageRank? Trying to locate a file, how can I search the entire hard drive for a file? I would like to scale an image file for each dimension differently for example 50% of the x dimension or 25% of the y dimension. Thank you very much. "Nobody want to go there," or "nobody wants to go there"? In English, the number 0 is treated as plural. It is then:   0 seconds 1 second    1.2 seconds   2 seconds     Shouldn't it be "nobody want to go there," instead of "nobody wants to go there"?  I also saw in TOEFL that "any __" should be used with a singular.  But I see it very common that it is a plural also.  Why is that?  (updated: example, "we don't have any apples any more" vs "If you get any apple, please let me know.") Wedge product and change of variables Number of points on a line in a finite projective plane I've been reading some proofs regarding finite projective planes of order n, and often they start out by assuming that each line contains n+1 points. Is this a fact that follows from the axioms for finite projective planes? Or does this relate to the order of the finite field being projected? (for example in the Fano plane, does the fact that each line contains 3 points follow from the fact that there are 3 elements {0,1,2} in Z_2?) I haven't been able to find a clear explanation of this (clearly I do not yet have a solid understanding of how such planes are constructed). If someone could enlighten me that would be excellent. Why is the net speed of Stack Overflow so fast? This question is about the net speed.  I'm from China, and I find that opening pages on Stack Overflow is very fast, normally within a range of 1 to 4 seconds. This speed is very good for a website outside China; it's even faster than some native websites.  Not every website outside China has such good speed, so I am wondering why and how Stack Overflow manages to be so quick. How to remove the WordPress version from some .css/.js files I know that I can use the following function to remove the version from all .css and .js files:  add_filter( 'style_loader_src', 'sdt_remove_ver_css_js', 9999 ); add_filter( 'script_loader_src', 'sdt_remove_ver_css_js', 9999 ); function sdt_remove_ver_css_js( $src ) {     if ( strpos( $src, 'ver=' ) )         $src = remove_query_arg( 'ver', $src );     return $src; }   But I have some files, for instance style.css, in the case of which I want to add a version in the following way:  function css_versioning() {     wp_enqueue_style( 'style',         get_stylesheet_directory_uri() . '/style.css' ,         false,         filemtime( get_stylesheet_directory() . '/style.css' ),         'all' ); }   But the previous function removes also this version. So the question is how to make the two work together? How to push a copy of an object into array in PHP I am working on the problems from the textbook "Topology without tears". I am stuck with problem number $4$ in Exercise $2.2$. Could anyone suggest some hints on how to proceed? The question goes as follows.  A topological space $(X,\tau)$ is said to satisfy the second axiom of countability or to be second countable if there exists a basis $\mathcal{B}$ for $\tau$, where $\mathcal{B}$ consists of only a countable number of sets.   Prove that the discrete topology on an uncountable set does not satisfy the second axiom of countability. Let $(X,\tau)$ be the set of all integers with the finite-closed topology. Does the space $(X,\tau)$ satisfy the second axiom of countability?   For the first problem, I tried to argue by contradiction assuming that the basis for the topology is countable. But I did-not know what I need to look at to prove the contradiction. For the second one, I do not know where to start. I have not thought deeply on the second one though.  Thanks, Adhvaitha Password protecting a page I'm trying to password protect a page but it doesn't seem to be working. I've set the password for the page but when you navigate to it it just loads up like normal and doesn't ask for any passwords.  This is the loop I have on my page:  &lt;?php /**  * @package WordPress  * @subpackage Default_Theme  * Template Name: Page  */  get_header(); ?&gt;  &lt;?php global $post; if ( post_password_required( $post ) ) { ?&gt;  &lt;?php $fields = get_acf(); ?&gt;  &lt;script type="text/javascript"&gt;  (function() {   window.onload = function() {   ...  }} )  &lt;/script&gt;  &lt;div id="map"&gt;&lt;/div&gt;  &lt;?php } else { ?&gt;     Not passworded        &lt;?php if (have_posts()) : ?&gt;         &lt;?php while (have_posts()) : the_post(); ?&gt;          &lt;?php endwhile; ?&gt;     &lt;?php endif; ?&gt;         &lt;?      } // Page isn't password-protected     ?&gt; &lt;?php get_footer(); ?&gt;   I want to password protect everything within the page.  UPDATE:  I have custom content on the page so if possible I need to be able to wrap some code around it all.  Update: Should I always use a comma after "e.g." or "i.e."? It seems that "e.g." is always followed by a comma but "i.e." is not. Why is that? Why is \[ ... \] preferable to $$ ... $$? I've heard that you should use \[ ... \] for displayed equations instead of  $$ ... $$, but why is that?  I'd assumed that it's so that you can more easily tell which are starting and which are ending delimiters, but if I always use a syntax-highlighting text editor, I can see that easily based on the color of the symbols.  Is there any reason for this suggestion? Can I replace a 15 ampere circuit breaker with a 20 ampere breaker? When I plug-in a conventional heating pad or a hair dryer into any bedroom duplex, the lights dim; and/or trips the circuit breaker. The home is of new construction-- placed in service 31 Dec 2013. My question is: Can I safely replace the existing 15 AMP Breaker with that of a 20 AMP? . . . the service cable is of 14 Gauge Copper Conductor. Why are there $736$ matrices $M\in \mathcal M_2(\mathbb{Z}_{26})$ for which it holds that $M=M^{-1}$? I'm currently trying to introduce myself to cryptography.  I'm reading about the Hill Cipher currently in the book Applied Abstract Algebra. The Hill Cipher uses an invertible matrix $M$ for encryption and the inverse matrix $M^{-1}$ for decryption. The book recommends to use a matrix $M$ for which it holds that $M=M^{-1}$, since we then have the same key for encryption and decryption.  In the book, they use a $2 \times 2$ matrix $M$ over $\mathbb{Z}_{26}$ as example, and state that for there are 736 $2 \times 2$ matrices for which it hold that $M=M^{-1}$.  I'm trying to pick up on as much as possible when reading things, since I find it counter-productive for learning to skip something, when you don't get the theory behind it. Can someone enlighten to me, as to why it is that there are 736 possible $2 \times 2$ $M=M^{-1}$ matrices and how to find them? Why is AES considered to be secure? The security of RSA is based on the integer factorization problem, which is a very well defined and understood mathematical problem. This problem must be solved in order to fundamentally break RSA.   What about AES (and others based on the same idea)? Why is it difficult to break? Is there any mathematical principle that ensures its security? Is there a rule to know when to pronounce letter c as a "soft c" (s) or "hard c" (k)? Why are C character literals ints instead of chars? In C++, sizeof('a') == sizeof(char) == 1. This makes intuitive sense, since 'a' is a character literal, and sizeof(char) == 1 as defined by the standard.  In C however, sizeof('a') == sizeof(int). That is, it appears that C character literals are actually integers. Does anyone know why? I can find plenty of mentions of this C quirk but no explanation for why it exists. ESTA approved on the same day as B-1/B-2 visa refused I am writing because I have a question regarding my ESTA application and because I could not find a similar case online that would help me at this stage. I have never been to the U.S. so this would be my first visit.    I am a German citizen, hence eligible for the Waiver Program. I applied for an ESTA in June 2014 and got approved. After further research on the Internet I learned that the passport should be valid until 6 months after the planned return date. My passport was due to run out in Feb 2015 - which still should have been fine but because I didn't want to take chances I applied for a new passport which was issued August 2014 and is now valid until August 2024. My passport number has been changed also.    After I received my new passport I was advised by a friend to apply for a B-1/B-2 visa as it would allow me to extend my stay and it seemed like a good idea at first. On the day of my interview I also applied for a new ESTA with my new passport number (just in case) which again was granted.   Unfortunately for me the interview for the B-1/B-2 visa was unsuccessful and I got rejected. I was not aware then that after a rejected interview one could not travel with ESTA, otherwise I would have never risked it!  Now I am very concerned, can I still use my ESTA and enter the U.S.? as I read everywhere that once you get rejected the chances of getting through are very slim and any visa rejection will result in not being able to use the waiver program.  It might be important to note that both the B-1/B-2 interview and the waiver application were on the same day, 21st of August 2014, so depending on how one might look at it that might present a problem too I suppose.  I guess the frustration lies in the fact that I did not need to apply for a B-1/B-2 visa to begin with, and had I not I would now not have these problems. I would like to know how likely it is that I can still travel under the waiver program, if at all, and what my options are at this point. What is a Windows Handle?