
	Where results make sense

Topic: Bk tree

	Category:Trees (structure) - Wikipedia, the free encyclopedia
		In graph theory, a tree is a graph in which any two points, or vertices, are connected by exactly one path (i.e.
		An equivalent definition is that a forest is graph of one or more (unconnected) trees (hence the name).
		Trees are useful abstract structural representations of many different concepts.
	en.wikipedia.org /wiki/Category:Trees_(structure) (122 words)

	Binomial Trees, Forests, and Heaps
		We say that two binomial trees of the same order can be merged by attaching one as a subtree (the rightmost) of the other.
		If we have labels (keys) on the nodes of a binomial tree, and we impose an ordering property where the parent key is larger than the keys of any of its children, we can construct a heap with a binomial queue.
		The merging of two binomial trees (of the same index) requires linking one tree as a new child of the root of the other tree.
	www.cs.rutgers.edu /~kaplan/503/handouts/binomialQ.html (1682 words)

	Doing the BK thing, Penguin style
		Merging changes into a tree is called a "pull", and is analagous to 'cvs update'.
		For example, pushing a change from the testing-and-validation tree would probably be a bad idea, because it will push all changes from vm-hacks, bugfixes, filesys, and personal-hacks trees into the target tree.
		He could (for example) issue a "bk pull" on vm-2.5 and fs-2.5 trees, to merge their changes, but hold off net-drivers-2.5 because of a change that needs more discussion.
	lwn.net /2002/0425/a/bk-thing.php3 (1598 words)

	Problem Set 2
		A tree is said to be a heap if the value in a node is smaller than the values of the child nodes.
		The tree on the left is a heap, but the tree on the right is not (since 6 is less than 8).
		In addition, the heap will contain a tree of rank r for all values r that are the exponents of 2 that correspond to digits 1 in the binary expansion of m.
	www.cs.cornell.edu /courses/cs312/2005fa/hw/ps2.htm (2300 words)

	[No title] (Site not responding. Last check: 2007-10-24)
		Separate source trees are the means in BitKeeper by which you delineate parallel lines of development, both minor and major.
		A big part of using BitKeeper is organizing the various trees you have on your local disk, and organizing the flow of changes among those trees, and remote trees.
		/ testing-and-validation Since a "bk push" sends all changes not in the target tree, and since a "bk pull" receives all changes not in the source tree, you want to make sure you are only pushing specific changes to the desired tree, not all changes from "peer parent" trees.
	www.kernel.org /pub/scm/linux/kernel/bkcvs/linux-2.5/Documentation/BK-usage/bk-kernel-howto.txt,v (1826 words)

	BK Online: "..tree cutting along Quezon Ave." 1/16/01 (Site not responding. Last check: 2007-10-24)
		BK witnessed a big mango tree whose limbs were being cut by chainsaws wielded by men from William Uy Construction Corporation on January 11, 2001.
		The cutting of trees started last January 6 and will be finished bythe 20th of the month, as permitted by ECC (Environmental Compliance Certificate) 98NCRQC139 issued by the DENR.
		Only 30 trees will be cut, while the 28 that was marked with white paint will be left standing, but uprooted and transfered to another location.
	www.bwf.org /bk/2001/02/n_05.html (323 words)

	Kernel Traffic #156 For 4 Mar 2001
		Because every tree is a repository, files must be checked out before they will be in their standard places in the source tree.
		Since a "bk push" sends all changes not in the target tree, and since a "bk pull" receives all changes not in the source tree, you want to make sure you are only pushing specific changes to the desired tree, not all changes from "peer parent" trees.
		The advantage of allowing him to pull is that you won't have the same data in your BK tree twice, which you would have if you sent him diffs and then pulled the diffs from him.
	www.kerneltraffic.org /kernel-traffic/kt20020304_156.html (4790 words)

	6.2.2 Binomial Amortized Analysis (Site not responding. Last check: 2007-10-24)
		tree is carried over from the previous step.
		tree, it is placed as a tree in the resulting binomial queue.
		Thus number of trees in the forest is unchanged.
	lcm.csa.iisc.ernet.in /dsa/node142.html (365 words)

	LKML: Adrian Bunk: [2.6 patch] remove BK documentation
		Separate source trees -are the means in BitKeeper by which you delineate parallel lines -of development, both minor and major.
		For example, pushing a change -from the testing-and-validation tree would probably be a bad idea, -because it will push all changes from vm-hacks, bugfixes, filesys, and -personal-hacks trees into the target tree.
		He could (for -example) issue a "bk pull" on vm-2.5 and fs-2.5 trees, to merge their -changes, but hold off net-drivers-2.5 because of a change that needs -more discussion.
	lkml.org /lkml/2005/4/9/83 (2625 words)

	BitKeeper - The Scalable Distributed Software Configuration Management System
		The lack of a bk command to physically remove a file is deliberate, we do not want to encourage this action, since it results in a lack of reproducibility.
		The most important reason is that if you push to a parent repository used by several other people and you need to hand-merge some changes, the repository will be locked for several minutes and no one else will be able to push to it during that time.
		you have to be careful not to push the dev tree into bugs, use bk level to prevent this from happening.
	www.bitkeeper.com /section6.html (6495 words)

	[No title] (Site not responding. Last check: 2007-10-24)
		For BK users, I hope we can get a BK tree that tracks this set up soon, and it should hopefully not be too disruptive either.
		You either have to keep your tree clean all the time, or you have to generate a new clean tree (usually by exporting patches from your messy one) and throw the messy ones away periodically.
		That means that in a BK tree, you can't sanely use tags for "private" stuff, like telling somebody else "please sync with this tag".
	www.kerneltraffic.org /kernel-traffic/kt20050604_309.txt (4364 words)

	Bk tree (Site not responding. Last check: 2007-10-24)
		Definition: A binomial tree of order (height) k.
		Go to the Dictionary of Algorithms and Data Structures home page.
		tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology.
	www.nist.gov /dads/HTML/bktree.html (62 words)

	[Bitkeeper-users] BK to CVS conversion tool ? (Site not responding. Last check: 2007-10-24)
		I think just exporting the head of the bk tree as one CVS tree would be useful for most of the people most of the time.
		If people are running parallel lines of development they could export to multiple CVS trees, or (slightly better, but perhaps harder) exporting to branches within a single tree.
		Probably the most common case for wanting this is to allow moving to BK without disturbing people who are using anoncvs.
	mail.bitmover.com /pipermail/bitkeeper-users/2002-May/000217.html (267 words)

	apply the patch - IA64wiki
		To patch your kernel, you need to have before you start, a kernel tree to be patched, and a patch.
		The kernel tree is either from git/cogito or a compressed tar file from ftp://ftp.kernel.org or its mirrors.
		But it's easier to grab the appropriate tree directly; in 2.6 IA64 is supported directly with no extra patches.
	www.gelato.unsw.edu.au /IA64wiki/apply_the_patch (219 words)

	[No title]
		Merging changes into a tree is called a "pull", and -is analagous to 'cvs update'.
		Sending changes in -one tree to another tree is called a "push".
		All these prereq's are just -general cleanliness of BK usage, so as people become experts at BK, feel -free to optimize this process further (assuming Linus agrees, of -course).
	linuxhacker.ru /linuxnews/bitkeeper_docs_in_linux.txt (2271 words)

	Bright Weavings: The Worlds of Guy Gavriel Kay - Books on My Shelf
		And not a fairy tale novelization, but a very good, powerful novel that uses some of the more traditional elements of fairy tale and fantasy to very good effect is Patrick O'Leary's The Gift.
		Bk 2: The Lion, the Witch and the Wardrobe
		Bk 5: The Voyage of the Dawn Treader
	www.brightweavings.com /introduction/myshelf.htm (1625 words)

	[No title]
		We were interested in the binomial heap (a mergeable heap) because Union() is effected in lg n time; in an amortized analysis, Union() is effected in constant time with the Fibonacci Heap, primarily because the "work" of heap maintenance is "put off" until the Extract-Min() operation is needed.
		With Insert(), we do NOT worry about causing the presence of trees of duplicate size; this situation is remedied during the overhead attached to Extract-Min().
		Each tree is visited and a constant number of operations is performed thereupon.
	ranger.uta.edu /~cook/aa/transcript/ln13-14f (1372 words)

	bk commits and dates
		When you pull from one of the trees, like netdev, the commit messages are sent to the bk commit list with the original date stamp of the patch in the netdev tree.
		For example, if Jeff commited a patch from somebody in his netdev tree 3 weeks ago, and you pull Jeff's tree today, we'll get all the commit messages today, but dated from 3 weeks ago.
		That means that in my mailing list archive, where my mailer sorts them by date, I can't say, for example, everything that is before the 2.6.11 tag release was in 2.6.11.
	www.talkaboutsoftware.com /group/linux.kernel/messages/167848.html (200 words)

	Linux-Kernel Archive: NUMA scheduler BK tree (Site not responding. Last check: 2007-10-24)
		Next in thread: Michael Hohnbaum: "Re: NUMA scheduler BK tree"
		trees when the additional patches for that are tested on top of our
		The tree is currently in sync with bk://linux.bkbits.net/linux-2.5 and
	www.uwsg.indiana.edu /hypermail/linux/kernel/0211.0/1839.html (235 words)

	[No title]
		Repeat 2k times: unite the existing big tree with a singleton, making the singleton the root; do a find on the deepest element in the tree.
		The following definition of ranks after a union gives strictly increasing ranks: when uniting trees with roots x and y, making x the new parent of y, set the new rank of x to be the maximum of its old rank and one plus the rank of y.
		Initially the potential is zero, since all initial trees are singletons.
	www.cs.princeton.edu /courses/archive/spr03/cs423/download/Solutions_PS3.doc (570 words)

	bk!: holiday tree
		This is more than slightly ridiculous, but since I mentioned it, here's my tree.
		On the left of the tree in the picture is my bust of Moses with his leopard bonnet.
		Many have joked that it's not actually a Christmas tree, but I grew up with blue lights on the house.
	www.gotbrandy.com /archive/2005/12/holiday_tree.html (87 words)

	BitKeeper - The Scalable Distributed Software Configuration Management System
		bk revtool is displaying the differences between the revision of interest (1.36) and its parent (1.35).
		bk difftool displays the differences between the last rev and the modified versions of the file if run without options and the file argument is a modified file.
		When there are conflicts to merged, the bk pull command tells you that as the last part of the output.
	www.bitkeeper.com /all.html (12511 words)

	Linux: "The Best Tool For The Job"? - Another BitKeeper Thread
		In response to the generic argument that all of this BK effort and comment is an advertising ploy, Larry says, "We aren't getting financial benefit from the kernel use of BK, which is a bummer, but that is OK, that wasn't the point.
		tree is changing around you and you need to build/test against that.
		BK is my primary way, these days, of trying to help out with the kernel.
	kerneltrap.org /node/156/print (7517 words)

	Killian Reunion at Castanea Presby. Ch.
		Plans: To print a tree of all 26,780 descendants of Andreas (counting their spouses) & put it on the walls of the Rally Building at this the First 3 Day Reunion, 8-10 Sep 2000.
		Description of this Tree: I set BK to print a 3 generation tree of the descendants of Andreas showing only birth & death years & showing which spouse produced which children in Arial 9 pt.
		It was scanned in 3 sections at 75 dpi, with brightness set at -49 & contrast set at +100 and then the 3 gifs were pasted together & white space was cropped out.
	millennium.fortunecity.com /greendale/1096/Killian/tree.html (218 words)

	Installing/Upgrading/Building the Kernel
		Trees may go dormant or extinct with time and other trees may be created; the linuxppc-user list is the best source of current info.
		Do not assume that different repositories have the same code, even though they may refer to the same tree.
		Note: you can also rsync the bk tree, albeit at the loss of its "bk-ness":
	www.rapierbit.org /linux/newkernel.html (615 words)

	[No title] (Site not responding. Last check: 2007-10-24)
		Consolidate trees so that no two roots have same degree, and finding new min.¡(’ 5Nó S¨Fibonacci Heaps: Delete-Min¨Delete min, concatenate its children into root list.
		Consolidate trees so that no two roots have same degree, and finding new min.¡(’ 5Nó U¨Fibonacci Heaps: Delete-Min¨Delete min, concatenate its children into root list.
		Consolidate trees so that no two roots have same degree, and finding new min.¡(’ 5Nó V¨Fibonacci Heaps: Delete-Min¨Delete min, concatenate its children into root list.
	www.owlnet.rice.edu /~comp482/notes/12-heaps/12-heaps.ppt (821 words)

	Finn Jelstrup BK-help (Site not responding. Last check: 2007-10-24)
		In the BK tree display, press Print Screen button on keyboard.
		Mark the portion of the tree printout and note the name you gave to that portion.
		Use the scroll bars to display another portion of the tree.
	home.online.no /~otjoerge/bk/tips/bk6-016-eng.htm (219 words)

	kbuild/all archs: Sanitize creating offsets.h
		With this mail four patches are posted: o Accept kbuild file named Kbuild o generic support for offsets.h o changes for i386 o changes for arm The second patch breaks all architectures...
		My bk tree at bk://linux-sam.bkbits.net/kbuild contains support for most architectures (sh and cris missing for now).
		In the source tree, I have: drwxrwxr-x 2 rmk rmk 4096 Oct 28 20:38 include/asm -rw-rw-r-- 1 rmk rmk 1026 Oct 28 20:37 include/asm-arm/Kbuild Note that kbuild created an extra directory called asm in the source tree.
	www.webservertalk.com /message450840.html (969 words)

	testing (Site not responding. Last check: 2007-10-24)
		Obtain the current release either by download or via the BK tree.
		Follow the instructions for building and installing SCTP in the README file or in the user's notes.
		It can be used to create various client/server tests by transmitting data through the real network connections on the systems.
	lksctp.sourceforge.net /testing.html (333 words)

	[PATCH] Automatically append a semi-random version for BK users \| Linux \| Kernel
		+# A 'release tree' is any tree with a BitKeeper TAG associated with it.
		> +# A 'release tree' is any tree with a BitKeeper TAG associated with it.
		And do not assume bk, select more generic names.
	www.gossamer-threads.com /lists/linux/kernel/522368 (2904 words)

	[No title]
		çÿªó¨Binomial Treesª ó¨Binomial Treesª ó ¨Binomial Heaps¨7A binomial heap H is a set of binomials trees that satisfies the following binomial-heap properties: Each binomial tree in H obeys the min-heap property.
		For any nonnegative integer k, there is at most one binomial tree in H whose root has degree k.
		Binomial trees will be joined by a linked list of the roots¡2fÒ’" fÒó ¨Binomial Heap Exampleª ó¨Binomial Heaps¨How many binary bits are needed to count the nodes in any given Binary Tree?
	www.math.uaa.alaska.edu /~afkjm/cs351/handouts/binheaps.ppt (709 words)

Try your search on: Qwika (all wikis)