InTechgrity

Get post count of a category including sub-categories in WordPress

Swashata — Sun, 29 Jan 2012 13:39:46 +0000

From the title, you probably have guessed what I am going to talk about. In WordPress, we have many APIs to list down the category, but when we use the get_category function, it lacks the ability to show the post counts from its sub or child categories. Whereas, when we use query_posts or get_posts to get posts from a particular category, it returns posts from child categories as well.

I faced this problem, while developing the 2nd version of the WP-CPL plugin. So I came up with a custom function which will return total post counts from the specified category and its child categories (if any).

Here are the codes and the usage instruction.

The Custom Function:

function wp_get_cat_postcount($id) {
	$cat = get_category($id);
	$count = (int) $cat->count;
	$taxonomy = 'category';
	$args = array(
	  'child_of' => $id,
	);
	$tax_terms = get_terms($taxonomy,$args);
	foreach ($tax_terms as $tax_term) {
		$count +=$tax_term->count;
	}
	return $count;
}

Usage Guide:

The usage of this function is pretty straight forward. You call the function whenever you need passing the category id. Say, the category ID is 2. You call it with something like this:

The total number of posts under "My Awesome Category" is

Well, that’s all. Short and informative. If you have any questions, be sure to drop in using comments.

MySQL: Working with date time arithmetic #Part 2.3.1

Swashata — Mon, 19 Dec 2011 13:49:31 +0000

So, this is the second last part of the long awaited MySQL datetime series. Previously we have leant how to work with MySQL datetime datatypes and how to automate some insertions using some MySQL datetime commands. Obviously the only thing left to discuss is, the (difficult) datetime arithmetic inside MySQL. As in any language, the datetime arithmetic is not as straight forward as normal arithmetic. The reason is simple, we can’t say 2+2=4 while dealing with dates .

Suppose we have a date, ’2004-02-28′ in YYYY-MM-DD format (which is, a default datetime format for MySQL) and we want to add one more day to the date. So, the result is (supposedly) ’2004-03-01′. But wait, 2004 is a leap year, so it should be ’2004-02-29′, right?

These are only a few of the difficulties we face while dealing with datetime arithmetic. Luckily, like any efficient programming language, MySQL (although it is a structured query language) has it’s own set of functions to deal with all these datetime stuffs. Now let us see how we can effectively use those functions to do all our datetime stuffs with queries. But before we start, I would recommend you to go through these two posts related to MySQL:

Done? Okay, now let us move into further details. In this tutorial we will discuss only the basic and primary arithmetic. In 90% of the cases we will need only these concepts to get our jobs done. Please note that we will show nesting only with default current datetime mysql functions. The nesting is done basically depending on the format of the argument of the main function and format of the return of the nested function.

#1: The basic date time arithmetic in MySQL

To learn the basic arithmetic calculations, we need to learn three (basically two) date/time functions

DATE_ADD
DATE_SUB
ADDTIME
SUBTIME

#1.1: DATE_ADD – adds INTERVALS to date:

DATE_ADD, as the name suggests, adds specified interval to the provided date. The syntax and usage is given below.

Syntax:

DATE_ADD('YYYY-MM-DD HH:mm:SS', INTERVAL  )

So, it passes two arguments.

The first argument is the YYYY-MM-DD HH:mm:SS format. We can ignore the HH:mm:SS and use only YYYY-MM-DD in case we want only date related calculations.
The second argument passes the INTERVALwhich is to be added with the proper value. The expressions are
- expr: The positive or negative integer which to be added to the mentioned date
- UNIT: The unit of the expr. This can be day, month, hour, minute, second and so on. A detailed instruction is found on the table below.

UNIT	EXPR	Example
`MICROSECOND`	Microseconds	INTERVAL 100 MICROSECOND
`SECOND`	Seconds	INTERVAL -5 SECOND
`MINUTE`	Minutes	INTERVAL 30 MINUTE
`HOUR`	Hours	INTERVAL 2 HOUR
`DAY`	Days	INTERVAL 5 DAY
`WEEK`	Weeks	INTERVAL 2 WEEK
`MONTH`	Months	INTERVAL 4 MONTH
`YEAR`	Years	INTERVAL 2 YEAR

Those were only a few. More detailed list of Unit vs Expr can be found here.

Nesting:

The above function can also be nested with proper MySQL datetime functions. For example, CURDATE() or NOW() can be passed into the first argument.

Examples:

Here are some direct usage of DATE_ADD using SELECT query:

