Sponsored Content
Full Discussion: fluxbox
Special Forums UNIX Desktop Questions & Answers fluxbox Post 60305 by kezzol on Friday 14th of January 2005 01:37:12 PM
Old 01-14-2005
fluxbox

I have a problem witch my fluxbox, I can't configurie my keys.
I wrote :
Code:
Mod1 Tab :NextWindow
    Mod1 F1 :Workspace 1
    Mod1 F2 :Workspace 2
    Mod1 F3 :Workspace 3
    Mod1 F4 :Workspace 4

and I can't use F1 , F2 ...
any suggestion ??
thx
cU
 

2 More Discussions You Might Find Interesting

1. Slackware

FluxBox: Can't add to menu

Have problem with the menu in FluxBox on SlackWare 13.1 on my desktop. I simply can't add things to the menu, on my Laptop I do as follows: Open a terminal, type emacs ~/.fluxbox/menu Then I add or remove the things I want to add or remove. But on my desktop I can remove things, but I... (2 Replies)
Discussion started by: looop
2 Replies

2. UNIX for Advanced & Expert Users

wireless connection with fluxbox via commands

Hi, By default I use all gnome stuff (gdm+metacity+...) and my connection works well. I wanted to try fluxbox. So I've just changed my window manger. And under fluxbox, wireless isn't managed automatically like with gnome. So I tried to set it up manually ... but I can't make my wireless... (0 Replies)
Discussion started by: xib.be
0 Replies
bup-margin(1)						      General Commands Manual						     bup-margin(1)

NAME
bup-margin - figure out your deduplication safety margin SYNOPSIS
bup margin [options...] DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids. For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by its first 46 bits. The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits, that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits with far fewer objects. If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if you're getting dangerously close to 160 bits. OPTIONS
--predict Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer from the guess. This is potentially useful for tuning an interpolation search algorithm. --ignore-midx don't use .midx files, use only .idx files. This is only really useful when used with --predict. EXAMPLE
$ bup margin Reading indexes: 100.00% (1612581/1612581), done. 40 40 matching prefix bits 1.94 bits per doubling 120 bits (61.86 doublings) remaining 4.19338e+18 times larger is possible Everyone on earth could have 625878182 data sets like yours, all in one repository, and we would expect 1 object collision. $ bup margin --predict PackIdxList: using 1 index. Reading indexes: 100.00% (1612581/1612581), done. 915 of 1612581 (0.057%) SEE ALSO
bup-midx(1), bup-save(1) BUP
Part of the bup(1) suite. AUTHORS
Avery Pennarun <apenwarr@gmail.com>. Bup unknown- bup-margin(1)
All times are GMT -4. The time now is 12:32 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy