C/C++ Coder

List View Item Control.

noreply@blogger.com (renlabs) — Wed, 5 Nov 2008 21:45:00 -0800

List View Item Control.Here is a sample listing of code that will add bitmap IDs(win32 application) or ICON Ids to the list view control. few month back I made this to add a feature to my existing application module.You cannot blindly add this to ur workspace since it need some modifications. Treat this as a code snippet or an example to make the target.!! Happy coding/**

Sudoku Solver

noreply@blogger.com (renlabs) — Wed, 9 Jul 2008 23:42:00 -0700

/********************************** ***************************** Dipl.- Inf. Detlef Hafer*** D-91058 Erlangen (Germany)********************************** ***************************/#include "stdio.h>"#include "stdlib.h"#include "string.h"#define BACK -1#define FORWARD 1#define NSIZE 9#define BOOL bool#define FALSE false#define TRUE trueint F[NSIZE][NSIZE];#if _DEBUGstatic int M[NSIZE][NSIZE]

Virtual Table

noreply@blogger.com (renlabs) — Wed, 16 Apr 2008 02:59:00 -0700

Here is a short description of the virtual tables layout. This is mostly taken out of the existing Taligent runtime.Virtual tablesVirtual tables (vtables) are used to dispatch virtual functions, to access virtual base class sub objects, and to access information for runtime type identi?cation (RTTI). Each class that has virtual member functions or virtual bases has an associated set of vtables.

The .bmp file format

noreply@blogger.com (renlabs) — Tue, 27 Nov 2007 03:45:00 -0800

The .bmp file format Introduction: The .bmp file format (sometimes also saved as .dib) is the standard for a Windows 3.0 or later DIB (device independent bitmap) file. It may use compression (though I never came across a compressed .bmp-file) and is (by itself) not capable of storing animation. However, you can animate a bitmap using different methods but you have to write the code which

Steganography

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 04:15:00 -0800

//Steg.hDesigned and Implementation: Renjith G/********************** header file*************************/#define BUFSIZE 1024 //512#define DATASIZE 64#define STARTBYTE 64/************type definition***********************//* typedefs */typedef unsigned char UBYTE;/***********struture definition********************/struct steg_header{ unsigned long datalen; char key[10];}

Fork()

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 04:12:00 -0800

#include#includemain(){ int ret; ret = fork(); if(ret == 0) { printf("\n"); printf("Current Process pid =%d(Executed by child\n",getpid()); printf("\n"); printf("Parent Process pid =%d(Executed by child)\n",getppid()); printf("\n"); } else { wait(); printf("\n"); printf("Current Process pid =%d(Executed by child\n",getpid())

Queue

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 04:11:00 -0800

#include# define max 3struct queue{ int queue[max]; int f,r;}q;main(){ int ch,k=1; q.f=0; q.r=-1; while(k==1) {printf("\t\t MENU\n" "\t1.INSERT\n" "\t2.DELETE\n" "\t3.DISPLAY\n" "\t4.EXIT\n" "\tEnter Your Choice:\n"); scanf("%d",&ch); switch(ch) { case 1: insert(); break; case 2:

Insertion Sort

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 04:09:00 -0800

//INSERTION SORT#include//#include#includemain (){ int a[100], n, s[100], temp, j, i; printf ("Enter the number of elements in the array(max no:=100)\n"); scanf ("%d", &n); printf ("eneter the elements :"); for (i = 0; i < n; i++) { scanf ("%d", &a[i]); } s[0] = a[0]; for (i = 1; i < n; i++) { temp = a[i]; j = i - 1; while ((s[j] > temp) &&

Circular Queue

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 04:08:00 -0800

#include# define max 4struct cque{ int cque[max]; int f,r;}c;main(){ c.f=0; c.r=-1; int k=1,ch; while(k==1) {printf("\t\t MENU\n" "\t1.INSERT\n" "\t2.DELETE\n" "\t3.DISPLAY\n" "\t4.EXIT\n" "\tEnter Your Choice:\n"); scanf("%d",&ch); switch(ch) { case 1: insert(); break; case 2:

BMP EdgeDetection (Monocrome Image)

noreply@blogger.com (renlabs) — Mon, 26 Nov 2007 03:38:00 -0800

//BMP.h// Created by Renjith and Sajith#include #include #pragma oncestruct _v3f{ _v3f( ): x(0.0f), y(0.0f), z(0.0f) //default constructor { }; _v3f(float xx, float yy, float zz )//3 argument constructor { x = xx; y = yy; z = zz; } float x; float y; float z;};class CBmp { //Type definitions typedef std::vector<_v3f> vec3f; typedef std::