SELECT DATE_ADD('2004-02-28', INTERVAL 1 DAY) AS leap_year;
SELECT DATE_ADD(CURDATE(), INTERVAL 1 YEAR) AS day_next_year;
SELECT YEAR(DATE_ADD(CURDATE(), INTERVAL 101 YEAR)) AS next_101_year; --Extracts the year from the date_add arithmetic
SELECT DATE_ADD(NOW(), INTERVAL 30 MINUTE) AS time_next_half_hour;

The output is shown below

MySQL DATE_ADD Examples

#1.2: DATE_SUB – subtracts INTERVAL from date:

Theoretically, it does the same job as DATE_ADD with negative interval. So the following codes are similar

--So the code
SELECT DATE_SUB(CURDATE(), INTERVAL 1 DAY);
--is equivalent to
SELECT DATE_ADD(CURDATE(), INTERVAL -1 DAY);

It has the same synopsis (syntax) and expressions as DATE_ADD. The output of the above query is shown below.

DATE_ADD vs DATE_SUB in MySQL

#1.3: ADDTIME() and SUBTIME() to work only with time:

As the names suggest, ADDTIME() is used for adding time to a specified time and SUBTIME() is used for subtracting time from a specified time. Here are in depth details.

Syntax:

ADDTIME(, );

SUBTIME(, );

expr1, expr2 are both in HH:mm:SS format.
ADDTIME adds expr2 to expr1 and returns the result.
SUBTIME subtracts expr2 from expr1 and returns the result.

Nesting:

This can be nested with time returning functions such as CURTIME().

Examples:

SELECT ADDTIME('12:00:01', '00:30:59');
SELECT SUBTIME('12:59:03', '00:09:04');
SELECT ADDTIME(CURTIME(), '14:00:00');

The output is shown below

MySQL ADDTIME and SUBTIME

#2: Advance date-time arithmetic functions:

Now that we are familiar with the basics, let us now see, some advanced functions which will become handy in real world projects. Here we are going to discuss the following functions

DATEDIFF
TIMEDIFF
LASTDAY
EXTRACT
MAKEDATE
MAKETIME

#2.1: DATEDIFF – calculates days between two dates:

The difference between DATEDIFF and DATE_SUB is that, DATEDIFF returns the number of days between two dates. It can be either positive or negative.

Syntax:

DATEDIFF(, )

expr1, expr2 can be either YYYY-MM-DD HH:mm:SS or YYYY-MM-DD. Only YYYY-MM-DD will be used for the calculation
It returns expr1 – expr2 in number of days.

Nesting:

Due to the format of the arguments it supports, CURDATE() and NOW() can be nested.

Example:

SELECT DATEDIFF('2010-12-31', '2011-01-01');
SELECT DATEDIFF('2011-12-31', '2010-01-01');
SELECT DATEDIFF('2011-12-21', '2011-12-30');
SELECT DATEDIFF(DATE_ADD(CURDATE(), INTERVAL 1 MONTH), CURDATE());

The output is

Working with MySQL DATEDIFF

Food for thought:

Note how the last query can be used to get the number of days in the upcoming month. Now try and think how we can use similar query to get the number of days in upcoming year.

Want to check the answer?

SELECT DATEDIFF(DATE_ADD(NOW(), INTERVAL 1 YEAR), NOW());

CURDATE could also be used, instead of NOW

#2.2: TIMEDIFF – calculates HH:mm:SS b/w two times:

This is pretty straight forward. It takes two arguments in time format, subtracts and returns the result.

Syntax:

TIMEDIFF(, )

expr1, expr2 is of the format HH:mm:SS
It returns expr1 – expr2 as time value in HH:mm:SS format.

Nesting:

It can be nested with CURTIME() function. We will see this in the examples.

Examples:

SELECT TIMEDIFF('24:12:01', '12:12:00');
SELECT TIMEDIFF(CURTIME(), '00:30:00');

The output is shown below.

Using MySQL TIMEDIFF

#2.3: LAST_DAY – of specified month of date:

This returns the last day date of the year-month-day passed in the argument.

Syntax:

LAST_DAY()

date is the YYYY-MM-DD value passed.
It returns a YYYY-MM-DD which corresponds to the last day of the month of the year.

Nesting:

As obvious, it can be nested with CURDATE() function.

Examples:

SELECT LAST_DAY('2012-02-01');
SELECT LAST_DAY(CURDATE());

The output is

Using MySQL LAST_DAY

#2.4: EXTRACT – what you need from date/time stamp:

