When doing bulk removes, I do it in stages: generate the list, examine, then do the remove. Then I can check that I'm aiming for the correct foot One Last Time(tm) before shooting.
In the case above where the user wants to transform the file names before removing, sed is your friend. Using the ':' character instead of the traditional '/' for the 's' command allows me to avoid tiresome escaping in the sed command.
Hi All,
I'm trying to use the find command to return matches for a directory and file.
For example, given the following directories:
/one/two/three/file1.txt
/one/three/two/file1.txt
/one/four/two/three/file1.txt
I'm expecting the following to be returned:
... (16 Replies)
I'm trying to organize my MB Pro by moving all my jpeg files to a single folder from the desktop. There are some on the desktop that are not in any folder. I was at the command line and typed
mv *.jpg "Jpeg files"
but it only moved the files that were on the desktop, not any of the ones that... (3 Replies)
Suppose i have a word "mail".
I have to search this word in all files inside a directory and it's sub-directories.
It will also search in all hidden directory and sub-directories.
If it finds this word in any file it will list that file.
How can i do this with perl/ruby/awk/sed/bash or... (9 Replies)
I am trying to find all DAT files in a subdirectory named IN. I do not know the entire path.
For example: /stage/<?>/<?>/IN/file.DAT
I am using the find command without success:
find /stage -name IN -a -name '*.DAT' -print
What is the correct logic and syntax? Thank you for the help. (5 Replies)
Hi Everyone!
Looking for some help with a script that will take all files in any given root folder (which are not already in a folder) and put them into separate folders with the name of each given file.
Any ideas?
Thank you! (1 Reply)
Display the number of files in a directory and recursively in each subdirectory
To look something like below, for example
/var 35
/var/tmp 56
/var/adm 46
Any ideas how can we do this? :wall: (1 Reply)
Display the number of files in a directory and recursively in each subdirectory
To look something like below, for example
/var 35
/var/tmp 56
/var/adm 46Any ideas how can we do this?
Got a sun cluser global mount point which takes ages to mount everytime, need to understand... (5 Replies)
accidentally i have changed ownership of a directory,subdirectory and files wil below command. I want to the change ownership back as same as in same directory on another server. How can i do it?
chown -R user:group /u01
is there any simple script? it is really an urgent need.. (2 Replies)
I want to list files that end with .c in the direct subdirectory of the current directory. I have tried the following command:
find ./ -mindepth 2 -maxdepth 2 -name "*.c"
Is that right? Or is there any easier way to handle that problem?
Another problem is that I want to grep in a file to find... (5 Replies)
I used rm * and it deleted the files in the directory but gives and error message for unsuccessful subdirectory deletion.
"rm: cannot remove 'DirectoryName': Is a directory"
I dont want to explicitly get the above error.
What are the modifications I have to do in the rm command? (3 Replies)
Discussion started by: duplicate
3 Replies
LEARN ABOUT DEBIAN
hash
HASH(3pub) C Programmer's Manual HASH(3pub)NAME
hash_create, hash_destroy, hash_install, hash_lookup, hash_uninstall, hash_iter - generic hash tables
SYNOPSIS
#include <publib.h>
Hashtab *hash_create(unsigned long (*fun)(void *),
int (*cmp)(const void *, const void *));
void hash_destroy(Hashtab *ht);
void *hash_install(Hashtab *ht, void *data, size_t size);
void *hash_lookup(Hashtab *ht, void *data);
int hash_uninstall(Hashtab *ht, void *data);
int hash_iter(Hashtab *ht, int (*doit)(void *, void *), void *param);
DESCRIPTION
These functions implement generic hash tables. The table is created by hash_create and destroyed by hash_destroy. The fun argument is a
pointer to the hashing function, which must convert a datum to an unsigned long, which is then converted to an index into the hashing ta-
ble. cmp is a qsort(3)-like comparison functions, used to compare to (wannabe) hash table elements.
hash_install installs a new datum into the table. A pointer to the data and the size of the data are given as the arguments. If the size
is 0, only the pointer value is copied to the table. Otherwise a copy of the data is made into dynamically allocated memory.
hash_lookup attempts to find a datum in the hash table. A pointer to another datum is given as the argument. The comparison function
should compare equal (return 0) the desired datum and this datum (but the argument needn't be a fully initialized datum, although that is
up to the writer of the comparison function). There cannot be two elements in the hash table that are equal (the comparison function
returns 0 for them). It is up to the user to handle collisions.
hash_uninstall removes an element from a table. The argument is a pointer to a datum that identifies the element.
hash_iter goes through every element in the hash table and calls the doit function for each. The first argument it provides to doit is the
element in question, the second is whatever was given to hash_iter as param. If doit returns -1 or 0 for any element in the hash table,
hash_iter immediately returns without going through the remaining elements in the hash table. Any other return value from doit is ignored.
RETURNS
hash_create returns a pointer to the new hash table, or NULL if it fails.
hash_install returns a pointer to an element in the table (either the installed one, or one that was already installed, if one tries to
install the same datum twice).
hash_uninstall returns 0 if it found the element in the array, or -1 if it didn't.
hash_lookup return a pointer to the element it finds, or NULL if it doesn't find anything beautiful.
hash_iter returns -1, 0, or 1. If hash_iter receives a return value of -1 or 0 for some element from doit, hash_iter immediately returns
-1 or 0, respectively. In all other cases hash_iter returns 1.
SEE ALSO publib(3), qsort(3), bsearch(3)AUTHOR
Lars Wirzenius (lars.wirzenius@helsinki.fi)
Publib C Programmer's Manual HASH(3pub)