 You have been invited to participate in a study to learn more about how people make decisions. If you agree to participate in this study you will be asked to answer a few questions and play a game on your computer.
You will receive a minimum of £5.00 plus an additional pay-off that will be determined by your own performance and your team's performance in an online game. The study will take around 30 minutes (and up to 45 minutes).
There are no known risks associated with this study.
Participation in this study is voluntary. You may refuse to participate and you may withdraw at any time. However, if you do withdraw before the end of the study, you will receive no payment. You may choose not to answer any questions you prefer not to answer.
Your data will be kept confidential. Identifying information appears only on receipt forms (the form on which you will sign that you received your payoff at the end of this study). Those forms will be locked in a secure office for three years after the completion of the study and will then be destroyed. To preserve the anonymity of the data we collect in this study, each participant will be assigned a random code number. This code will be used to keep track of data produced by the experiment. Publications based on this data will only use group results, no identifying information.
Should you have any questions about participating in this study please raise your hand now and ask the experimenters. Should any questions arise after the study, should you have any concerns about your data, or should you wish to report any problems related to this study please e-mail me (Christine Stedtnitz) at cmsted@essex.ac.uk.


☰
Close
Photo
About
«
»
ABOUT
Sample Design
Sample work of web design, code, and artwork. Click
here
to see more of my works!


val timbre: List<Float>
Timbre is the quality of a musical note or sound that distinguishes different types of musical instruments, or voices. Timbre vectors are best used in comparison with each other.
timbre
- Timbre is the quality of a musical note or sound that distinguishes different types of musical
instruments, or voices. Timbre vectors are best used in comparison with each other.