This allows extracting a specific part of the datetime from the passed argument.

Syntax:

EXTRACT( FROM )

The unit is same as DATE_ADD().
The date can be
- Complete YYYY-MM-DD HH:mm:SS
- Just date format as YYYY-MM-DD
- Just time format as HH:mm:SS

It returns just the expression for the specified unit.

Nesting:

Because of the flexibility, it can be nested with all the date time functions as NOW(), CURDATE(), CURTIME() etc.

Examples:

SELECT EXTRACT(MONTH FROM '2011-02-28');
SELECT EXTRACT(DAY FROM LAST_DAY('2012-02-01')); --effective eh?
SELECT EXTRACT(DAY FROM DATE_ADD(CURDATE(), INTERVAL 20 DAY)); --even more complex
SELECT EXTRACT(HOUR FROM CURTIME()); --Works with HH:mm:SS too

The outputs are

Using MySQL EXTRACT

#2.5: MAKEDATE – from year and day:

It constructs a date when the year and day of the year is given.

Syntax:

MAKEDATE(, )

The year is the year of which the date is to be calculated.
The day_of_year is the count of the day from the beginning.
It returns a date in YYYY-MM-DD format.

Nesting:

Due to the format of the input arguments, it can not be nested directly with any MySQL current datetime functions.

Examples:

SELECT MAKEDATE(2012, 365);
SELECT MAKEDATE(2010, DATEDIFF(CURDATE(), '2011-04-12'));
SELECT MAKEDATE(2000, DATEDIFF(CURDATE(), '2000-01-01'));
SELECT MAKEDATE(2000, DATEDIFF(DATE_ADD(CURDATE(), INTERVAL 1 DAY), '2000-01-01')) AS today;

The output is

Using MySQL MAKEDATE

Food for thought:

Note how the last query gives today’s date. Can you think further to give same date for the next year? As in, today’s date is 2011-12-19. Can you print 2012-12-19 in similar approach?

Want to check the answer?

SELECT MAKEDATE(2001, DATEDIFF(DATE_ADD(CURDATE(), INTERVAL 1 DAY), '2000-01-01')) AS next_year_today;

Easy right? We just took the difference from the same year and constructed from one more year (2001).

#2.6: MAKETIME – from HH, mm & SS:

This is very simple, yet useful function. It constructs a Time format from the given arguments.

Syntax:

MAKETIME(, , )

The hour, minute, secondarguments can hold only the legal values
- 0-59 for minute, second

It returns a nicely formatted HH:mm:SS value from the arguments.

Nesting:

Due to it’s format, it can not be nested with current datetime mysql functions.

Examples:

SELECT MAKETIME(12, 34, 11);
SELECT MAKETIME(12, EXTRACT(MINUTE FROM CURTIME()), 59);

The outputs are

Using MySQL MAKETIME

So that was all. Hope it will help you understand better the concept of MySQL datetime arithmetic. If you have any doubt, just throw in using the comments form. In the next tutorial, we will see how to use these functions in real world using a MySQL table. You can also check the official MySQL documentation for more available datetime functions. Oh, and here is a downloadable SQL file for your ease!

Download Now

C Program: Replacing a substring from a string

Swashata — Thu, 01 Dec 2011 05:31:06 +0000

This is a nice piece of program I wrote a few months ago. One of my students requested me to write this. So, here it is! Hope this might be useful for you…

#1: What the program does:

This program finds all the occurrences of a sub-string within a given string and replaces that with our provided string. Basically there are many similar programs but, most of them lack the ability to find multiple occurrences. So I wrote this keeping in mind that the search string may appear many times in the original string. Here is the algo:

Get the original, search and replace string from the user.
Write a user defined function to replace the first occurrence of the search string with the replace string.
Recursively call the function until there is no occurrence of the search string.

Yes, there are many flaws in this program, like if the search string is a part of the replace string, the function will fail. I will try to remove these bugs when I get enough time. But this program will do the job for you in your college semesters

#2: Source Code:

/**
 ****************************************************|
 * String replace Program                            |
 ****************************************************|
 * Takes three string input from the user
 * Replaces all the occurances of the second string
 * with the third string from the first string
 * @author Swashata
 */

/** Include Libraries */
#include 
#include 
#include 

/** Define the max char length */
#define MAX_L 4096

/** Prototypes */
void replace (char *, char *, char *);

