06-11-2008
I concur with era...the echo command is ideal for your scenario and from your post it seems that you have a find one-liner.
10 More Discussions You Might Find Interesting
1. UNIX for Advanced & Expert Users
I need to perform a non-recursive find in Unix. Sounds simple, but it doesn't actually work. The command ALWAYS searches through the subdirectories.
Any ideas? I am on DEC Unix :-( (3 Replies)
Discussion started by: christallott
3 Replies
2. UNIX for Dummies Questions & Answers
Hello, I am trying to search a directory for all files matching "G*" without looking in sub-directories "success" and "error". I've searched this forum and found the following syntax, but can't make it work:
find . \( ! -name success -prune -name error -prune \) -type f -name "G*"
Have... (6 Replies)
Discussion started by: alexkav
6 Replies
3. UNIX for Dummies Questions & Answers
Hi everyone,
I'm using a recursive find (you know the type, find . -name qwert*) to find a set of files. However, because I'm new to the system and there is not much documentation about these particular files I'm trying to find them using this recursive find.
I started off at the location... (3 Replies)
Discussion started by: spanish_tony
3 Replies
4. Shell Programming and Scripting
I HAVE A TEXT FILE CONTAINING THE VALUES
1.CPP
2.CPP
3.CPP
4.CPP
5.CPP
6.CPP
I WANT TO TAKE EACH .CPP AND USE THE FIND COMMAND TO FIND THE LATEST VERSION OF THE FOLDER IN WHICH IT IS PRESENT.
HOW DO I IMPLEMENT IT IN A WHILE LOOP
I TRIED SOMETHING LIKE THIS
WHILE
CAT... (3 Replies)
Discussion started by: ultimatix
3 Replies
5. Shell Programming and Scripting
find -type d -name "TC_*" | sort
That's what I have so far... it finds the appropriate directories and then sorts them. But, when it comes to nested subdirectories, it only sorts relative to the first subdirectory. I want it to sort based on the directory at the end of the path. Does anyone know... (3 Replies)
Discussion started by: crimsondarkn
3 Replies
6. UNIX for Advanced & Expert Users
I was working on a shell script and found that the find command took too long, especially when I had to execute it multiple times. After some thought and research I came up with two functions.
fileScan()
filescan will cd into a directory and perform any operations you would like from within... (8 Replies)
Discussion started by: newreverie
8 Replies
7. UNIX for Dummies Questions & Answers
Hi all,
I am currently writing a find-and-remove kind of script that is to be used for Solaris and Linux.
Currently am using the find command below that I is in find only current directory (universal) | commandlinefu.com
This however gives me the "ksh: /bin/find: arg list too long" error... (6 Replies)
Discussion started by: newbie_01
6 Replies
8. UNIX for Dummies Questions & Answers
Hello Unix Gurus,
I am using the following find commands:
1)
find Input_Path -name '*.' -exec mv -f
{} Outputpath \;
2)
find Inputpath -name '*.' -exec cp
{} Outputpath \;
3)
find Somepath -name '*.'
Now the problem is my Unix version does not support maxdepth Option for find... (7 Replies)
Discussion started by: pchegoor
7 Replies
9. UNIX for Dummies Questions & Answers
Is there a way to use the find command to recursively scan directories for files greater than 1Gb in size and print out the directory path and file name only?
Thanks in advance. (6 Replies)
Discussion started by: jimbojames
6 Replies
10. UNIX for Dummies Questions & Answers
Hi All
I have a requirement to find the file that are most latest to be modified in each directory. Can somebody help with the command please?
E.g of the problem.
The directory A is having sub directory which are having subdirectory an so on.
I need a command which will find the... (2 Replies)
Discussion started by: sudeep.id
2 Replies
GFAN(1) User Commands GFAN(1)
NAME
Gfan - program for computing with Groebner fans
DESCRIPTION
This is a program for computing all reduced Groebner bases of a polynomial ideal. It takes a generating set for the ideal as input. By
default the enumeration is done by an almost memoryless reverse search. If the ideal is symmetric the symmetry option is useful and enumer-
ation will be done up to symmetry using a breadth first search. The program needs a starting Groebner basis to do its computations. If the
-g option is not specified it will compute one using Buchberger's algorithm.
Usage:
/usr/bin/gfan [options]
Options:
-g Tells the program that the input is already a Groebner basis (with the initial term of each polynomial being the first ones listed).
Use this option if it takes too much time to compute the starting (standard degree lexicographic) Groebner basis and the input is
already a Groebner basis.
--symmetry
Tells the program to read in generators for a group of symmetries (subgroup of $S_n$) after having read in the ideal. The program
checks that the ideal stays fixed when permuting the variables with respect to elements in the group. The program uses breadth first
search to compute the set of reduced Groebner bases up to symmetry with respect to the specified subgroup.
-e Echo. Output the generators for the symmetry group.
--subspace
Only do breadth first search on cones with their interior intersecting a specified subspace. The subspace is given by a list of
hyperplane normals at the end of the input. The intersection of the hyperplanes is the subspace being specified. Note that the set
of Groebner cones intersecting the subspace could be disconnected and that only one connected component is computed. Works only
together with --symmetry.
--disableSymmetryTest
When using --symmetry this option will disable the check that the group read off from the input actually is a symmetry group with
respect to the input ideal.
Gfan Groebner fan package Version 0.3 May 2008 GFAN(1)