Classes (I)

noreply@blogger.com (renlabs) — Sat, 27 Oct 2007 10:53:00 -0700

Classes (I)A class is an expanded concept of a data structure: instead of holding only data, it can hold both data and functions.An object is an instantiation of a class. In terms of variables, a class would be the type, and an object would be the variable.Classes are generally declared using the keyword class, with the following format:class class_name { access_specifier_1: member1;

Data Structures

noreply@blogger.com (renlabs) — Sat, 27 Oct 2007 10:51:00 -0700

Data StructuresWe have already learned how groups of sequential data can be used in C++. But this is somewhat restrictive, since in many occasions what we want to store are not mere sequences of elements all of the same data type, but sets of different elements with different data types.Data structures A data structure is a group of data elements grouped together under one name. These data

Dynamic Memory

noreply@blogger.com (renlabs) — Sat, 27 Oct 2007 10:45:00 -0700

Dynamic MemoryUntil now, in all our programs, we have only had as much memory available as we declared for our variables, having the size of all of them to be determined in the source code, before the execution of the program. But, what if we need a variable amount of memory that can only be determined during runtime? For example, in the case that we need some user input to determine the

Arrays

noreply@blogger.com (renlabs) — Sat, 27 Oct 2007 10:38:00 -0700

ArraysAn array is a series of elements of the same type placed in contiguous memory locations that can be individually referenced by adding an index to a unique identifier.That means that, for example, we can store 5 values of type int in an array without having to declare 5 different variables, each one with a different identifier. Instead of that, using an array we can store 5 different values

Pointers

noreply@blogger.com (renlabs) — Sat, 27 Oct 2007 10:30:00 -0700

Pointers We have already seen how variables are seen as memory cells that can be accessed using their identifiers. This way we did not have to care about the physical location of our data within memory, we simply used its identifier whenever we wanted to refer to our variable.The memory of your computer can be imagined as a succession of memory cells, each one of the minimal size that computers

Leap Year (C++)

noreply@blogger.com (renlabs) — Mon, 25 Jun 2007 12:29:00 -0700

#include "stdio.h"#define TRUE 1#define FALSE 0int is_leap_year(int year);/*-------------------------------------------*/int date_is_valid(int day, int month, int year){int valid = TRUE;int month_length[13] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };if ( is_leap_year(year) ) month_length[2] = 29; // 29 days in February in a leap year (including year 2000)if ( month <> 12 ) valid =

Reading Directory with C/C++

noreply@blogger.com (renlabs) — Mon, 25 Jun 2007 12:27:00 -0700

//Read A Director//Tested in Linux and SOLARIS#include " stdio.h"#include "dirent.h"#include " errno.h" int main(){printf("opening Directory 1\n");DIR *pdir;struct dirent *pfile;pdir = opendir("ren");if(NULL == pdir){printf("Error Opening Directory\n");exit(0);}while(pfile = readdir(pdir)){if(0 == (strcmp(pfile->d_name,".")))continue;else if(0 == (strcmp(pfile->d_name,"..")))continue;

Singleton Class (One Design pattern Technique with C++)

noreply@blogger.com (renlabs) — Mon, 25 Jun 2007 12:22:00 -0700

What is a singleton class?A class whose number of instances that can be instantiated is limited to one is called a singleton class. Thus, at any given time only one instance can exist, no more.Can you give me an example, where it is used?The singleton design pattern is used whenever the design requires only one instance of a class. Some examples:Application classes. There should only be one

Shared Memory Access using semaphore

noreply@blogger.com (renlabs) — Mon, 25 Jun 2007 12:14:00 -0700

If you want to see how shared memory is implemented then go look at the Linux kernel source code.Here there is an exercise for you to understand the logic. But this is usefule only is you have good understanding of system level C language.This example if take from the website http://www.cs.cf.ac.uk (UNIX System Calls and Subroutines using C)shm_server.c#include <sys/types.h>#include <sys

Bulk Rename of files In a Directory (C sourcefile)

noreply@blogger.com (renlabs) — Mon, 25 Jun 2007 12:11:00 -0700

//Code tested in Linux and SOLARIS//Should be customized for individual use#include "stdio.h"#include "dirent.h"#include "errno.h"char *newname(char *,int,int);int main(){ char dirname[20]="ren"; DIR *pdir; struct dirent *pfile; char filename[20]="renji"; char tmppath[25]; static int i=0; static int len; len = strlen(filename); //printf("Enter Directory name:"); //scanf("%s",

Welcome to my blog

noreply@blogger.com (renlabs) — Tue, 19 Jun 2007 07:50:00 -0700

Its Renjith here