int main(void) {
    char o_string[MAX_L], s_string[MAX_L], r_string[MAX_L]; //String storing variables

	printf("Please enter the original string (max length %d characters): ", MAX_L);
	fflush(stdin);
	gets(o_string);

	printf("\nPlease enter the string to search (max length %d characters): ", MAX_L);
	fflush(stdin);
	gets(s_string);

	printf("\nPlease enter the replace string (max length %d characters): ", MAX_L);
	fflush(stdin);
	gets(r_string);

	printf("\n\nThe Original string\n*************************************\n");
	puts(o_string);

	replace(o_string, s_string, r_string);

	printf("\n\nThe replaced string\n*************************************\n");
	puts(o_string);

    return 0;
}

/**
 * The replace function
 *
 * Searches all of the occurrences using recursion
 * and replaces with the given string
 * @param char * o_string The original string
 * @param char * s_string The string to search for
 * @param char * r_string The replace string
 * @return void The o_string passed is modified
 */
void replace(char * o_string, char * s_string, char * r_string) {
      //a buffer variable to do all replace things
      char buffer[MAX_L];
      //to store the pointer returned from strstr
      char * ch;

      //first exit condition
      if(!(ch = strstr(o_string, s_string)))
              return;

      //copy all the content to buffer before the first occurrence of the search string
      strncpy(buffer, o_string, ch-o_string);

      //prepare the buffer for appending by adding a null to the end of it
      buffer[ch-o_string] = 0;

      //append using sprintf function
      sprintf(buffer+(ch - o_string), "%s%s", r_string, ch + strlen(s_string));

      //empty o_string for copying
      o_string[0] = 0;
      strcpy(o_string, buffer);
      //pass recursively to replace other occurrences
      return replace(o_string, s_string, r_string);
 }

#3: Output:

String replace output

So that was it. If you have any better programming approach, then do share with us!

C Program: Adding two polynomials using Linked List

C Program: Adding two polynomials using Linked List

Swashata — Wed, 30 Nov 2011 06:26:13 +0000

So, this is our first C program in the blog. We first thought of creating a separate blog for C & C++ related posts, but because of the maintenance issue, we finally decided to merge it to the main blog. So, without any further here is the program.

#1: What the program does:

This program is a practical implementation of the data structure “Linked List“. We use a linked list to dynamically store user input of polynomial expressions and then we add two polynomials using some simple arithmetic. For this, we follow the simple strategy:

Make a polynomial abstract datatype using struct which basically implements a linked list.
We write different functions for Creating (ie, adding more nodes to the linked list) a polynomial function, Adding two polynomials and Showing a polynomial expression.
Finally we write the main function with menu driven ability to add as many pairs of polynomials the user wants.

#2: Source Code:

/**
 * Add two polynomials
 * Using Linked List
 * @author Swashata
 * @for Dearest Froggie
 */

#include
#include

/**
 * The structure for the polynomial
 * This is a linked list with two variable
 * int coeff The Coefficient
 * int pow The power of x
 */
typedef struct link {
	int coeff;
	int pow;
	struct link * next;
} my_poly;

/** The prototypes */
void my_create_poly(my_poly **);
void my_show_poly(my_poly *);
void my_add_poly(my_poly **, my_poly *, my_poly *);

/**
 * The simple menu driven main function
 */
int main(void) {
	int ch;
	do {
		my_poly * poly1, * poly2, * poly3;

		printf("\nCreate 1st expression\n");
		my_create_poly(&poly1);
		printf("\nStored the 1st expression");
		my_show_poly(poly1);

		printf("\nCreate 2nd expression\n");
		my_create_poly(&poly2);
		printf("\nStored the 2nd expression");
		my_show_poly(poly2);

		my_add_poly(&poly3, poly1, poly2);
		my_show_poly(poly3);

		printf("\nAdd two more expressions? (Y = 1/N = 0): ");
		scanf("%d", &ch);
	} while (ch);
	return 0;
}

/**
 * The create polynomial function
 * @param my_poly ** node The pointer to the head of the polynomial
 * We will modify the parameter and will store the base address
 * @return void
 */
void my_create_poly(my_poly ** node) {
	int flag; //A flag to control the menu
	int coeff, pow;
	my_poly * tmp_node; //To hold the temporary last address
	tmp_node = (my_poly *) malloc(sizeof(my_poly)); //create the first node
	*node = tmp_node; //Store the head address to the reference variable
	do {
		//Get the user data
		printf("\nEnter Coeff:");
		scanf("%d", &coeff);
		tmp_node->coeff = coeff;
		printf("\nEnter Pow:");
		scanf("%d", &pow);
		tmp_node->pow = pow;
		//Done storing user data

		//Now increase the Linked on user condition
		tmp_node->next = NULL;

		//Ask user for continuation
		printf("\nContinue adding more terms to the polynomial list?(Y = 1/N = 0): ");
		scanf("%d", &flag);
		//printf("\nFLAG: %c\n", flag);
		//Grow the linked list on condition
		if(flag) {
			tmp_node->next = (my_poly *) malloc(sizeof(my_poly)); //Grow the list
			tmp_node = tmp_node->next;
			tmp_node->next = NULL;
		}
	} while (flag);
}

