I'd like to replace gedit, and use Sublime Text 3 as my default text editor for all text files on my Ubuntu system. Can you let me know how do I go about making this change?
I started using Sublime Text 2 a week or so ago and I loved it so much I've spent $60 on it and now want to use it for everything.  Gedit currently has ownership of most of the text file associations. I'd essentially like to replace any association to gedit with sublime-text-2.  Any tips available on bulk association changing? Desktop-neutral methods are preferred.
I switch back and forth between two computers constantly:   OSX Snow Leopard  Ubuntu 10.10    I'd like to be able to make Ubuntu use the same keyboard shortcuts as OSX System Wide, for the following keyboard sequences only (ie I don't want to make Ctrl act like Super)   Super+C -> Copy Super+V -> Paste Super+T -> Open a new tab in whatever browser I'm in.  Super+W -> Close a tab in whatever browser I'm in.    So in short, is there anyway for me to map just these keyboard sequences to the following, system wide ?   Super+C -> Ctrl+C Super+V -> Ctrl+V Super+T -> Ctrl+T  Super+W -> Ctrl+W   I know there are ways for me to do this for vim, and Firefox, and I'm sure specifically for most applications... but I would prefer to have to do this just once and have it work that way system wide!  I'm using a standard PC keyboard, that is "Generic 105 key (intl) PC" on Ubuntu. I'm also using the same keyboard on my Mac mini. How to print the position How to write the below lines using array?? val1=$(grep 'Thread' Threadout.txt | awk -F&quot;/&quot; '{print $1}')    val2=$(grep 'Thread' Threadout.txt | awk -F&quot;/&quot; '{print $2}')  val3=$(grep 'Thread' Threadout.txt | awk -F&quot;/&quot; '{print $3}')  val4=$(grep 'Thread' Threadout.txt | awk -F&quot;/&quot; '{print $4}')  Threadout.txt contains like &quot;Thread 1/1/25/100&quot; Show that $$\sum_{k=0}^n(-1)^k\binom nk=0$$ So for odd $n$ we have an even number of terms. So $\binom nk=\binom n{n-k}$ which have opposite signs. Thus the sum is 0.  For even $n$ we have that $$\sum_{k=0}^n(-1)^k\binom nk= \binom n0+\sum_{k=1}^{n-1}(-1)^k\binom nk+\binom nn$$ Now $$\sum_{k=1}^{n-1}(-1)^k\binom nk= \sum_{k=1}^{n-1}(-1)^k\left[\binom{n-1}k+\binom{n-1}{k-1}\right]$$ What would that sum be in the square brackets? Custom toolbar location XP A few years ago Umber Ferrule wrote that the toolbars in the taskbar are defined in   HKEY_CURRENT_USER\Software\Microsoft\Windows\CurrentVersion\Explorer\Streams.   This looks very plausible but cannot be the entire story.  Deleting this key will in no way affect the taskbar and on rebooting the system the key magically reappears.  Why do I want to know?  Simple.  I would like to export the key to a reg. file as a convenient backup. Does Kylo not know the fate of Darth Vader? It seems Kylo has an obsession of Darth Vader and has an interest in the dark side because of it.   Does he not realize that Darth Vader turned good and helped destroy the Empire (Spoilers?)? I feel like Kylo would've seen how much better the Light Side was as it was able to turn Vader from the Dark Side if he had known this. Solve $$u_{xx}-3u_{xt}-4u_{tt}=0$$ where $u(x,0)=x^2$ and $u_t(x,0)=e^x$.  My workings so far: I have factored the differential equation in the following way: $$(\delta_x-4\delta_t)(\delta_x+\delta_t)=0$$ where $\delta_x=\frac{\delta}{\delta x}$ etc. Now if we let $v$ be the solution to $(\delta_x+\delta_t)u$ then we have the following two equations: \begin{eqnarray*} (\delta_x+\delta_t)u=u_x+u_t=v\\ (\delta_x-4\delta_t)v=v_x-4v_t=0 \end{eqnarray*} Now for $v$ we simply find $$v=h(t+4x)$$ where $h$ is an arbitrary function of one variable. Now what remains is find $u$ such that $$u_x+u_t=h(t+4x)$$ I am stuck here, I thought about making a change of variables $\zeta=x+t$ and $\eta=x-t$ and thus using the product rule to show that $u_x=u_{\zeta}+u_{\eta}$ and $u_t=u_{\zeta}-u_{\eta}$ and thus $u_x+u_t=2u_{\zeta}$ and we need to solve $$u_{\zeta}=h(t+4x)$$ (I left out the factor 2 because $h$ is an arbitrary function). Do I simply integrate now and conclude $$u=f(\zeta)h(t+4x)+g(\eta)=f(x+t)h(t+4x)+g(x-t)$$ This seems wrong to me...  Some help would be greatly appreciated! Can I access private members from outside the class without using friends? Disclaimer Yes, I am fully aware that what I am asking about is totally stupid and that anyone who would wish to try such a thing in production code should be fired and/or shot.  I'm mainly looking to see if can be done. Now that that's out of the way, is there any way to access private class members in C++ from outside the class?  For example, is there any way to do this with pointer offsets? (Naive and otherwise non-production-ready techniques welcome) Update As noted in the comments, I asked this question because I wanted to write a blog post on over-encapsulation (and how it affects TDD).  I wanted to see if there was a way to say &quot;using private variables isn't a 100% reliable way to enforce encapsulation, even in C++.&quot;  At the end, I decided to focus more on how to solve the problem rather than why it's a problem, so I didn't feature some of the stuff brought up here as prominently as I had planned, but I still left a link. At any rate, if anyone's interested in how it came out, here it is:   (I suggest reading it before you decide that I'm crazy). I've seen many variants of this problem online, but not quite the same as this, so I don't believe this is a duplicate.  The famous differential equation problem models a skydiver jumping out of a plane as  $$m \frac{dv}{dt} = -mg-cv$$ where m is the mass of the skydiver, g is acceleration due to gravity (9.81 m/s) and c is the coefficient of air resistance.  Here is my question:     Suppose the skydiver exits the stationary helicopter at an altitude of 2000m and opens the parachute at 500m. For this exercise, the parachute opens instantaneously. Suppose m= 70kgs, the coefficient of air resistance is c = 14 for a free falling body and c = 105 after the parachute opens. When does the skydiver open the parachute? When does the Skydiver hit the ground?   So my attempt at a solution kinda starts like this, but this is where I get stuck:  Let's assume that s(t) is the distance the body falls in time t from its initial point of release, then $v = \frac{ds}{dt}$ and $a = \frac{dv}{dt} = \frac{d^2s}{dt^2}$. Thus we have a second order differential equation: $m \frac{d^2s}{dt^2} = -mg-c\frac{ds}{dt}$. By simply manipulation, we get $m \frac{d^2s}{dt^2} + c\frac{ds}{dt} = mg$. I originally started thinking of finding the integrating factor, however, this seems more complicated and won't help produce the equation that I need.  Would anyone be able to help? Much thanks in advanced! Installing particular versions when repo has newer versions? Let's have a metapackage which depends on the following packages  Depends: A (=2),  B (=2),  C (=2)   Note the '=' - I want to install these particular versions, not the most recent ones.  Additionally:  B depends on A(>=1)  C depends on B(>=1) and A(>=1)  If the most recent versions of A,B,C in the repository are 2 then this works.  Since I have put version 3 of A and version 3 of B in the repo sudo apt-get install my-meta-package refuses to finish with the following info:  The following packages have unmet dependencies:   my-meta-package: Depends: B (= 2) but 3 is to be installed                    Depends: A (= 2) but 3 is to be installed   If I manually install versions 2 of A and B then the metapackage installs correctly, which strongly suggests that there is no hidden dependency on A3 or B3. This is not a solution for the problem as the metapackage is installed automatically on many machines.  QUESTION: What to do to make sudo apt-get install my-meta-package install versions 2,2,2?  Additionally, is there a way I could get an extended info what actually creates the need for version 3 of A and version 3 of B? Defer Parsing of Scripts this is my first time to try this "Defer Parsing" thing, and I don't really have an idea how to do it.    Using PageSpeed tool, I found out that one of the reason why my page is loading too slow (currently 92/100) are the scripts. And the PageSpeed suggested that I need to Defer Parsing all those scripts.  Is there anyone that can help me with this. Thanks. new finding by Minev et al. seems to suggest that transitions between atomic states are not instantaneous, but continuous processes wherein a superposition smoothly adjusts from favoring one state to another (if I understand it correctly). The authors also claim to be able to catch a system "mid-jump" and reverse it. Popular articles are  and .  I am curious if this finding rules out any interpretations of QM. It seems to generally go against the Copenhagen attitude, which describes measurements as collapsing physical systems into a definite classical state. The popular articles indeed claim that the founders of QM would have been surprised by the new finding.  The link with the asterisk mentions that something called "quantum trajectories theory" predicts what was observed. Is this an interpretation, or a theory? And are they implying that other interpretations/theories don't work? On my system (Windows Vista Home Premium 64bit) Python files are associated with Python interpreter:  C:\Users\Piotr&gt;assoc .py .py=Python.File C:\Users\Piotr&gt;ftype Python.File Python.File=c:\python\2.7\python.exe "%1" %*   Nevertheless when I run any Python script from command line a window titled Open With pops up asking me to Choose the program you want to use to open this file. "cron" processes spawning and piling up, but no crontab EDIT: I solved this, so see below for my own answer. While the bounty asks for a fix to the problem, I'd like to award it to someone who can explain why a cron process that ran for 6 years over multiple MacOS versions suddenly became a problem in Catalina.  First note, this is not a duplicate of  because I don't have active crontabs on my computer. Cron processes spawn, but they never finish, so they just keep piling up. I'm running MacOS Catalina 10.15.1  Cron jobs are spawning every couple of minutes and never dying. The oldest cron process always has a parent process "launchd", and I've searched for populated crontabs and can't find any. If I let this go on long enough, eventually I run into a scenario where I have hundreds of running cron processes and everything on my computer grinds to a halt, and I can't even open new apps (I get cryptic messages like ".app cannot be opened" when I try to open an app). My only solution at this point has been to keep activity monitor open and periodically killing off all active cron processes.  I've been able to create a new user account that seems to be immune from this issue. However, as soon as I logged into my apple ID on that account to set up iCloud drive, the problem started with that account, too. I logged out of my Apple ID and attempted uninstall iCloud drive, but the problem persisted. Clean installs of Catalina don't clear up the problem, I've reset SMC and PRAM multiple times, and repairing permissions (via this ). I've also ensured that cron has full disk access (via this ). I'm at a dead end with trying to troubleshoot this problem.  I'm not sure it's related, but my "system.log" file seems to get spammed the following few lines:  &lt;redacted&gt; AMPDeviceDiscoveryAgent[2132]: Entered:_AMMuxedDeviceDisconnected, mux-device:63 &lt;redacted&gt; AMPDeviceDiscoveryAgent[2132]: Entered:__thr_AMMuxedDeviceDisconnected, mux-device:63 &lt;redacted&gt; AMPDeviceDiscoveryAgent[2132]: tid:9a27 - Mux ID not found in mapping dictionary   ANY help is appreciated. I'm playing around with a native (non-web) single-player game I'm writing, and it occured to me that having a daily/weekly/all-time online highscore list (think Xbox Live Leaderboard) would make the game much more interesting, adding some (small) amount of community and competition. However, I'm afraid people would see such a feature as an invitation to hacking, which would discourage regular players due to impossibly high scores.  I thought about the obvious ways of preventing such attempts (public/private key encryption, for example), but I've figured out reasonably simple ways hackers could circumvent all of my ideas (extracting the public key from the binary and thus sending fake encrypted scores, for example).  Have you ever implemented an online highscore list or leaderboard? Did you find a reasonably hacker-proof way of implementing this? If so, how did you do it? What are your experiences with hacking attempts? In classical logic, why is $(p\Rightarrow q)$ True if $p$ is False and $q$ is True? Provided we have this truth table where "$p\implies q$" means "if $p$ then $q$":  $$\begin{array}{|c|c|c|} \hline p&amp;q&amp;p\implies q\\ \hline T&amp;T&amp;T\\ T&amp;F&amp;F\\ F&amp;T&amp;T\\ F&amp;F&amp;T\\\hline \end{array}$$  My understanding is that "$p\implies q$" means "when there is $p$, there is q". The second row in the truth table where $p$ is true and $q$ is false would then contradict "$p\implies q$" because there is no $q$ when $p$ is present.  Why then, does the third row of the truth table not contradict "$p\implies q$"? If $q$ is true when $p$ is false, then $p$ is not a condition of $q$.  I have not taken any logic class so please explain it in layman's terms.       Administrative note. You may experience being directed here even though your question was actually about line 4 of the truth table instead. In that case, see the companion question  And even if your original worry was about line 3, it might be useful to skim the other question anyway; many of the answers to either question attempt to explain both lines. Static posts page with home.php Prove that $||x|-|y||\le |x-y|$ With the following circuits as examples :    and    How will the current I know how much to flow? Would any other wave travel first in the circuit and then come back and say so much current should flow? Why does sudo change the PATH? What rolls should players get to see? I'm a new DM and over the last few weeks I've been slowly learning the game and how it runs. My party consists of 5 PCs.   One thing I have been wondering after our last two sessions is: What rolls should all the players see and which rolls shouldn't they see?  Is there a comprehensive list of what rolls are public and which go behind the DM screen, or is it more down to house rules or personal preference?