git-rev-list - Lists commit objects in reverse chronological order
git rev-list [ --max-count=<number> ]
[ --skip=<number> ]
[ --max-age=<timestamp> ]
[ --min-age=<timestamp> ]
[ --sparse ]
[ --merges ]
[ --no-merges ]
[ --min-parents=<number> ]
[ --no-min-parents ]
[ --max-parents=<number> ]
[ --no-max-parents ]
[ --first-parent ]
[ --remove-empty ]
[ --full-history ]
[ --not ]
[ --all ]
[ --branches[=<pattern>] ]
[ --tags[=<pattern>] ]
[ --remotes[=<pattern>] ]
[ --glob=<glob-pattern> ]
[ --ignore-missing ]
[ --stdin ]
[ --quiet ]
[ --topo-order ]
[ --parents ]
[ --timestamp ]
[ --left-right ]
[ --left-only ]
[ --right-only ]
[ --cherry-mark ]
[ --cherry-pick ]
[ --encoding=<encoding> ]
[ --(author|committer|grep)=<pattern> ]
[ --regexp-ignore-case | -i ]
[ --extended-regexp | -E ]
[ --fixed-strings | -F ]
[ --date=(local|relative|default|iso|rfc|short) ]
[ [--objects | --objects-edge] [ --unpacked ] ]
[ --pretty | --header ]
[ --bisect ]
[ --bisect-vars ]
[ --bisect-all ]
[ --merge ]
[ --reverse ]
[ --walk-reflogs ]
[ --no-walk ] [ --do-walk ]
[ --use-bitmap-index ]
<commit>... [ -- <paths>... ]
List commits that are reachable by following the parent links from the given commit(s), but exclude commits that are reachable from the one(s) given with a ^ in front of them. The output is given in reverse chronological order by default.
You can think of this as a set operation. Commits given on the command line form a set of commits that are reachable from any of them, and then commits reachable from any of the ones given with ^ in front are subtracted from that set. The remaining commits are what comes out in the command(cqs output. Various other options and paths parameters can be used to further limit the result.
Thus, the following command:
$ git rev-list foo bar ^baz
means "list all the commits which are reachable from foo or bar, but not from baz".
A special notation "<commit1>..<commit2>" can be used as a short-hand for "^*(Aq<commit1>*(Aq <commit2>". For example, either of the following may be used interchangeably:
$ git rev-list origin..HEAD $ git rev-list HEAD ^origin
Another special notation is "<commit1>...<commit2>" which is useful for merges. The resulting set of commits is the symmetric difference between the two operands. The following two commands are equivalent:
$ git rev-list A B --not $(git merge-base --all A B) $ git rev-list A...B
rev-list is a very essential Git command, since it provides the ability to build and traverse commit ancestry graphs. For this reason, it has a lot of different options that enables it to be used by commands as different as git bisect and git repack.
Besides specifying a range of commits that should be listed using the special notations explained in the description, additional commit limiting may be applied.
Using more options generally further limits the output (e.g. --since=<date1> limits to commits newer than <date1>, and using it with --grep=<pattern> further limits to commits whose log message has a line that matches <pattern>), unless otherwise noted.
Note that these are applied before commit ordering and formatting options, such as --reverse.
-<number>, -n <number>, --max-count=<number>
Limit the number of commits to output.
--skip=<number>
Skip number commits before starting to show the commit output.
--since=<date>, --after=<date>
Show commits more recent than a specific date.
--until=<date>, --before=<date>
Show commits older than a specific date.
--max-age=<timestamp>, --min-age=<timestamp>
Limit the commits output to specified time range.
--author=<pattern>, --committer=<pattern>
Limit the commits output to ones with author/committer header lines that match the specified pattern (regular expression). With more than one --author=<pattern>, commits whose author matches any of the given patterns are chosen (similarly for multiple --committer=<pattern>).
--grep-reflog=<pattern>
Limit the commits output to ones with reflog entries that match the specified pattern (regular expression). With more than one --grep-reflog, commits whose reflog message matches any of the given patterns are chosen. It is an error to use this option unless --walk-reflogs is in use.
--grep=<pattern>
Limit the commits output to ones with log message that matches the specified pattern (regular expression). With more than one --grep=<pattern>, commits whose message matches any of the given patterns are chosen (but see --all-match).
When --show-notes is in effect, the message from the notes as if it is part of the log message.
--all-match
Limit the commits output to ones that match all given --grep, instead of ones that match at least one.
-i, --regexp-ignore-case
Match the regular expression limiting patterns without regard to letter case.
--basic-regexp
Consider the limiting patterns to be basic regular expressions; this is the default.
-E, --extended-regexp
Consider the limiting patterns to be extended regular expressions instead of the default basic regular expressions.
-F, --fixed-strings
Consider the limiting patterns to be fixed strings (don(cqt interpret pattern as a regular expression).
--perl-regexp
Consider the limiting patterns to be Perl-compatible regular expressions. Requires libpcre to be compiled in.
--remove-empty
Stop when a given path disappears from the tree.
--merges
Print only merge commits. This is exactly the same as --min-parents=2.
--no-merges
Do not print commits with more than one parent. This is exactly the same as --max-parents=1.
--min-parents=<number>, --max-parents=<number>, --no-min-parents, --no-max-parents
Show only commits which have at least (or at most) that many parent commits. In particular, --max-parents=1 is the same as --no-merges, --min-parents=2 is the same as --merges. --max-parents=0 gives all root commits and --min-parents=3 all octopus merges.
--no-min-parents and --no-max-parents reset these limits (to no limit) again. Equivalent forms are --min-parents=0 (any commit has 0 or more parents) and --max-parents=-1 (negative numbers denote no upper limit).
--first-parent
Follow only the first parent commit upon seeing a merge commit. This option can give a better overview when viewing the evolution of a particular topic branch, because merges into a topic branch tend to be only about adjusting to updated upstream from time to time, and this option allows you to ignore the individual commits brought in to your history by such a merge.
--not
Reverses the meaning of the ^ prefix (or lack thereof) for all following revision specifiers, up to the next --not.
--all
Pretend as if all the refs in refs/ are listed on the command line as <commit>.
--branches[=<pattern>]
Pretend as if all the refs in refs/heads are listed on the command line as <commit>. If <pattern> is given, limit branches to ones matching given shell glob. If pattern lacks ?, *, or [, /* at the end is implied.
--tags[=<pattern>]
Pretend as if all the refs in refs/tags are listed on the command line as <commit>. If <pattern> is given, limit tags to ones matching given shell glob. If pattern lacks ?, *, or [, /* at the end is implied.
--remotes[=<pattern>]
Pretend as if all the refs in refs/remotes are listed on the command line as <commit>. If <pattern> is given, limit remote-tracking branches to ones matching given shell glob. If pattern lacks ?, *, or [, /* at the end is implied.
--glob=<glob-pattern>
Pretend as if all the refs matching shell glob <glob-pattern> are listed on the command line as <commit>. Leading refs/, is automatically prepended if missing. If pattern lacks ?, *, or [, /* at the end is implied.
--exclude=<glob-pattern>
Do not include refs matching <glob-pattern> that the next --all, --branches, --tags, --remotes, or --glob would otherwise consider. Repetitions of this option accumulate exclusion patterns up to the next --all, --branches, --tags, --remotes, or --glob option (other options or arguments do not clear accumlated patterns).
The patterns given should not begin with refs/heads, refs/tags, or refs/remotes when applied to --branches, --tags, or --remotes, respectively, and they must begin with refs/ when applied to --glob or --all. If a trailing /* is intended, it must be given explicitly.
--ignore-missing
Upon seeing an invalid object name in the input, pretend as if the bad input was not given.
--stdin
In addition to the <commit> listed on the command line, read them from the standard input. If a -- separator is seen, stop reading commits and start reading paths to limit the result.
--quiet
Don(cqt print anything to standard output. This form is primarily meant to allow the caller to test the exit status to see if a range of objects is fully connected (or not). It is faster than redirecting stdout to /dev/null as the output does not have to be formatted.
--cherry-mark
Like --cherry-pick (see below) but mark equivalent commits with = rather than omitting them, and inequivalent ones with +.
--cherry-pick
Omit any commit that introduces the same change as another commit on the (lqother side(rq when the set of commits are limited with symmetric difference.
For example, if you have two branches, A and B, a usual way to list all commits on only one side of them is with --left-right (see the example below in the description of the --left-right option). However, it shows the commits that were cherry-picked from the other branch (for example, (lq3rd on b(rq may be cherry-picked from branch A). With this option, such pairs of commits are excluded from the output.
--left-only, --right-only
List only commits on the respective side of a symmetric range, i.e. only those which would be marked < resp. > by --left-right.
For example, --cherry-pick --right-only A...B omits those commits from B which are in A or are patch-equivalent to a commit in A. In other words, this lists the + commits from git cherry A B. More precisely, --cherry-pick --right-only --no-merges gives the exact list.
--cherry
A synonym for --right-only --cherry-mark --no-merges; useful to limit the output to the commits on our side and mark those that have been applied to the other side of a forked history with git log --cherry upstream...mybranch, similar to git cherry upstream mybranch.
-g, --walk-reflogs
Instead of walking the commit ancestry chain, walk reflog entries from the most recent one to older ones. When this option is used you cannot specify commits to exclude (that is, ^commit, commit1..commit2, and commit1...commit2 notations cannot be used).
With --pretty format other than oneline (for obvious reasons), this causes the output to have two extra lines of information taken from the reflog. By default, commit@{Nth} notation is used in the output. When the starting commit is specified as commit@{now}, output also uses commit@{timestamp} notation instead. Under --pretty=oneline, the commit message is prefixed with this information on the same line. This option cannot be combined with --reverse. See also git-reflog(1).
--merge
After a failed merge, show refs that touch files having a conflict and don(cqt exist on all heads to merge.
--boundary
Output excluded boundary commits. Boundary commits are prefixed with -.
--use-bitmap-index
Try to speed up the traversal using the pack bitmap index (if one is available). Note that when traversing with --objects, trees and blobs will not have their associated path printed.
Sometimes you are only interested in parts of the history, for example the commits modifying a particular <path>. But there are two parts of History Simplification, one part is selecting the commits and the other is how to do it, as there are various strategies to simplify the history.
The following options select the commits to be shown:
<paths>
Commits modifying the given <paths> are selected.
--simplify-by-decoration
Commits that are referred by some branch or tag are selected.
Note that extra commits can be shown to give a meaningful history.
The following options affect the way the simplification is performed:
Default mode
Simplifies the history to the simplest history explaining the final state of the tree. Simplest because it prunes some side branches if the end result is the same (i.e. merging branches with the same content)
--full-history
Same as the default mode, but does not prune some history.
--dense
Only the selected commits are shown, plus some to have a meaningful history.
--sparse
All commits in the simplified history are shown.
--simplify-merges
Additional option to --full-history to remove some needless merges from the resulting history, as there are no selected commits contributing to this merge.
--ancestry-path
When given a range of commits to display (e.g. commit1..commit2 or commit2 ^commit1), only display commits that exist directly on the ancestry chain between the commit1 and commit2, i.e. commits that are both descendants of commit1, and ancestors of commit2.
A more detailed explanation follows.
Suppose you specified foo as the <paths>. We shall call commits that modify foo !TREESAME, and the rest TREESAME. (In a diff filtered for foo, they look different and equal, respectively.)
In the following, we will always refer to the same example history to illustrate the differences between simplification settings. We assume that you are filtering for a file foo in this commit graph:
.-A---M---N---O---P---Q / / / / / / I B C D E Y e / / / / / `-------------*(Aq X
The horizontal line of history A---Q is taken to be the first parent of each merge. The commits are:
h'-04'(buh'+03'c
I is the initial commit, in which foo exists with contents (lqasdf(rq, and a file quux exists with contents (lqquux(rq. Initial commits are compared to an empty tree, so I is !TREESAME.
h'-04'(buh'+03'c
In A, foo contains just (lqfoo(rq.
h'-04'(buh'+03'c
B contains the same change as A. Its merge M is trivial and hence TREESAME to all parents.
h'-04'(buh'+03'c
C does not change foo, but its merge N changes it to (lqfoobar(rq, so it is not TREESAME to any parent.
h'-04'(buh'+03'c
D sets foo to (lqbaz(rq. Its merge O combines the strings from N and D to (lqfoobarbaz(rq; i.e., it is not TREESAME to any parent.
h'-04'(buh'+03'c
E changes quux to (lqxyzzy(rq, and its merge P combines the strings to (lqquux xyzzy(rq. P is TREESAME to O, but not to E.
h'-04'(buh'+03'c
X is an independent root commit that added a new file side, and Y modified it. Y is TREESAME to X. Its merge Q added side to P, and Q is TREESAME to P, but not to Y.
rev-list walks backwards through history, including or excluding commits based on whether --full-history and/or parent rewriting (via --parents or --children) are used. The following settings are available.
Default mode
Commits are included if they are not TREESAME to any parent (though this can be changed, see --sparse below). If the commit was a merge, and it was TREESAME to one parent, follow only that parent. (Even if there are several TREESAME parents, follow only one of them.) Otherwise, follow all parents.
This results in:
.-A---N---O / / / I---------D
Note how the rule to only follow the TREESAME parent, if one is available, removed B from consideration entirely. C was considered via N, but is TREESAME. Root commits are compared to an empty tree, so I is !TREESAME.
Parent/child relations are only visible with --parents, but that does not affect the commits selected in default mode, so we have shown the parent lines.
--full-history without parent rewriting
This mode differs from the default in one point: always follow all parents of a merge, even if it is TREESAME to one of them. Even if more than one side of the merge has commits that are included, this does not imply that the merge itself is! In the example, we get
I A B N D O P Q
M was excluded because it is TREESAME to both parents. E, C and B were all walked, but only B was !TREESAME, so the others do not appear.
Note that without parent rewriting, it is not really possible to talk about the parent/child relationships between the commits, so we show them disconnected.
--full-history with parent rewriting
Ordinary commits are only included if they are !TREESAME (though this can be changed, see --sparse below).
Merges are always included. However, their parent list is rewritten: Along each parent, prune away commits that are not included themselves. This results in
.-A---M---N---O---P---Q / / / / / I B / D / e / / / / `-------------*(Aq
Compare to --full-history without rewriting above. Note that E was pruned away because it is TREESAME, but the parent list of P was rewritten to contain E*(Aqs parent I. The same happened for C and N, and X, Y and Q.
In addition to the above settings, you can change whether TREESAME affects inclusion:
--dense
Commits that are walked are included if they are not TREESAME to any parent.
--sparse
All commits that are walked are included.
Note that without --full-history, this still simplifies merges: if one of the parents is TREESAME, we follow only that one, so the other sides of the merge are never walked.
--simplify-merges
First, build a history graph in the same way that --full-history with parent rewriting does (see above).
Then simplify each commit C to its replacement C*(Aq in the final history according to the following rules:
h'-04'(buh'+03'c
Set C*(Aq to C.
h'-04'(buh'+03'c
Replace each parent P of C*(Aq with its simplification P*(Aq. In the process, drop parents that are ancestors of other parents or that are root commits TREESAME to an empty tree, and remove duplicates, but take care to never drop all parents that we are TREESAME to.
h'-04'(buh'+03'c
If after this parent rewriting, C*(Aq is a root or merge commit (has zero or >1 parents), a boundary commit, or !TREESAME, it remains. Otherwise, it is replaced with its only parent.
The effect of this is best shown by way of comparing to --full-history with parent rewriting. The example turns into:
.-A---M---N---O / / / I B D e / / `---------*(Aq
Note the major differences in N, P, and Q over --full-history:
h'-04'(buh'+03'c
N*(Aqs parent list had I removed, because it is an ancestor of the other parent M. Still, N remained because it is !TREESAME.
h'-04'(buh'+03'c
P*(Aqs parent list similarly had I removed. P was then removed completely, because it had one parent and is TREESAME.
h'-04'(buh'+03'c
Q*(Aqs parent list had Y simplified to X. X was then removed, because it was a TREESAME root. Q was then removed completely, because it had one parent and is TREESAME.
Finally, there is a fifth simplification mode available:
--ancestry-path
Limit the displayed commits to those directly on the ancestry chain between the (lqfrom(rq and (lqto(rq commits in the given commit range. I.e. only display commits that are ancestor of the (lqto(rq commit and descendants of the (lqfrom(rq commit.
As an example use case, consider the following commit history:
D---E-------F / e e B---C---G---H---I---J / e A-------K---------------L--M
A regular D..M computes the set of commits that are ancestors of M, but excludes the ones that are ancestors of D. This is useful to see what happened to the history leading to M since D, in the sense that (lqwhat does M have that did not exist in D(rq. The result in this example would be all the commits, except A and B (and D itself, of course).
When we want to find out what commits in M are contaminated with the bug introduced by D and need fixing, however, we might want to view only the subset of D..M that are actually descendants of D, i.e. excluding C and K. This is exactly what the --ancestry-path option does. Applied to the D..M range, it results in:
E-------F e e G---H---I---J e L--M
The --simplify-by-decoration option allows you to view only the big picture of the topology of the history, by omitting commits that are not referenced by tags. Commits are marked as !TREESAME (in other words, kept after history simplification rules described above) if (1) they are referenced by tags, or (2) they change the contents of the paths given on the command line. All other commits are marked as TREESAME (subject to be simplified away).
--bisect
Limit output to the one commit object which is roughly halfway between included and excluded commits. Note that the bad bisection ref refs/bisect/bad is added to the included commits (if it exists) and the good bisection refs refs/bisect/good-* are added to the excluded commits (if they exist). Thus, supposing there are no refs in refs/bisect/, if
$ git rev-list --bisect foo ^bar ^baz
outputs midpoint, the output of the two commands
$ git rev-list foo ^midpoint $ git rev-list midpoint ^bar ^baz
would be of roughly the same length. Finding the change which introduces a regression is thus reduced to a binary search: repeatedly generate and test new *(Aqmidpoint(cqs until the commit chain is of length one.
--bisect-vars
This calculates the same as --bisect, except that refs in refs/bisect/ are not used, and except that this outputs text ready to be eval(cqed by the shell. These lines will assign the name of the midpoint revision to the variable bisect_rev, and the expected number of commits to be tested after bisect_rev is tested to bisect_nr, the expected number of commits to be tested if bisect_rev turns out to be good to bisect_good, the expected number of commits to be tested if bisect_rev turns out to be bad to bisect_bad, and the number of commits we are bisecting right now to bisect_all.
--bisect-all
This outputs all the commit objects between the included and excluded commits, ordered by their distance to the included and excluded commits. Refs in refs/bisect/ are not used. The farthest from them is displayed first. (This is the only one displayed by --bisect.)
This is useful because it makes it easy to choose a good commit to test when you want to avoid to test some of them for some reason (they may not compile for example).
This option can be used along with --bisect-vars, in this case, after all the sorted commit objects, there will be the same text as if --bisect-vars had been used alone.
By default, the commits are shown in reverse chronological order.
--date-order
Show no parents before all of its children are shown, but otherwise show commits in the commit timestamp order.
--author-date-order
Show no parents before all of its children are shown, but otherwise show commits in the author timestamp order.
--topo-order
Show no parents before all of its children are shown, and avoid showing commits on multiple lines of history intermixed.
For example, in a commit history like this:
---1----2----4----7 e e 3----5----6----8---
where the numbers denote the order of commit timestamps, git rev-list and friends with --date-order show the commits in the timestamp order: 8 7 6 5 4 3 2 1.
With --topo-order, they would show 8 6 5 3 7 4 2 1 (or 8 7 4 2 6 5 3 1); some older commits are shown before newer ones in order to avoid showing the commits from two parallel development track mixed together.
--reverse
Output the commits in reverse order. Cannot be combined with --walk-reflogs.
These options are mostly targeted for packing of Git repositories.
--objects
Print the object IDs of any object referenced by the listed commits. --objects foo ^bar thus means (lqsend me all object IDs which I need to download if I have the commit object bar but not foo(rq.
--objects-edge
Similar to --objects, but also print the IDs of excluded commits prefixed with a (lq-(rq character. This is used by git-pack-objects(1) to build (lqthin(rq pack, which records objects in deltified form based on objects contained in these excluded commits to reduce network traffic.
--unpacked
Only useful with --objects; print the object IDs that are not in packs.
--no-walk[=(sorted|unsorted)]
Only show the given commits, but do not traverse their ancestors. This has no effect if a range is specified. If the argument unsorted is given, the commits are shown in the order they were given on the command line. Otherwise (if sorted or no argument was given), the commits are shown in reverse chronological order by commit time.
--do-walk
Overrides a previous --no-walk.
Using these options, git-rev-list(1) will act similar to the more specialized family of commit log tools: git-log(1), git-show(1), and git-whatchanged(1)
--pretty[=<format>], --format=<format>
Pretty-print the contents of the commit logs in a given format, where <format> can be one of oneline, short, medium, full, fuller, email, raw and format:<string>. See the "PRETTY FORMATS" section for some additional details for each format. When omitted, the format defaults to medium.
Note: you can specify the default pretty format in the repository configuration (see git-config(1)).
--abbrev-commit
Instead of showing the full 40-byte hexadecimal commit object name, show only a partial prefix. Non default number of digits can be specified with "--abbrev=<n>" (which also modifies diff output, if it is displayed).
This should make "--pretty=oneline" a whole lot more readable for people using 80-column terminals.
--no-abbrev-commit
Show the full 40-byte hexadecimal commit object name. This negates --abbrev-commit and those options which imply it such as "--oneline". It also overrides the log.abbrevCommit variable.
--oneline
This is a shorthand for "--pretty=oneline --abbrev-commit" used together.
--encoding=<encoding>
The commit objects record the encoding used for the log message in their encoding header; this option can be used to tell the command to re-code the commit log message in the encoding preferred by the user. For non plumbing commands this defaults to UTF-8.
--notes[=<ref>]
Show the notes (see git-notes(1)) that annotate the commit, when showing the commit log message. This is the default for git log, git show and git whatchanged commands when there is no --pretty, --format, or --oneline option given on the command line.
By default, the notes shown are from the notes refs listed in the core.notesRef and notes.displayRef variables (or corresponding environment overrides). See git-config(1) for more details.
With an optional <ref> argument, show this notes ref instead of the default notes ref(s). The ref is taken to be in refs/notes/ if it is not qualified.
Multiple --notes options can be combined to control which notes are being displayed. Examples: "--notes=foo" will show only notes from "refs/notes/foo"; "--notes=foo --notes" will show both notes from "refs/notes/foo" and from the default notes ref(s).
--no-notes
Do not show notes. This negates the above --notes option, by resetting the list of notes refs from which notes are shown. Options are parsed in the order given on the command line, so e.g. "--notes --notes=foo --no-notes --notes=bar" will only show notes from "refs/notes/bar".
--show-notes[=<ref>], --[no-]standard-notes
These options are deprecated. Use the above --notes/--no-notes options instead.
--show-signature
Check the validity of a signed commit object by passing the signature to gpg --verify and show the output.
--relative-date
Synonym for --date=relative.
--date=(relative|local|default|iso|rfc|short|raw)
Only takes effect for dates shown in human-readable format, such as when using --pretty. log.date config variable sets a default value for the log command(cqs --date option.
--date=relative shows dates relative to the current time, e.g. (lq2 hours ago(rq.
--date=local shows timestamps in user(cqs local time zone.
--date=iso (or --date=iso8601) shows timestamps in ISO 8601 format.
--date=rfc (or --date=rfc2822) shows timestamps in RFC 2822 format, often found in email messages.
--date=short shows only the date, but not the time, in YYYY-MM-DD format.
--date=raw shows the date in the internal raw Git format %s %z format.
--date=default shows timestamps in the original time zone (either committer(cqs or author(cqs).
--header
Print the contents of the commit in raw-format; each record is separated with a NUL character.
--parents
Print also the parents of the commit (in the form "commit parent..."). Also enables parent rewriting, see History Simplification below.
--children
Print also the children of the commit (in the form "commit child...").  Commits from the left side are prefixed with < and those from the right with >. If combined with --boundary, those commits are prefixed with -.
For example, if you have this topology:
y---b---b branch B / e / / . / / e o---x---a---a branch A
you would get an output like this:
$ git rev-list --left-right --boundary --pretty=oneline A...B >bbbbbbb... 3rd on b >bbbbbbb... 2nd on b <aaaaaaa... 3rd on a <aaaaaaa... 2nd on a -yyyyyyy... 1st on b -xxxxxxx... 1st on a
--graph
Draw a text-based graphical representation of the commit history on the left hand side of the output. This may cause extra lines to be printed in between commits, in order for the graph history to be drawn properly.
This enables parent rewriting, see History Simplification below.
This implies the --topo-order option by default, but the --date-order option may also be specified.
--show-linear-break[=<barrier>]
When --graph is not used, all history branches are flattened which can make it hard to see that the two consecutive commits do not belong to a linear branch. This option puts a barrier in between them in that case. If <barrier> is specified, it is the string that will be shown instead of the default one.
--count
Print a number stating how many commits would have been listed, and suppress all other output. When used together with --left-right, instead print the counts for left and right commits, separated by a tab. When used together with --cherry-mark, omit patch equivalent commits from these counts and print the count for equivalent commits separated by a tab.
If the commit is a merge, and if the pretty-format is not oneline, email or raw, an additional line is inserted before the Author: line. This line begins with "Merge: " and the sha1s of ancestral commits are printed, separated by spaces. Note that the listed commits may not necessarily be the list of the direct parent commits if you have limited your view of history: for example, if you are only interested in changes related to a certain directory or file.
There are several built-in formats, and you can define additional formats by setting a pretty.<name> config option to either another format name, or a format: string, as described below (see git-config(1)).  Notably, the SHA-1s are displayed in full, regardless of whether --abbrev or --no-abbrev are used, and parents information show the true parent commits, without taking grafts or history simplification into account.
h'-04'(buh'+03'c
format:<string>
The format:<string> format allows you to specify which information you want to show. It works a little bit like printf format, with the notable exception that you get a newline with %n instead of en.
E.g, format:"The author of %h was %an, %ar%nThe title was >>%s<<%n" would show something like this:
The author of fe6e0ee was Junio C Hamano, 23 hours ago The title was >>t4119: test autocomputing -p<n> for traditional diff input.<<
The placeholders are:
h'-04'(buh'+03'c
%H: commit hash
h'-04'(buh'+03'c
%h: abbreviated commit hash
h'-04'(buh'+03'c
%T: tree hash
h'-04'(buh'+03'c
%t: abbreviated tree hash
h'-04'(buh'+03'c
%P: parent hashes
h'-04'(buh'+03'c
%p: abbreviated parent hashes
h'-04'(buh'+03'c
%an: author name
h'-04'(buh'+03'c
%aN: author name (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%ae: author email
h'-04'(buh'+03'c
%aE: author email (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%ad: author date (format respects --date= option)
h'-04'(buh'+03'c
%aD: author date, RFC 2822 style
h'-04'(buh'+03'c
%ar: author date, relative
h'-04'(buh'+03'c
%at: author date, UNIX timestamp
h'-04'(buh'+03'c
%ai: author date, ISO 8601 format
h'-04'(buh'+03'c
%cn: committer name
h'-04'(buh'+03'c
%cN: committer name (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%ce: committer email
h'-04'(buh'+03'c
%cE: committer email (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%cd: committer date
h'-04'(buh'+03'c
%cD: committer date, RFC 2822 style
h'-04'(buh'+03'c
%cr: committer date, relative
h'-04'(buh'+03'c
%ct: committer date, UNIX timestamp
h'-04'(buh'+03'c
%ci: committer date, ISO 8601 format
h'-04'(buh'+03'c
%d: ref names, like the --decorate option of git-log(1)
h'-04'(buh'+03'c
%e: encoding
h'-04'(buh'+03'c
%s: subject
h'-04'(buh'+03'c
%f: sanitized subject line, suitable for a filename
h'-04'(buh'+03'c
%b: body
h'-04'(buh'+03'c
%B: raw body (unwrapped subject and body)
h'-04'(buh'+03'c
%N: commit notes
h'-04'(buh'+03'c
%GG: raw verification message from GPG for a signed commit
h'-04'(buh'+03'c
%G?: show "G" for a Good signature, "B" for a Bad signature, "U" for a good, untrusted signature and "N" for no signature
h'-04'(buh'+03'c
%GS: show the name of the signer for a signed commit
h'-04'(buh'+03'c
%GK: show the key used to sign a signed commit
h'-04'(buh'+03'c
%gD: reflog selector, e.g., refs/stash@{1}
h'-04'(buh'+03'c
%gd: shortened reflog selector, e.g., stash@{1}
h'-04'(buh'+03'c
%gn: reflog identity name
h'-04'(buh'+03'c
%gN: reflog identity name (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%ge: reflog identity email
h'-04'(buh'+03'c
%gE: reflog identity email (respecting .mailmap, see git-shortlog(1) or git-blame(1))
h'-04'(buh'+03'c
%gs: reflog subject
h'-04'(buh'+03'c
%Cred: switch color to red
h'-04'(buh'+03'c
%Cgreen: switch color to green
h'-04'(buh'+03'c
%Cblue: switch color to blue
h'-04'(buh'+03'c
%Creset: reset color
h'-04'(buh'+03'c
%C(...): color specification, as described in color.branch.* config option; adding auto, at the beginning will emit color only when colors are enabled for log output (by color.diff, color.ui, or --color, and respecting the auto settings of the former if we are going to a terminal). auto alone (i.e. %C(auto)) will turn on auto coloring on the next placeholders until the color is switched again.
h'-04'(buh'+03'c
%m: left, right or boundary mark
h'-04'(buh'+03'c
%n: newline
h'-04'(buh'+03'c
%%: a raw %
h'-04'(buh'+03'c
%x00: print a byte from a hex code
h'-04'(buh'+03'c
%w([<w>[,<i1>[,<i2>]]]): switch line wrapping, like the -w option of git-shortlog(1).
h'-04'(buh'+03'c
%<(<N>[,trunc|ltrunc|mtrunc]): make the next placeholder take at least N columns, padding spaces on the right if necessary. Optionally truncate at the beginning (ltrunc), the middle (mtrunc) or the end (trunc) if the output is longer than N columns. Note that truncating only works correctly with N >= 2.
h'-04'(buh'+03'c
%<|(<N>): make the next placeholder take at least until Nth columns, padding spaces on the right if necessary
h'-04'(buh'+03'c
%>(<N>), %>|(<N>): similar to %<(<N>), %<|(<N>) respectively, but padding spaces on the left
h'-04'(buh'+03'c
%>>(<N>), %>>|(<N>): similar to %>(<N>), %>|(<N>) respectively, except that if the next placeholder takes more spaces than given and there are spaces on its left, use those spaces
h'-04'(buh'+03'c
%><(<N>), %><|(<N>): similar to % <(<N>), %<|(<N>) respectively, but padding both sides (i.e. the text is centered)
Note
Some placeholders may depend on other options given to the revision traversal engine. For example, the %g* reflog options will insert an empty string unless we are traversing reflog entries (e.g., by git log -g). The %d placeholder will use the "short" decoration format if --decorate was not already provided on the command line.
If you add a + (plus sign) after % of a placeholder, a line-feed is inserted immediately before the expansion if and only if the placeholder expands to a non-empty string.
If you add a - (minus sign) after % of a placeholder, line-feeds that immediately precede the expansion are deleted if and only if the placeholder expands to an empty string.
If you add a ` ` (space) after % of a placeholder, a space is inserted immediately before the expansion if and only if the placeholder expands to a non-empty string.
h'-04'(buh'+03'c
tformat:
The tformat: format works exactly like format:, except that it provides "terminator" semantics instead of "separator" semantics. In other words, each commit has the message terminator character (usually a newline) appended, rather than a separator placed between entries. This means that the final entry of a single-line format will be properly terminated with a new line, just as the "oneline" format does. For example:
$ git log -2 --pretty=format:%h 4da45bef e | perl -pe *(Aq$_ .= " -- NO NEWLINEen" unless /en/*(Aq 4da45be 7134973 -- NO NEWLINE $ git log -2 --pretty=tformat:%h 4da45bef e | perl -pe *(Aq$_ .= " -- NO NEWLINEen" unless /en/*(Aq 4da45be 7134973
In addition, any unrecognized string that has a % in it is interpreted as if it has tformat: in front of it. For example, these two are equivalent:
$ git log -2 --pretty=tformat:%h 4da45bef $ git log -2 --pretty=%h 4da45bef
Part of the git(1) suite


Home
Cadastrar novo veículo
1. new offer
2. preview
3. submit
Sell
your vehicle
Dados do
veículo
*
Fabricante:
Select
Audi
Mercedes-Benz
BMW
Lexus
Lincoln
Ford
Fiat
Dodge
*
Modelo:
Select
R8
S500
540i
RX300
Navigator
Taurus
Doblo
Viper
*
Ano Fabricação:
Select
2013
2012
2011
2010
2009
2008
2007
2006
*
Ano Modelo:
Select
Sedan
Coupe
SUV
Hatchback
Tagra
*
Combustível:
Select
92
95
Diesel
*
Transmissão
Selecionar
Automatica
Mecanica
*
Portas:
Selecionar
2
3
4
5
*
Motor:
Selecioar
1500
2000
2500
3000
4000
*
Hp / Kw:
Selecionar
50
60
70
80
90
100
*
VIN / chassis number:
*
Cor:
Select
Red
Green
Blue
Grey
White
Black
Acessórios
Vehicle
registration
*
Country of Origin:
Select
Germany
Great Britain
USA
China
Japan
Russia
Ukraine
*
Country of registration:
Select
Germany
Great Britain
USA
China
Japan
Russia
Ukraine
*
Date of first registration:
Month
2013
2012
2011
2010
2009
2008
2007
2006
*
Body Type:
Year
Sedan
Coupe
SUV
Hatchback
Tagra
Technical
condition
*
Technical condition:
Select
Technical condition
Technical condition
*
Kilometers:
Euro type:
Month
Euro type
Euro type
Euro type
CO2 emissions:
Vehicle
price
*
Price:
*
Currency:
Euro
USD
Price Negotiable
Vehicle
photos
upload photo
upload photo
upload photo
upload photo
upload photo
upload photo
Seller
details
*
Name:
*
Phone:
*
Phone 2:
*
City:
Country:
Select
Germany
Great Britain
USA
China
Japan
Russia
Ukraine
State:
Select
Germany
Great Britain
USA
China
Japan
Russia
Ukraine
*
E-mail:
*
Password:
I agree to the Terms and Conditions


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Serves 6
Serve this classic French quiche Lorraine with a green salad and your favourite chutney. A delicious treat at home or for a picnic.
For the shortcrust pastry, put the flour, butter and a pinch of salt in a food processor and process briefly.
Add half of the beaten egg and continue to process. (You might add a little more egg, but not too much as the mixture should be just moist enough to come together.) If making the pastry by hand, rub the butter into the flour until it resembles coarse breadcrumbs then, using your hands, add just enough egg to bring it together.
With your hands, flatten out the ball of dough until it is about 2cm/¾in thick, then wrap it in cling film or place it in a plastic bag and leave in the fridge for at least 30 minutes or, if you are pushed for time, in the freezer for 10–15 minutes, before using.
Preheat the oven to 180C/350F/Gas 4.
Line a 19cm/7½in high-sided tart tin with the shortcrust pastry and cover the base with baking parchment. Fill the tin with baking beans and bake blind for 10-15 minutes. Remove the beans and parchment for the last five minutes of baking for a golden-brown crust.
For the filling, heat the oil in a frying pan and cook the bacon for 5-6 minutes, or until crisp. Remove and drain on kitchen paper. Fry the onions gently in the same oil for a further ten minutes, or until softened.
Meanwhile, whisk the two whole eggs and two egg yolks in a medium-sized bowl. Add the cream, herbs, cheeses and bacon and onions. Mix well and season with salt and freshly ground black pepper.
Pour the filling into the pastry base and return to the oven to bake for 30–40 minutes, or until the centre has set. Serve warm with a green salad and relish.


{% extends 'layout.server.view.html' %} {% block content %} Hello, and welcome to room {{ roomNo }} Date Time Period Contact {% for reservation in reservations %} {{ reservation.day }} - {{ reservation.month }} - {{ reservation.year }} {{ reservation.period}} {{ reservation.contactEmail}} {% endfor %} {% endblock %}


#top-30 #left-50 did it matter #linebr #linebr #left-10 that #left-20 #top-35 much #pause #left-40 #top-43 anyway?
#top-29 #left-16 Quadtrip #left-25 presents #pause #linebr #top-42 #left-45 Observer #linebr #left-40 for #left-41 #top-47 Vortex 2017
#top-50 #left-8 the world #pause #linebr #left-18 ripped #left-23 out #pause at the seams #pause #pause #pause #linebr #linebr #left-24 #top-49 collapsed inward #left-68 #top-40 on itself
#top-47 #left-35 pieces #top-41 scattered #top-56 off #top-20 #left-60 into #left-66 the #left-70 depths
#top-20 #left-30 planting broken seeds #pause #pause #pause #linebr growing mucous memberanes and oily leaves #top-32 #left-1
ball and lines shader #left-60 branch
#top-25 #left-10 other shaders , main code design #left-60 visy
#top-40 #left-25 music and sync #left-65 zov
#top-5 #left-40 Quadtrip logo #left-50 Isildur^Samar
#top-25 #left-20 models cosmicollie maali
#top-45 #left-45 anyway,


Before Change
__base = "OutStreamManager"
__interFaceDict = {}
for classObj in utils.getAllSubclasses(eval(__base)):
//// As long as these subclasses follow the pattern of starting with OutStream
//// this will appropriately key them to a more user-friendly name without the
//// need for them to redudantly prepend "X" as "OutStreamX"
After Change
// Interface Dictionary (factory) (private)
__base = "OutStreamBase"
__interFaceDict = {
"Print": FilePrint,
"Plot": GeneralPlot,
// "DataMining": DataMining,
// "VDCComparison": VDCComparison,
}
def knownTypes():
Returns a list of strings that define the types of instantiable objects for


Edtech Marine Services provides all types of vessels to repair.
Edtech Marine can arrange major repairs, modifications and conversions. Edtech Marine can provide engineers, supervisors and all types of repairs squad to undertake any type of voyage repairs / services on the vessel.
Edtech Marine can arrange for Engineering & Marine Superintendent to supervise & act as owner's representative for any shipping related activity.
Government approved slop/Bilge water disposal can be arranged. Edtech Marine undertakes tank cleaning works & disposal of sludge.
EDTECH LIFE SAVING / FIRE FIGHTING PRODUCTS
1. Ms Wendy Wong, Marketing Executive
Tel: +65 6397 5980
Fax: +65 6397 5981
2. Mr Jagjit Singh, Director
HP: +65 98289531
EDTECH STORES / SPARES
SUPPLY
1. Ms Llanie, Purchase Manager
Tel: +65 6397 5980
Fax: +65 6397 5981
2. Mr Jagjit Singh, Director
HP: +65 98289531
EDTECH ENGINEERING / SAFETY & AUTOMATION
Mr Saini Singh, Engineer
Tel: +65 6397 5980
Fax: +65 6397 5981
EDTECH AGENCY/IT
SERVICES
1.Mr LP Singh, Agency Manager / IT Specialist
Tel: +65 6397 5980
Fax: +65 6397 5981
2.Mr Jagjit Singh, Director
HP: +65 98289531


Week of Hacks
Description of WOH, including how to get involved, contact
information, maybe some names, places, or events.
Week of Hacks
Description of WOH, including how to get involved, contact
information, maybe some names, places, or events.
Week of Hacks
Description of WOH, including how to get involved, contact
information, maybe some names, places, or events.
Week of Hacks
Description of WOH, including how to get involved, contact
information, maybe some names, places, or events.


Rock, Paper, Scissors
Player Name
Start
Waiting for Player One...
ROCK
PAPER
SCISSORS
WINS:
N/A
LOSSES:
N/A
Waiting for Player Two...
ROCK
PAPER
SCISSORS
WINS:
N/A
LOSSES:
N/A
Type Your Message!


--- title: "Contact" date: 2019-12-17T16:34:31-07:00 draft: false weight: 600 --- Contact us<EMAIL_ADDRESS>353 East 200 South Suite #201, Salt Lake City, UT 84111 Discord Chat
<EMAIL_ADDRESS>353 East 200 South Suite #201, Salt Lake City, UT 84111


Historians recognize lesser known Boston Tea Party colonists
WORCESTER, Mass. (AP) - Historians in Massachusetts have recognized two Boston Tea Party participants.
The Telegram & Gazette reports historical reenactors and Boston Tea Party Ships & Museum representatives placed plaques Thursday on the Worcester graves of Peter Slater Jr. and Benjamin Tucker Jr. The museum’s Evan O’Brien says they were “just as important to our region’s history as Paul Revere, Samuel Adams, John Adams, and John Hancock.”
American colonists protesting “taxation without representation” in December 1773 dumped 340 chests of imported tea into Boston Harbor, a key event leading to the American Revolution.
O’Brien says not much is known about the more than 100 believed participants, but a large percentage were common tradesmen, young adults and apprentices. The museum hopes to mark known participants’ graves before the event’s 250th anniversary in 2023.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


A genome-wide inversion associated with a genome specific insertion into the joints observed between two genome sequences Neisseria meningitidis strains Z2491 and MC58. This polymorphism is schematically illustrated in the upper left quadrant, in which the two regions specifically inserted into the MC58 genome are indicated by black solid line and dotted line, respectively, along the vertical axis. Two duplicated segments are also found at the joints of these insertions, which are indicated by the red and blue arrowheads, respectively.
This structure is easily seen by CGAT using the function for independent scaling of the horizontal or vertical axis. In the lower left quadrant, zooming the vertical axis clearly shows the presence of a MC58-specific insertion between the boundaries of the inversion sites, while in the upper right quadrant, zooming the horizontal axis shows the presence of two duplicated segments in the MC58 genome at the joints of the inversion. Whereas the difference between these structures is quite clear in these figures, it is difficult to distinguish them on the global view of the dotplot display shown in the lower right quadrant.
A plausible explanation for the formation of this polymorphism is given in the paper.
Reference: Kawai, M., Nakao, K., Uchiyama, I, and Kobayashi, I. (2006), How genomes rearrange: genome comparison within bacteria Neisseria suggests roles for mobile elements in formation of complex genome polymorphisms. Gene, in press.
The figure was provided by M. Kawai.


It is reviewed by seeing all the aspects,which colleges should have in their campus.
Cut-Off of last year of all the colleges listed in the state of Maharashtra.
Go through all the blogs for all the important information you should know.
If you have any doubts or queries ask them here.


Oh c'mon you can do it!
Really?
Geez.....
This is embarassing.
I'll put you out of your misery.


Rrerequisite
How to apply self-defined theme or config to this plugin
First implement the ADKTheme or ADKConfig protocol, then set it to HDKContext singleton before using this plugin
Descriptions of ADKTheme's parameters
Default theme is ADKDefaultTheme
| Var. | Description |
|---|---|
| description | - |
| mainColor | background color of floating button and all viewcontrollers' navigation bar initialized by applying method applyADKNavigationBar of UIViewController extension |
| fontColor | text color of all texts on build-in viewcontroller's navigation bar |
| floatingButtonSize | - |
| floatingButtonText | - |
| floationButtonTextColor | - |
| floationButtonFontSize | - |
Descriptions of ADKConfig's parameters
Default config is ADKDefaultConfig
| Var. | Description |
|---|---|
| storyboardName_phone | storyboard file name of iPhone,leave empty if current device is iPad |
| storyboardName_pad | storyboard file name of iPad,leave empty if current device is iPhone |
| rootPageConfigFileName | config file name of plugin's root viewcontroller |
| settingPageConfigFileName | config file name of plugin's setting viewcontroller |
| storyboardName | storyboard name of current platform |
| storyboard | storyboard instance of current platform |
| rootPageCellReuseID | - |
| defaultItems | default build-in items, like guideItem and settingItem |
Description of root config file
Demo file : HDKRootConfig.plist
| Field | Required | Type | Comment |
|---|---|---|---|
| title | true | String | cell item title |
| segueID | false | String | segue identifier of cell click action in the plugin storyboard |
| controllerName | false | String | full classname of the viewcontroller you want to push without storyboard, like AnwDebugKitDemo.HDKTest2ViewController |
| controllerID | false | String | controller id in the external storyboard |
| controllerContainer | false | String | name of the external storyboard which holds the viewcontroller you want to push |
Description of setting config file
Demo file : HDKSettingConfig.plist
| Field | Required | Type | Comment |
|---|---|---|---|
| title | true | String | cell item title |
| type | true | String | one cell type of below: ADKCellTypeDetail ADKCellTypeInput ADKCellTypeSwitch ADKCellTypePlain ADKCellTypeAsync |
| action | false | String | string name of the selector which will response to the cell action |
| defaultValue | false | String | string name of the selector which will response to the cell default value action |
How to register a event handler of setting viewcontroller
First implement a class which contains all the selectors defined in setting config file, refer to demo class HDKSettingEventHandler , then register it using ADKSettingCellEventCenter.register(eventHandler: HDKSettingEventHandler.init())
Selector name of a selector
| selector | selector name |
|---|---|
| func testSelector1() -> Any | testSelector1 |
| func testSelector2(_ param: Any) -> Any | testSelector2: |
| func testSelector3(with param: Any) -> Any | testSelector3With: |
| func testSelector4(with param1: Any, and param2: Any) -> Any | testSelector4With:and: |


Editor
Authors:
This is a W3C Working Draft for review by W3C members and other interested parties. It is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to use W3C Working Drafts as reference material or to cite them as other than "work in progress". A list of current W3C working drafts can be found at: http://www.w3.org/TR/
This document represents a work in progress. It is not intended to be advanced toward W3C recommendation status, but rather it will be used, along with the P3P Architecture Working Draft, as a basis for developing the Protocols and Data Transport Working Group's deliverable of a specification, fully specifying the conversational framework for user-agent/service interaction. It is strongly recommended that only experimental software be implemented to this specification. The Platform for Privacy Preferences Project will not allow early implementations to affect their ability to make changes to the framework described in this document.
Comments on this working draft should be sent to the P3P Project Manager, Philip DesAutels
This document is part of the Platform for Privacy Preferences Activity.
The W3C Platform for Privacy Preference Project Vocabulary Working Group presents this basic model for the P3P privacy conversation between a user agent and a service.
The purpose of this document is to specify:
The P3P Architecture Working Group has produced a draft document which provides a general overview to the P3P architecture.
| Access | For P3P purposes, a clause that expresses the ability of users to obtain and correct information that an entity has collected about them. A vocabulary may define various degrees of access. |
| Agreement | A statement that a service and a user agent have agreed to abide by. |
| Clause | The "parts of speech" from which P3P statements are constructed. |
| Credentials | Signed statements of authorization, identification, or practice (e.g. certificates granting authority or identity, or signed metadata). These credentials may be presented or be requested by either the user agent or the service. Credentials need not be accompanied by digital signatures. |
| Data category | A quality of a data element or class that may be used by a trust engine to determine what type of element is under discussion (for example anonymous demographics or personal contact information). |
| Data class | A grouping of data elements such as mailing address (which includes, e.g., name, street address, city, state, and country). |
| Data element | A single data entity such as last name or phone number. |
| Grammar (P3P) | In P3P, the grammar defines the structure of P3P clauses used
to make a valid P3P statement. The grammar are the rules for properly ordering clauses.
The following example structures clauses (in caps) to make a simple privacy practice
statement: for (these URIs) Also see grammar at Princeton's Free On-line Dictionary of Computing. |
| P3P data repository | A mechanism for storing data under the control of P3P preferences over a period of time. These data might include personal data. |
| Permissions | Permissions are constraints which, when evaluated, allow or prevent access or modification of data classes or elements within the data repository of a user agent. Permissions are set by a service and evaluated along with a user's preferences. Thus permissions serve only to restrict actions permitted by a user's preferences; they never allow actions that the user's preferences would otherwise prohibit. |
| Persona | A persona is an image of a user that he or she presents in a particular situation. The user's preferences and P3P data may combine to form a persona. A user may have multiple personae. The choice of which persona to present to a service may be based upon the service's purpose (e.g., business, gaming, home, etc.), credentials (e.g., level of associated trust), consequences and practices (e.g., personalization, shipping, mailing list), or any user defined rationale (e.g., time of day, phase of moon, etc). |
| Policies | The collection of all user defined preferences, including, but not limited to, P3P preferences. |
| Practice | A P3P clause that describes what a service plans to do with data. |
| Preference | A rule, or set of rules, that determines what action(s) a
user agent will take or allow when involved in a conversation or negotiation with a
service. A preference might be expressed as a formally defined computable statement; e.g.,
a PICSRules rule. In this document, preferences govern the types of agreements that can be
reached between a user agent and a service. Within this document, "preferences" are assumed to be P3P preferences. |
| Proposal | A series of statements. A proposal is used when a user agent and a service are negotiating to form an agreement. |
| Request | A message in which a service asks a user agent to transmit (read request) or store (write request) a data element or set of data elements. |
| Result set | The user's data sent to the service by the user agent. |
| Service | A program, for P3P purposes, requesting data from, or providing data to, a user agent. By this definition, a service may be a server, a local application, a piece of locally active code, such as an ActiveX control or Java applet, or even another user agent. |
| Statement | A description of what data a service will request, what the service will do with it, and the consequence to the user. P3P statements are composed of clauses, as specified by the P3P grammar. |
| Trust Engine | A mechanism for evaluating credentials and policies to make a decision. For P3P purposes, the trust engine evaluates P3P proposals and requests, user preferences, and possibly other credentials. |
| User | An individual or group of individuals acting as a single entity. For the purposes of this document, the user is further qualified as an entity for which personal data exists and/or can be collected. |
| User agent | A program that acts on a user's behalf. The agent may act on preferences (rules) for a broad range of purposes, such as content filtering, trust decisions, or privacy. For P3P purposes, a user agent acts on a user's privacy preferences. Users may use different user agents at different times. |
| Vocabulary (schema) | The defined set of words or statements that are allowable in a clause. For instance, a vocabulary may define the practice clause to be one of the two values: 'for system administration', 'for research'. |
In this section we present a data design model for expressing and referencing data elements, classes, and categories.
A data element is a single data entity such as a last name or phone number. A data class is a named set of data elements and/or other data classes. Data classes inherit the data elements from all classes they contain. While most data elements correspond to a specific piece of information that can be stored as a text string, some data elements represent streams of data such as a user's click stream.
There is a base set of well known P3P data classes (to be defined by a future working group). Neither user nor service can change a base data class. This restriction allows for a common understanding between user agent and service that can simplify the negotiation process. However, new classes may be introduced by services. A future P3P working group will recommend a RDF application for defining data elements and data classes.
In an attempt to minimize the problem of duplicate information and to allow for the advantages of standardization, the following naming conventions are proposed:
While these standards will aid in creating some consistency between services and user agents, the possibility for duplication of information will still arise when there are requests for the same information using unknown names (e.g., Size_Of_Shoe). In some cases, this data may already exist under a different heading (i.e., Shoe_Size). In other cases, there is no duplication, just a new request. The user agent implementation may provide the user with assistance in determining whether to use an already stored value, create a new data element, or create a name space replication containing a different value.
A result set is a set of data elements sent by a user agent to the service as a result of a request. Result sets contain traditional value pairs wherein one half of the pair describes the value and the other is the value itself. P3P data repositories may store data in a similar manner, however this will be implementation dependent.
User agents may also provide users with the ability to create their own groupings of data elements, for example groups of elements over which the user has similar preferences. However, this is an implementation detail left up to each implementor.
A data category is a quality of a data element or class. The data category is a hint to the agent regarding the type or sensitivity of a data element that is unrecognized by the agent. For instance, an agent encountering the previously unknown data element shoe_size can see that the data element has been categorized by its creator as demographic data. This can then simplify the user interface and the resulting user experience. User agents may allow users to express preferences about individual data elements, data classes and data categories. When a service proposes to request a data element, the agent can check whether the user has expressed a preference about that particular element. If so, the agent would follow that preference, otherwise the agent can check the user's preferences over the category to which that element belongs. Thus categories can be used to reduce the number of choices users must make while browsing.
Designers of new data class schemas should use data categories to give hints to the user or the user agent about the characteristics of the data. However, users should have the option to over-ride or distrust the hints provided by the service.
A data class or element can be described by multiple categories. A data class should be inherit at least the categories of the contained elements. So for instance, if a data class contains demographic and contact information elements, the class should be described as such. The grouping of elements into a class may also deserve an additional categorization. For instance, a first name or last name alone are not identifiable information, but together they may be.
[The necessity of the data categories was considered to be questionable among some members of the working group. However, others felt strongly that data categories would be important for maintaining a seamless user experience.]
This section describes the grammatical model for proposals and requests. P3P will define the syntax for a proposal, other parties will describe specific vocabularies for use in P3P proposals. The Harmonized Vocabulary Working Group will document the issues related to the development of a uniform vocabulary and may recommend a single vocabulary if such a vocabulary can be agreed to by the working group. All statements made by the user agent or service as part of the negotiation are to be defined by the Protocols and Data Transport Working Group; we expect the results of this working group to closely follow the grammatical model proposed here.
Services make proposals to user agents in which they specify one or more sets of terms under which they are willing to grant the user access. Each set of terms is expressed as a statement.
Proposals must include a schema, one or more statements, and optionaly any of the following statement clauses applied globally to the entire proposal: experience space, contact, agreement with, access, consequence, qualifier, and signature. Each of these clauses is described in detail below.
The general form of a proposal is:
using schema
(for some experience space)
(you will enter an agreement with this entity)
(Statement)+
They will offer:
(this access)
(and this qualifier)
(Accepting will give you this consequence)
(for more information, contact)
(Signature)
Statements are composed of the following mandatory clauses: experience space, practice, qualified data set. Statements might also include the following optional clauses: qualifier, access, consequence, agreement_with, contact. These clauses are further specified below. The proposed protocols and negotiation working group will also determine any additional syntax that might be needed for combining statements into proposals.
The general form of a statement is:
(for some experience space)
(you will enter an agreement with this entity)
who will apply this (practice to (qualified data set)+
(with qualifier)*
(with access)
)*
(Accepting will give you this consequence)
(for more information, contact)
(Signature)
The general form of a qualified data set is:
named set of data
falling into this (category)+
using data schema
Apply the access permission restriction
(and this qualifier)
In pseudocode, this might look something like:
<ablock id="proposal"> <namespace href="http://www.w3.org/P3_1.0/" as="P3"/> <p3::schema>"http://www.ipwg.org/P3_1.0/"</P3::schema> <P3::for_include>"http://www.w3.org"</P3::for_include> <P3::agreement>"http://www.w3.org/DSig/x509v3/","W3CCert"</P3::agreement> <P3::access>"http://www.w3.org/DataAboutYou"</P3::access> <P3::consequence>"http://www.w3.org/WhatYouGet"</P3::consequence> <P3::contact>"mailto:sally@w3.org"</P3::contact> <ablock id="statement1"> <ablock id="data1"><P3::practice>3</P3::practice> <P3::data_schema>"OPS2"</P3::data_schema> <P3::named_data>"contact information"</P3::named_data> <P3::permissions>"W3CCert","Read" <P3::qualifier>"Required"</P3::qualifier></ablock> <ablock id="data2"><P3::practice>3</P3::practice> <P3::data_schema>"OPS2"</P3::data_schema> <P3::named_data>"computer information"</P3::named_data> <P3::permissions>"W3CCert","Read" <P3::qualifier>"Optional"</P3::qualifier></ablock> </ablock> </ablock> <ablock href="#proposal1" id="signature"> <namespace href="http:www.w3.org/PICS/DSig_Schema/pkcs7V2_0/" as="pkcs7"> <pkcs7::key>.....</pkcs7::key> <pkcs7::sig>.....</pkcs7::sig> </ablock>
This grammar specifies the ordering and structure of the clauses. However, some clauses may be further specified. The table below provides a brief description of each clause. The clauses are further explained in following the table. The rest of the document specifies further details about each of the clauses.
The following table briefly describes the clauses specified by the grammar. The following text are descriptions of the column headings.
| Clause | Description | Applies to | Required in Every Proposal | Default Type of Label | May be Defined in Vocabulary |
| Access | The ability of users to obtain and correct information that an entity has collected about them | proposal or statement | yes | URI or text string | yes |
| Agreement With | The entity who the user is entering into an agreement with | proposal or statement | yes | certificate, URI, or text string | yes |
| Consequence | The impact on the user of reaching an agreement | proposal or statement | yes | URI or text string | yes |
| Contact | Information for contacting a service with inquiries about the services privacy practices. | proposal or statement | yes | URI or text string | yes |
| Experience Space | The space where a particular statement is valid | proposal or statement | yes | set of URIs | no |
| Practice | What a service will do with data | statement | yes | none | yes |
| Qualified Data Set | The data a service proposes to collect or requests | statement | yes | see definition below | no, but qualifier and category components may be |
| Qualifier | Used by the creator of a vocabulary to provide extra functionality beyond that in the base P3 Proposal Grammar | proposal, statement, or clause | no | none | yes |
| Required | A binary value indicating whether a particular practice, qualified data set, or statement is required in an agreement | practice clause, qualified data set clause, or statement | no (defaults to 1 when not present) |
0 or 1 | no |
| Schema | A URI that identifies a particular P3 proposal vocabulary | proposal | yes | URI | no |
| Signature | Signature and attribution information as defined by the Digital Signature effort | Proposal or statement | no | none | yes |
The P3P clauses are described in more detail below. Please note that much of the specification is incomplete. Also note that some of the working group members expressed concern about the complexity of the grammar and suggested that the non-essential clauses be eliminated. In particular, questions were raised about the necessity of the qualifier and required clauses, and the categories and permissions within the qualified data sets. The majority of the group members felt that while these clauses are probably not essential, they are sufficiently useful that they should be retained in the grammar.
An access clause expresses the ability of users to obtain and correct information that an entity has collected about them. A vocabulary may define various degrees of access, for example 'view' and 'correct'. Access clauses should include a label that contains or references specific information about how to obtain access. They either take the form of a URL which can be dereferenced to provide the information or a text string which provides the information directly.
Example:
<P3P::access>view, "http://www.w3.org/DataAboutYou"</P3P::access>
This is the entity with whom the user is entering into the agreement with. It can either be expressed as a certificate identifying the entity, a URI which when dereferenced identifies an entity, or text identifying an entity. There must be at least one agreement clause in a proposal. The resulting agreement is between the superset of all parties named in the agreement clause and the user.
When these clauses contain certificates they take the form "schema","data". The schema defines the data that will follow it. For example, an agreement clause indicating the party identified by the certificate "W3CCert" would look like:
<P3P::agreement>"http://www.w3.org/DSig/x509v3/","W3CCert"</P3P::agreement>
where "http://www.w3.org/DSig/x509v3/" indicates the schema of the data which follows, in this case an X509v3 certificate as defined at http://www.w3.org/DSig/x509v3/ and "W3CCert" is the identity certificate for W3C.
The party specified in the agreement with clause should not be confused with any of the other parties who may be mentioned in a proposal, for example, parties associated with the experience space or parties associated with a signature.
Consequence clauses are labels that provide information about the impact on the user of reaching an agreement. Consequence clauses may take the form of a URI which can be dereferenced to provide the information, a text string which provides the information directly, or labels enumerated by a vocabulary. An example consequence would be a value added service such as customized information, or a coupon, or rebate.
Contact clauses are labels that provide information for contacting a service with inquiries about the service's privacy practices. Contact clauses either takes the form of a URL which can be dereferenced to provide the information or a text string which provides the information directly. A vocabulary may place further restrictions on a contact clause.
An experience space identifies the space where a particular statement is valid, not necessarily with whom the user is having the interaction with. This experience space is identified by a set of URIs as defined in RFC 1738. This set is made up of included and excluded URIs. For example, the service w3.org may wish to make a statement about its entire experience space (http://www.w3.org) minus its user registration area (http://www.w3.org/registration) and minus its mailing list area (http://www.w3.org/maillist). In pseudo-RDF:
<ablock> <namespace href="http://www.w3.org/P3/FOR_Schema/" as="FOR"/> <FOR::include>"http://www.w3.org"</FOR::include> <FOR::exclude>"http://www.w3.org/registration"</FOR::exclude> <FOR::exclude>"http://www.w3.org/maillist"</FOR::exclude> </ablock>
The experience space indicates to the user agent (and user) where the stated practice is in effect. The method for determining and informing the user about which practice is in effect as they browse the Web is very important but implementation dependent. For instance, a smart agent would be able to remember for which set of URIs a given agreement applies. A dumb agent with no memory may have to ask for a new agreement as it encounters each new URI. However, under no circumstances should the user be misled that their privacy preferences are being acted upon when this is not the case. Consequently, framed content or included GIFs from outside an experience space may require their own practice statements.
A service can state a general practice for its entire experience space that excludes any pages within that space that have different practices. Upon encountering such a page, a new agreement must be reached.
A practice clause describes what a service will do with data. The practice clause, as defined in the vocabulary schema, is mandatory in every statement. It is applied to one or more qualified data sets.
Example: A vocabulary might define practices such as 'used to complete the transaction', 'used to customize content', or 'disclosed for marketing purposes'.
The Required clause is a binary value that indicates whether a particular practice, qualified data set, or statement is required in an agreement. When practice clauses, qualified data sets clauses, and statements are not modified by a required clause, they are assumed to be required by default (required = 1).
Note, the required clause is useful mostly as a short-hand or macro. Without this clause, a service that was willing to enter into one of many different agreements with a user would have to enumerate all the agreements. With this clause, such a service can indicate all optional elements of each agreement with a required = 0.
A qualified data set identifies the data that is being referenced in a statement. It consists of :
Permissions are constraints which, when evaluated, allow or prevent access or modification of data classes or elements within the data repository of a user agent. Permissions are set by a service and evaluated along with a user's preferences. Thus permissions serve only to restrict actions permitted by a user's preferences; they never allow actions that the user's preferences would otherwise prohibit.
Permissions may only be set or changed as the result of an agreement between a user agent and a service, and changes may only be made when they do not conflict with previously set permissions.
A permission rule has the following syntax:
<action>*
The action specifies whether the rule is for read-only access or read/write access. (Read/write access is permission for a service to store data in a user's P3P data repository.)
Alternatively, a permission rule might have the following syntax:
<action>*<restriction>
The restriction is a statement in the P3P preference interchange language (to be specified by a future working group) that restricts access to the data element. For example, the restriction might prohibit services other than the one that wrote a data element from reading it.
The working group did not reach an agreement on whether the restriction syntax is necessary, and is thus not recommending one syntax over the other at this time. Arguments in favor of the restriction syntax focussed on greater flexibility, and speculation that this syntax would facilitate and encourage services' storing unencrypted data in the user's data repository (something that was viewed as desirable from a privacy perspective). Arguments against the restriction syntax focussed on added complexity, and speculation that services would be unlikely to trust user agents to enforce a service's policy and would thus encrypt any proprietary data stored in a user's data repository any way. It is unclear at this point how much complexity this syntax would add to a P3P implementation or whether it has other useful applications.
Qualifier
A qualifier clause is used by the creator of a vocabulary to provide extra functionality beyond that in the base P3P Proposal Grammar.
Example: Vocabulary creators might wish to include a qualifier clause that would allow assertions about the length of time a particular piece of data will be retained.
The schema clause consists of a URI that identifies a particular P3P proposal vocabulary. A single schema applies to an entire proposal. A schema must be identified for a proposal.
example: "http://www.ipwg.org/P3_1.0/"
This is the signature and attribution information as defined by the W3C Digital Signature effort. A signature on a proposal indicates that the signer believes the statements in the proposal are true.
After an agreement is reached between a service and user agent, the service may request that the user agent transmit a data element. All requests must reference a particular agreement. Requests should only be granted by a user agent if they are consistent with the referenced agreement (for example, if there is an agreement that the user agent will provide only the user's zip code and the user agent requests the user's phone number, the request should be denied). A future working group is expected to determine the syntax for requests. We expect requests to include a reference to an agreement, a list of data elements requested, reference to a transport protocol, and reference to a mechanism for prompting the user for that information.
There are two vocabularies which can be defined within the P3P framework. The first is the data category vocabulary, and the second is the proposal vocabulary. A proposal vocabulary may define one or more of the clauses used in proposals (such as privacy practices, access, schema, qualifier, etc.). The data category vocabulary defines the list of data categories that describes data elements.
A future working group will recommend a detailed specification for the RDF syntax of these vocabularies.
It is proposed that there should be a certain number of base data elements provided with every privacy user agent. These base data elements may closely follow those commonly in use today by such mechanisms as VCard. However, there may be data elements contained within the VCard schema that are considered "rarely used", such as home pager, and should probably not be required as part of the base set.
Further, the base set should probably contain data elements not found within the VCard schema, such as some anonymous demographics. These data elements represent frequently asked marketing questions that do not require personally identifiable information.
Note: When designing the base schema it should be kept in mind that either the user agent or the service may expand the data elements hosted on the users machine. This implies that the number of base elements should be kept to a reasonable minimum rather than attempting to "guess" what elements both user and service would want.
It is up to user agent implementors to determine the level of detail at which end users will be able to specify their preferences. However, we recommend that user agents allow users to express preferences over all types of clauses contained in the P3P grammar.
Copyright © 1997 W3C (MIT, INRIA, Keio ), All Rights Reserved. W3C liability, trademark, document use and software licensing rules apply.
Webmaster 28 Oct 97


Iron(Fe) is an opinionated yet flexible Front End development framework.
The goal is for Iron(FE) to be a foundation for projects. As a foundation, Iron(Fe) is just the beginning. Iron makes some foundational decisions, then the developer has the freedom to go in many directions. I want to give front end developers who work with AEM access to the same tools I have when working outside AEM.
LumberJack is a modern client side-logging framework. The problems addressed with LumberJack are:
This is an open source project still in process.
I have a more great projects I would love to share with you. Unfortunatly I am bound by contract to keep them private. Please contact me for the password.


2 Chainz Wants To Know How Bad You Want A Future Collabo: “What Should We Call It”
by Rosario HarperAtlanta rapper 2 Chainz is ready to put some serious audio power together. The hip-hop veteran has hinted at a possible Future collaboration brewing up.
This week, Deuce jumped on Instagram with a shot of himself flexing alongside Future Hendrix.
In August, rap star T.I. co-signed the possibility of Future and Chainz linking up for new tunes.
The same week, Chainz teased fans with pics of himself alongside Future.
Back in 2011, Future and 2 Chainz talked about working together on a collaborative project.


--- section_names: [sections, grouping-content, text, code, edits, form, lists, table, modules, layouts] ---
This style guide helps me preserving consistency over the code and the general design of the project. The idea is to gather here all the designed parts and get a quick overview.
Background
Borders
Footer text
Text
Links
Information
Validation
Danger
Warning