/**
 * The show polynomial function
 * Prints the Polynomial in user readable format
 * @param my_poly * node The polynomial linked list
 * @return void
 */
void my_show_poly(my_poly * node) {
	printf("\nThe polynomial expression is:\n");
	while(node != NULL) {
		printf("%dx^%d", node->coeff, node->pow);
		node = node->next;
		if(node != NULL)
			printf(" + ");
	}
}

/**
 * The polynomial add function
 * Adds two polynomial to a given variable
 * @param my_poly ** result Stores the result
 * @param my_poly * poly1 The first polynomial expression
 * @param my_poly * poly2 The second polynomial expression
 * @return void
 */
void my_add_poly(my_poly ** result, my_poly * poly1, my_poly * poly2) {
	my_poly * tmp_node; //Temporary storage for the linked list
	tmp_node = (my_poly *) malloc(sizeof(my_poly));
	tmp_node->next = NULL;
	*result = tmp_node; //Copy the head address to the result linked list

	//Loop while both of the linked lists have value
	while(poly1 && poly2) {
		if (poly1->pow > poly2->pow) {
			tmp_node->pow = poly1->pow;
			tmp_node->coeff = poly1->coeff;
			poly1 = poly1->next;
		}
		else if (poly1->pow < poly2->pow) {
			tmp_node->pow = poly2->pow;
			tmp_node->coeff = poly2->coeff;
			poly2 = poly2->next;
		}
		else {
			tmp_node->pow = poly1->pow;
			tmp_node->coeff = poly1->coeff + poly2->coeff;
			poly1 = poly1->next;
			poly2 = poly2->next;
		}

		//Grow the linked list on condition
		if(poly1 && poly2) {
			tmp_node->next = (my_poly *) malloc(sizeof(my_poly));
			tmp_node = tmp_node->next;
			tmp_node->next = NULL;
		}
	}

	//Loop while either of the linked lists has value
	while(poly1 || poly2) {
		//We have to create the list at beginning
		//As the last while loop will not create any unnecessary node
		tmp_node->next = (my_poly *) malloc(sizeof(my_poly));
		tmp_node = tmp_node->next;
		tmp_node->next = NULL;

		if(poly1) {
			tmp_node->pow = poly1->pow;
			tmp_node->coeff = poly1->coeff;
			poly1 = poly1->next;
		}
		if(poly2) {
			tmp_node->pow = poly2->pow;
			tmp_node->coeff = poly2->coeff;
			poly2 = poly2->next;
		}
	}

	printf("\nAddition Complete");
}

#3: Output:

Entering the first expression

Entering second expression and showing result

So, that was all. If you think there is a better way, or have followed any other algorithm, don’t forget to drop them using comments.

C Program: Replacing a substring from a string

TimThumb vulerability – How it got hacked & how to recover

Swashata — Tue, 29 Nov 2011 11:12:45 +0000

In our last post, we talked about the fact that we got hacked because of TimThumb vulnerability. While fixing the vulnerability, I realized that, we were not the only one who got hacked. Plenty of websites using TimThumb to resize their images, got hacked. So, I thought of putting together a nice step by step guide on how to recover from this kind of hack. Please note that, while the nature of the hack may vary, we are trying to give an overall idea on recovering. I will focus mainly on WordPress themes using timthumb but, as I had other infected sites, I will discuss about disinfecting general php files too. This topic will cover

Get to know if your site is hacked
How the hack has occured
Cleaning your WordPress site
Cleaning your general PHP files
Searching the last trace of injected code using SSH

#1: Get to know if your site is hacked:

If you are an experienced webmaster then you probably know whether your site is hacked or not. If not, then there is a number of ways. The best way is to check using google webmaster.

If your site is registered at Google Webmaster then you probably have got a message related to badware activity.
If not then just visit StopBadware and check to see if there is any malware activity or not.

In most cases, it takes a while before Google detects malware on your site and gives you the warning. You can check even before that for any possible malwares. The common symptoms are

