The idea of a chained hash table is simple.
Given a key (character array) compute in a 'table' the location to which
the character string hashes using a hash value derived from the key.
From this one can search the array and 'bucket' for matches based on a restricted
subset of identically hashed values.
echo name the file that you want to read
read answer
if
then
echo you must enter a file name
fi
cat $answer
im trying to catch the error if user forget to enter the name of the file
anyone can help me ?
thanks:confused: (4 Replies)
Hi all
Is it possible to copy a structure of a directory only.
e.g.
I have a file with the following entries that is a result of a find :-
/dir1/dir2/file.dbf
/dir1/dir2/dir3/file1.dbf
/dir1/file.dbf
I want to copy these to a directory and keep the structure however starting at a new dir... (8 Replies)
Hi,
I am trying to write a script that will move all the files from source directory structure(multiple levels might exist) to destination directory structure. If a sub folder is source doesnot exist in destination then I have to skip and goto next level. I also need to delete the files in... (4 Replies)
Hi...
I have a directory which has multiple directories and sub directories inside...
what command should i use to get a list of all these directories, without the filenames.... (2 Replies)
I have the perl data structure and what i need to do is find all values in
@{$extractColumns{'2'}{'D'}} which are not there in @{$extractColumns{'2'}{'M'}} but seems like i need to put a flag somewhere and i messed up
foreach my $order (keys %extractColumns)
{
foreach my $value... (2 Replies)
Hi,
I have a script that handles a huge amount of log files from many machines and copies it into a SAN location with the following directory structure:
/SAN/machinenames/yyyy/m/d
so for example
/SAN/hosta/2011/3/12/files*
Now I am writing a bash script to search for files between to date... (4 Replies)
Im reading a lot about wget and have really enjoyed using it. However I see a lot of tutorials that will show several ways. I want to be able to write scripts in gedit so I was wondering what is the best process to do this instead of just running them in the terminal?? (3 Replies)
Hi all,
I have a big file (n.txt) with following pattern:
ATOM 1 N SER A 1 122.392 152.261 138.190 1.00 0.00 N
ATOM 2 CA SER A 1 122.726 151.241 139.183 1.00 0.00 C
TER
ENDMDL
ATOM 1 N SER A 1 114.207 142.287 135.439 1.00 0.00 ... (3 Replies)
Hi i want a sctp (lksctp) api which can retrieve the values of the sctp structure "sctpAssocTable"
It is sctpassoctable or sctpassocentry.
SctpAssocEntry ::= SEQUENCE {
sctpAssocId Unsigned32,
sctpAssocRemHostName OCTET STRING,
sctpAssocLocalPort ... (1 Reply)
Discussion started by: harioum
1 Replies
LEARN ABOUT OSF1
forder
dbm(3) Library Functions Manual dbm(3)NAME
dbminit, fetch, store, delete, firstkey, nextkey, forder - Database subroutines
LIBRARY
DBM Library (libdbm.a)
SYNOPSIS
#include <dbm.h>
typedef struct {
char *dptr;
int dsize; } datum;
int dbminit(
char *file );
datum fetch(
datum key );
int store(
datum key,
datum content );
int delete(
datum key );
datum firstkey( void );
datum nextkey(
datum key );
long forder(
datum key );
PARAMETERS
Specifies the database file. Specifies the key. Specifies a value associated with the key parameter.
DESCRIPTION
The dbminit(), fetch(), store(), delete(), firstkey(), nextkey(), and forder() functions maintain key/content pairs in a database. They
are obtained with the -ldbm loader option. The dbm library is provided only for backwards compatibility, having been obsoleted by the ndbm
functions in libc. See the manual page for ndbm for more information.
The dbminit(), fetch(), store(), delete(), firstkey(), nextkey(), and forder() functions handle very large databases (up to a billion
blocks) and access a keyed item in one or two file system accesses. Arbitrary binary data, as well as normal ASCII strings, are allowed.
The database is stored in two files. One file is a directory containing a bit map and has .dir as its suffix. The second file contains
all data and has .pag as its suffix.
Before a database can be accessed, it must be opened by the dbminit() function. At the time that dbminit() is called, the file.dir and
file.pag files must exist. (An empty database is created by creating zero-length .dir and .pag files.)
Once open, the data stored under a key is accessed by the fetch() function and data is placed under a key by the store() function. A key
(and its associated contents) is deleted by the delete() function. A linear pass through all keys in a database may be made by use of the
firstkey() and nextkey() functions. The firstkey() function returns the first key in the database. With any key, the nextkey() function
returns the next key in the database. The following code traverses the database: for (key = firstkey(); key.dptr != NULL; key = nex-
tkey(key))
RETURN VALUES
Upon successful completion, the functions that return an int return 0 (zero). Otherwise, a negative number is returned. The functions
that return a datum indicate errors with a null (0) dptr .
RELATED INFORMATION
Functions: ndbm(3) delim off
dbm(3)