Addressbook using double-linked list. This example shows the use of a double-linked list by implementing an addressbook for the console. It has features like inserting, searching(linear), sorting(bubble sort), deleting and load/save to a file. I wrote this during my study of Applied Computer Science so it s intended mainly for students who want to know about some advanced programming techniques in C. The Code was compiled with MSVC++ 6.0 but it should compile with any ANSI-compliant compiler.
Invoke JavaProg.main() from a win32 program: . compile Main.java . compile VC project . set include path for jni.h, which is under java_Home\include . set linking path for jvm.lib, which is under java_Home\lib\jvm.lib . copy Main.class and Main$1.class to the working dir of the VC project (or the same dir with the output executable App.exe) . run App.exe . set searching path for jvm.dll
From the Publisher
Focus on 2D in Direct3D? teaches you all of the tools and tips you ll need to dive right in and begin creating your own games. If you have some knowledge of C or C++ and have been searching for a guide that will take your 2D programming into the third dimension, then search no more! In this book you ll learn the skills you ll need to move from the 2D API to Direct3D. Written from the point of view of a 2D programmer, Focus on 2D in Direct3D presents the fundamentals of the Direct3D API in an easy-to-use-and-understand format. Get ready to jump into the world of Direct3D!
《Prolog Programming in Depth》:
In this book, we emphasize practical Prolog programming, not just theory. We
present several ready-to-run expert system shells, as well as routines for sorting,searching, natural language processing, and even numerical equation solving.
We also emphasize interoperability with other software. For example, Chapter 5 presents techniques for reading Lotus spreadsheets and other special file formats from within a Prolog program.
The goal of this library is to make ODBC recordsets look just like an STL container. As a user, you can move through our containers using standard STL iterators and if you insert(), erase() or replace() records in our containers changes can be automatically committed to the database for you. The library s compliance with the STL iterator and container standards means you can plug our abstractions into a wide variety of STL algorithms for data storage, searching and manipulation. In addition, the C++ reflection mechanism used by our library to bind to database tables allows us to add generic indexing and lookup properties to our containers with no special code required from the end-user. Because our code takes full advantage of the template mechanism, it adds minimal overhead compared with using raw ODBC calls to access a database.
Abstract
The Lucene Server project is an attempt to extend the Jakarta Lucene tool with server capabilities.
Lucene is a robust Java API that enables you creating indexes from text sources and perform powerful searches on these indexes. With Lucene, creating an index must be done programmatically and there are almost no possibilities of integrating index management in a distributed environment. In other words, out of the box, Lucene is suitable for integrating indexing and searching possibilities in a single application but not for providing index/search services for multiple applications.
The Lucene Server project comes with a Java API that propose the following
make it easy to create indexes in a declarative way by simply providing an XML configuration document.
make it easy to personalize the way Lucene must handle different kind of data sources.
provide services for index management and searching that can be accessed from several applications.
enable batch tasks scheduling.