Malicious codes like
Button 1
This is Dialog One!

Button 2
This is Dialog One!

Button BIG

Another dialog prompt with a little bit More HTML

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Morbi et mauris erat. Morbi placerat semper sodales. Pellentesque sollicitudin quam id erat iaculis convallis eleifend odio aliquet. Aenean pulvinar adipiscing enim id sodales. Pellentesque tellus eros, interdum vel dignissim ac, dignissim sit amet dui. Integer felis augue, condimentum eget ullamcorper et, hendrerit at lacus. Nulla placerat ipsum at risus consectetur sit amet suscipit dui pellentesque. Sed sed elit a orci ornare posuere bibendum sodales turpis. Fusce euismod ante ut nunc pharetra facilisis. Nulla laoreet malesuada lacus, in sagittis urna adipiscing nec. Proin accumsan dolor vitae urna convallis non pretium odio convallis. Integer nisi lorem, varius in bibendum sit amet, scelerisque vel libero. Proin placerat pharetra congue. Sed tempus augue vitae nisl viverra hendrerit at nec purus. Vivamus laoreet erat vel turpis scelerisque at elementum sapien ultrices. Nulla at leo diam. Praesent hendrerit imperdiet ultricies. Curabitur vestibulum turpis in lacus faucibus convallis. Quisque nec magna nulla.

Nullam orci nisi, laoreet eget adipiscing sit amet, porta ut leo. Nulla at condimentum mauris. Duis sed lectus ligula, a scelerisque eros. Donec bibendum eleifend ullamcorper. Pellentesque eu ante sed augue feugiat condimentum sit amet eu leo. Sed sodales ipsum at risus iaculis ac bibendum odio faucibus. Phasellus leo ligula, euismod id interdum vel, convallis ac sapien. Sed ut felis mauris. Suspendisse faucibus aliquam tortor a convallis. Fusce aliquet libero id arcu condimentum tincidunt. Morbi laoreet, ante nec tristique porta, eros odio molestie urna, eget accumsan nibh ligula ut nisi. Curabitur suscipit eros at sapien vestibulum blandit ut vitae orci. Integer vitae risus ante, in dapibus felis. Curabitur dignissim nisl ut dui suscipit at eleifend metus feugiat. Maecenas porta sagittis aliquam.

Demo Download Now

For more information, you may like reading about jQuery UI dialog documentation or download the source code from above and try it yourself!

If you have any trouble understanding then feel free to ask! Also don’t forget to give your valuable comments.

Related posts:

iTg Sexy Horizontal 1 tier Dropdown menu

Swashata — Thu, 16 Jun 2011 17:37:45 +0000

Well, it has been a while since we announced the long awaited come back of ours… But it’s never too late to start . So here we are with a new Free Project! I was going through some free psds of navigation menus. I found one really good and thought of converting it to a nicely coded CSS/XHTML menu. But I couldn’t stop myself and added a bit of animation using jQuery! Here you can find the demo and the as obvious the download package.

Online Demo Download Now

All the necessary CSS, JS and XHTML files and image are included in the download package. Feel free if you wish to use this on your projects. Just include the copyright and license things .

As for the designing, thanks to COREGFX for freely providing us the necessary psd file. I have just added the dropdown into the psd. In the next post I will discuss more about the how the code works.

jQuery Vertical Sidebar Navigation menu for your Blog or Website – Free package by iTg

The evil spirits are back

Swashata — Thu, 05 May 2011 11:21:42 +0000

Finally someone reincarnated the evil spirits… It’s been quite a long (really loong) we were caught inside the bottle, but now we are free again. And just like those old fairy tales, after such a long time of thrall, we have become more powerful and stronger.

Yes! You have heard it right. We are now limited not only to WordPress… We have extended our knowledge to a better eCommerce platform, Open Cart. Thanks to our biggest client and hosting provider FlexiHost, we got chances to develop on Open Cart. So far we have made 4 Open Cart Modules and many small modifications. But this is just the beginning … So its not far when you will see another category “Open Cart” here at iTg.

We have a huge heap of drafts to complete and many requests to fulfill. We will try to deal with them as soon as possible…

And lastly thanks a lot for supporting us even when we were not updating our blog. Our visitor count has increased a lot and also we have improved our Alexa Ranking without actually doing anything. This was possible just for your support.

Anyways, we are not going to waste much time here. Our next upcoming post is related to something which our visitors have requested most since a past few weeks. So stay tuned

We are back with a bang – Top Commentator, Web Dev and Many More