Skip to main content

Sorry, no manpages available for db_open.

today trying to find a manual page for db_open function of BerkeleyDB in Google gave me sort of surprise -- first 6 links were broken! that's a bit unusual -- often you get one or more broken page, but six in a row is some kind of anomaly. first working link was on Oracle site, so I wonder -- was it Oracle pulling BDB docs from other sites? 

so here's what Google returned to me:

Berkeley DB: db_open The db_open function opens the database represented by file for both reading and writing. ... Also, calling db_open is a reasonably expensive operation. ... pegasus.cs.csubak.edu/docs/berkeley_debugger/api_c/Db/open.html

site fails to open 

Проект OpenNet: MAN db_open (3) Библиотечные вызовы (FreeBSD и Linux) db_open (3). Руководство не найдено. - 1. Команды и прикладные программы пользовательского уровня, русские | linux | freebsd | solaris | разные | posix ... www.opennet.ru/cgi-bin/opennet/man.cgi?topic=db_open&category=3

text says manual not found -- but why is there a link on it?

UNIX man pages : db_open (3) www.nsc.ru/cgi-bin/www/unix_help/unix-man?db_open+3

blank page..

SGI TPL View (3 db_open) Unable to find a manual page for: db_open. home/search | what's new | help techpubs.sgi.com/library/tpl/cgi-bin/getdoc.cgi?cmd=getdoc&coll=0650&db ...3%20db_open

DragonFly On-Line Manual Pages : db_open(3) DragonFly On-Line Manual Pages. Manual page could not be found, please try again. leaf.dragonflybsd.org/cgi/web-man?command=db_open&section=3

Index to db_open manpages. Index to db_open manpages. Sorry, no manpages available for db_open. www-linux.gsi.de/cgi-bin/man2html?db_open+3

Berkeley DB: DB->open Berkeley DB: An embedded database programmatic toolkit. www.oracle.com/technology/documentation/berkeley-db/db/api_c/db_ open.html

that's where i've found it..

Comments

Popular posts from this blog

Cosmos SDK vs Rell

When I first looked at Tenderming ~4 years ago (I seriously considered using Terndermint to implement consensus in Postchain), I was not particularly impressed by its programming model -- the example code in Go looked overly verbose.

I looked through Cosmos SDK docs today. Docs look really nice. And it's nice that the application can be built in a modular fashion, using pre-made Cosmos SDK modules. However, verbosity is still there...

Let's look at code needed to implement a single SetName operation in Cosmos. This operation simply checks that transaction's signer is the owner of the name, and then changes value associated with the name. This should be simple, right? It's probably the simplest thing you can do with blockchain. Let's first look at how one would implement it in Rell, e.g.:

operation set_name_value (name, value: text) { val entry = name_entry @ { name }; require(is_signer(entry.owner)); entry.value = value; }
Even if you don't know anyth…

Lisp syntax is great!

lots of people complain about Lisp syntax -- they find it too weird and verbose, they call LISP "Lots of Irritating  Silly Parentheses"; and sometimes they even pop up with proposals to "fix Lisp" on comp.lang.lisp -- "Lisp is sort of cool, but this syntax... let me show you my great ideas."on the other hand, most lispers (and I among them) actually love s-expression syntax.who is right here? are syntax preferences a subjective thing, or one can decide which is better quite in an (more-or-less) objective way? or, perhaps, that's just a matter of taste and custom?i've got a good example today.. i'm using Parenscript -- cool Common Lisp library that automatically generates JavaScript from Lisp-like syntax -- and i've wrote a function that caches document.getElementById results (that makes sence for dumb browsers like IE):   (defun my-element-by-id (cache id) (return (or (slot-value cache id)     (setf (slot-value cache id)…

out-of-memory: a sad case

the problem..while Turing machine's tape is infinite, all real world programs are running within some resource constraints -- there is no such thing as infinite memory. for some programs that ain't a problem -- amount of memory needed by the algoritm can bee known beforehands, at programming time. but for most real world applications memory requirements are not known until run time, and sometimes it is very hard to predict how much does it need.obvious example is an application that allocates memory according to a user input -- for example, an image editor asks user for a dimension of an image he'd like to create. it needs to allocate an array in memory for the image (to have a fast access), so when dimensions exceed possible bounds, good-behaving application should notify user -- and user can either reduce image size or, perhaps, upgrade his machine, if he really wants to work with large images. while it is fairly easy to implement such functionality on a single-task OS, …