Using Git – A Designer’s Guide

mrgingerpants · 2012-05-25T06:13:08.367543+00:00

git-annex is great for this.

derrickwho · 3 days

Just put noremap K kJ in your .vimrc :)

feverlax · 10 days

For your svn and git updates, you can use the fantastic mr.

simonask · 11 days

No, a dependent type system such as Agda's may be a fixpoint in the turtle stack.

willvarfar · 12 days

As scgtrp said, this can be solved by *. But another place where it is impractical is for localization : often you have to translate format strings by the means of a (runtime) function : printf(translate(fmt), arg1, arg2).

SayNoToWar · 12 days

apt-cache search is waaaay faster than aptitude (for searches). I usually do the opposite : apt to search, aptitude to install.

eroick · 14 days

Instead of typing M-thing you can type esc, then thing.

bombeater · 14 days

Come on, no one will blame you if you use :help. You don't need "cheat" sheets for documentation.

loudnessproblems · 14 days

Billie Jean

graymind · 22 days

John Goerzen occasionally writes posts on how he teaches using a computer to his kid (~5yo). You may like this series.

McGilatine · 27 days

ATM0

swizec · 27 days

Everything goes well with rainymood.com.

_not_you · 27 days

Here you are

rhinojazz · 29 days

I think that we agree but I was not sure about your wording :). To be clear : you said "at least two source data sets will produce the same hash." :

∃ (x, y). x≠y ∧ h(x) = h(y)  (True. Pigeonhole principle)

While that's true, that's not what OP asked. He asked whether given a file's hash, there always exists a file with the same hash.

∀ x. ∃y. x≠y ∧ h(x) = h(y)  (Not always true)

Thus I totally agree with you on :

you still have no way of proving that it's a unique, distinct pair. You can't know until you've tested every other possible source block.

Yes. Another block may exist with the same hash, or not at all.

Wingzero · 29 days

Ask /r/sysadmin

rhinojazz · 29 days

If you are 100% sure that the size of the source data is a megabyte (8388608 bits), it's obvious that at least two source data sets will produce the same hash.

Not quite. It is true that there will be two files with the same hash (pigeonhole principle), but given a file, it can be the only one with its size and its hash. On this figure, 1's image has only one preimage for example.

To construct a more precise example, for every file x, there's a function f_x such that card { y/ f_x (y) = f_x (x) } = 1. (take f_x(y) = δ_xy)

derrrek · 29 days

Just above the crossfader, put every channel on "THRU".

calrogman · 1 month

What hex editor do you use on linux ?

utdleague · 1 month

This is called Jespersen's cycle.

r0bbbo · 1 month

Another relevant xkcd

AwkwardResponse · 1 month

Explain what used to work, and what happens now. Try to explain what you did that changed the behaviour (package upgrade, configuration change...). Use your distribution's bug tracker and your friendly maintainer will help you post relevant data (you can also get inspiration form other bug reports on the same package).

Who should be on the receiving end of this information?

Definitely your distribution. Many bugs are related to packaging itself (defaults, inter-package relationships, distro-specific patches) ; also, the maintainer will mark bugs as duplicates before sending bugs/patches to the upstream developers.

Is there a such thing as "too verbose" in reporting small issues?

The main risk is losing your time. There are various levels between "HELP MY LAPTOP DOES NOT WORK" and including all your logs. So, the best you can do is explain what used to work, subscribe to the bug and wait for instructions :)

petdance · 1 month

Out of curiosity, what language was that ? Usually, identifiers can't start with a number.

tinou

TROPHY CASE

tinou

TROPHY CASE

you'll need to login or register to do that

create a new account

login