Sponsored Content
Top Forums Shell Programming and Scripting HOW TO HIGHLIGHT FIRST LINE IN FILE? Post 302923324 by charlieandlinux on Saturday 1st of November 2014 01:41:14 AM
Old 11-01-2014
Yes, it is possible. Sed could match the first the letter, "M" and any other characters after it and quit matching after the first line and wrap the wanted html tags around the match. This may not be what you want as your question is too simple that I expect there many solutions to your issue too extensive to guess which is the best one. In the future keep in mind that if it is "text" then there are no foreseeable limitations to it being manipulated.
 

4 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

vim font highlight

Hi, there. I am using vim to edit some files I am working on from terminal. I occasionally pressed some keys by mistake, and the word just got highlight. Afterward whenever I type in that word, it will be highlight automatically. It is annoying. Could someone tell me how to turn this off? BTW,... (6 Replies)
Discussion started by: HOUSCOUS
6 Replies

2. Solaris

Syntax Highlight editor

Is there is any syntax highlithing editor available for C and C++ programming language in Solaris. (7 Replies)
Discussion started by: arun.viswanath
7 Replies

3. HP-UX

How to highlight syntax in Hp-UX vi editor?

Hi , How do i highlight syntax in vi editor on HP-UX. any suggestion highly appreciated. -Ashok (1 Reply)
Discussion started by: ashokd001
1 Replies

4. UNIX for Dummies Questions & Answers

Highlight text in shell o/p

Hi All, Can anyone tell me how to highlight a particular text in shell output or formattting a text in shell ? (1 Reply)
Discussion started by: prasanna2166
1 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 02:36 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy