[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Gnu-arch-users] Bazaar 1.1
From: |
Robert Collins |
Subject: |
[Gnu-arch-users] Bazaar 1.1 |
Date: |
Wed, 19 Jan 2005 20:05:54 +1100 |
Bazaar 1.1 has been released.
The release includes:
* Aaron Bentlys arch cache.
* Many UI changes
* Archive caching of ancestry data to improve checkout and revision library
searching performance.
Some key UI changes
Many community patches incorporated.
Bazaar format archives are supported equally with tla format archives.
Where to get Bazaar ?
The Bazaar homepage at http://bazaar.canonical.com/ lists binary and source
locations for bazaar.
Key UI changes:
==============
* 'tree-lint' is now 'lint'.
* 'lock-revision' can take either a version or a revision, and will do the
right thing if given a version.
* gettext has been incorporated for translations. (Thanks! to the translators!)
* 'missing' now shows all logs in fully qualified form, making it easier to use
in piping situations.
* 'tree-id' a new command, gives the current tree-patchlevel (equivalent to
'tla logs -f | tail -n 1').
* 'changes' aka 'what-changed' has been removed, it is replaced by 'diff' and
'status'.
* 'set-tree-version' and 'tree-version' have been merged. 'tree-version' now
sets when given a parameter
and uses -d as other command do to operate on different directories.
* commands that perform merges - 'switch', 'merge', 'replay' mark the tree as
conflicted when conflicts
occur, and other commands will refuse to operate until baz is told that the
conflicts are resolved.
* 'import' now does an archive-setup by default.
* 'archive-setup' has been removed, as has 'make-category', 'make-branch', and
'make-version'
* 'commit' will create ancestry files in both tla and baz archives. It will
also perform cache-revisions
every 50 commits. --just-commit may be supplied to override these behaviours.
NB: ancestry files are signed separately from the commit log and changeset,
as they are optional data,
signed archives *will* ask for two signatures per commit.
* tree-building will take advantage of ancestry, reducing checkout time in
large trees, particularly when cached revisions are present.
* A 1.0 regression, the inability to add symlinks to missing files to the
archive, has been fixed.
* 'cache-config' a new command lets you configure the arch cache.
* 'merge' replaces 'star-merge'. merge uses ancestry data to find merge points
outside of the current arch namespace. This
removes the need to use join-branch. If star-merge behaviour is desired, it
can be obtained by 'merge --star-merge'.
Merge also uses three-way by default.
* 'delta --diffs' shows new file contents.
* 'register-archive' checks archives are accessible in all cases.
* 'commit' before an 'import' gives a helpful error pointing users at 'import'.
* 'register-archive' now accepts relative paths for local archives.
* 'commit' with no arguments and no EDITOR variable will not create a stub log
file.
* 'archive-mirror' will use the archive for the current working tree by default.
* 'commit' with signed archives, will leave the archive in a clean state if the
signature creation fails.
* baz can now detect tree-rearrangements in revision libraries and pristine
trees, reducing the opportunity for
corrupt commits.
* many commands no longer need a default archive set, they will operate from
the local tree version, or from fully-qualified versions.
* checksums in the archive are now both md5 and sha1.
* ftp server detection of baz archives was not quite right in baz 1.0.1, its
fixed for baz 1.1.
Community patches:
=================
Baz incorporates many patches for the tla codebase that it is based on
from the community. Thank you to the coders of those patches ...
Aaron Bentley
Colin Walters
James Blackwell
Robert Collins
Robert Weir
Where to get Bazaar ?
The Bazaar downloads page at http://bazaar.canonical.com/downloads.html lists
binary and source locations for bazaar.
signature.asc
Description: This is a digitally signed message part
- [Gnu-arch-users] Bazaar 1.1,
Robert Collins <=