Sponsored Content
Full Discussion: Search problem
Top Forums UNIX for Dummies Questions & Answers Search problem Post 302589031 by jim mcnamara on Tuesday 10th of January 2012 01:56:04 PM
Old 01-10-2012
I tried a tag search for pr : did no good. What exactly are you searching for? Just the pr command? Or what do you want to know about pr? Somebody here can help.
 

10 More Discussions You Might Find Interesting

1. Programming

problem with ldap search using c

hi all i m writin a c program to search ldap db for values. i used the following code after search result return a value >0 if (result==1) { entry=ldap_first_entry(ld,msg); for(....;....;...) { // code to store the data values } } i m gettin an error at... (1 Reply)
Discussion started by: mridula
1 Replies

2. Shell Programming and Scripting

Problem with search pattern

Can anyone help me in a scriptfor below example which has to find the string "System && Passcode 0" or "System && Failcode ??" If this searched string occurs consecutively 4 times it should provide output as error S.No : Program: Status 1. was : Passcode 1 2. System: Passcode 0... (1 Reply)
Discussion started by: gantagoru
1 Replies

3. Shell Programming and Scripting

Problem with sed (search/replace)

Hi, In a file FILE, the following lines appear : WORD 8 8 8 ANOTHERWORD blabla ... Directly in the prompt, if I type $sed '/WORD/s/8/10/g' FILE it replace the 8's by 10's in file : $cat FILE WORD 10 10 10 ANOTHERWORD blabla ... (9 Replies)
Discussion started by: tipi
9 Replies

4. Shell Programming and Scripting

Search with awk problem

Hi There is one problem which i am not able to find the solution :( Suppose there are two files tmpfile1 and tmpfile2 . tmpfile1 contains data as :bash> cat tempfile1 1222 1234 1234 1234 :bash> now my code is written as getcommand="cat tmpfile2" while(getcommand | getline)... (7 Replies)
Discussion started by: aishsimplesweet
7 Replies

5. UNIX for Dummies Questions & Answers

ldap search problem

I am posting in this section because in this regard I am a Dummy. I know very little about ldap. We have a couple of ldap registries running on an AIX box. I can connect into those registries using an openldap browser. But I am trying to run some queries against the registry on the server itself,... (1 Reply)
Discussion started by: fwellers
1 Replies

6. Homework & Coursework Questions

VI Search and Replace problem help...

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: Give the vi command for replacing all occurances of the string "DOS" with the string "UNIX" in the whole... (4 Replies)
Discussion started by: kbreitsprecher
4 Replies

7. Shell Programming and Scripting

Problem writing a search script

I trying to write a script in bash that take a list of users in “fileA” and searches another list user in “fileB” if the user does not exist in “file B” write the user to another file “file C”. Please note “fileA” and “fileB” contains over 1000 users Basically “fileA” “fileB” ... (2 Replies)
Discussion started by: hassan1
2 Replies

8. Programming

Binary Search Tree Search problem

I am writing code for a binary search tree search and when I compile it i am getting strange errors such as, " /tmp/ccJ4X8Xu.o: In function `btree::btree()': project1.cpp:(.text+0x0): multiple definition of `btree::btree()' " What does that mean exactly? tree.h #ifndef TREE_H #define... (1 Reply)
Discussion started by: meredith1990
1 Replies

9. UNIX for Dummies Questions & Answers

GREP Problem with Search Values

Hello All, I'm using the following command: grep -F -f List.csv Data.csv > Output.csv List.csv aa bb cc dd Data.csv aa,other stuff zz,other stuff bb,other stuff aa_2,other stuff dd,other stuff dd_2,other stuff (3 Replies)
Discussion started by: WongSifu
3 Replies

10. UNIX for Dummies Questions & Answers

Search and replace problem

Hi, I am looking for bash or awk script to solve the following. Input File 1: >Min_0-t10270-RA|>Min_0-t10270-RA protein AED:0.41 eAED:0.46 QI:0|0|0|0.25|1|1|4|0|190 MIGLGFKYLDTSYFGGFCEPSEDMNKVCTMRADCCEGIEMRFHDLKLVLEDWRNFTKLST EEKRLWATPAAEDFF >Min_0-t10271-RA|>Min_0-t10271-RA protein... (5 Replies)
Discussion started by: Fahmida
5 Replies
pnmmontage(1)						      General Commands Manual						     pnmmontage(1)

NAME
pnmmontage - create a montage of portable anymaps SYNOPSIS
pnmmontage [-?|-help] [-header=headerfile] [-quality=n] [-prefix=prefix] [-0|-1|-2|...|-9] pnmfile... DESCRIPTION
Packs images of differing sizes into a minimum-area composite image, optionally producing a C header file with the locations of the subim- ages within the composite image. OPTIONS
-?, -help Displays a (very) short usage message. -header Tells pnmmontage to write a C header file of the locations of the original images within the packed image. Each original image gen- erates four #defines within the packed file: xxxX, xxxY, xxxSZX, and xxxSZY, where xxx is the name of the file, converted to all uppercase. The #defines OVERALLX and OVERALLY are also produced, specifying the total size of the montage image. -prefix Tells pnmmontage to use the specified prefix on all of the #defines it generates. -quality Before attempting to place the subimages, pnmmontage will calculate a minimum possible area for the montage; this is either the total of the areas of all the subimages, or the width of the widest subimage times the height of the tallest subimage, whichever is greater. pnmmontage then initiates a problem-space search to find the best packing; if it finds a solution that is (at least) as good as the minimum area times the quality as a percent, it will break out of the search. Thus, -q 100 will find the best possible solution; however, it may take a very long time to do so. The default is -q 200. -0, -1, ... -9 These options control the quality at a higher level than -q; -0 is the worst quality (literally pick the first solution found), while -9 is the best quality (perform an exhaustive search of problem space for the absolute best packing). The higher the number, the slower the computation. The default is -5. NOTES
Using -9 is excessively slow on all but the smallest image sets. If the anymaps differ in maxvals, then pnmmontage will pick the smallest maxval which is evenly divisible by each of the maxvals of the original images. SEE ALSO
pnmcat(1), pnmindex(1), pnm(5), pam(5), pbm(5), pgm(5), ppm(5) AUTHOR
Copyright (C) 2000 by Ben Olmstead. 31 December 2000 pnmmontage(1)
All times are GMT -4. The time now is 03:55 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy