Search In
You want to determine the space occupied by an element.
The width and height methods can be applied to any element, and they are useful for
determining the computed width or height of an element. However, they fall short if
you need to determine the
Benchmarking/load testing Jabber/XMPP Servers with Jabsimul
Please follow below link for benchmark
http://www.ejabberd.im/benchmark
./userreg -h localhost -u 3000 -n 1
Above command will create 3000 users with test_ username and password ‘passw
CakePHP do help us a lot with its own '€œForm'€* and '€œHTML'€* helpers but it often outputs some very ugly and hard to read HTML.
This little trick will make it a lot cleaner.
Create a file named app_helper.php in your app's root directory.
Next
The default superuser for PostgreSQL is called postgres. You may need to login as this user first.
Than use this commond in terminal
openerp@ubuntu:/$ sudo su postgres
password: XXXXXXXXXX
Now create PostgreSQL user openerp using the following com
IN Operator use:
It allows us to put multiple values in a where clause . With the help of this we can compare multiple values wtih where.
Syntax:
Select columnname(s) from Tablename where columnname IN(value1,value 2, .... value n);
Example:
SE
A function that call itself is known as *Recursive Function*. Recursive function keeps calling itself. We have to set a condition that will stop it, otherwise it will run infinitely. This condition is known as a base case. Basically, base case tells
To display MySQL server information in PHP a function mysql_get_server_info() is used. It returns version of MySQL server on success else false.
For example:
<php
//enter your hostname,username and password of mysql
mysql_connect("localhost", ""
Arrow functions are the functions that have a shorter syntax compared to function expressions and arrow function lexically bind the this value. Arrow functions effectively turn function (arguments) { expression } into arguments => expression and a
To Implement two stacks in an array
#include<iostream>
#include<stdlib.h>
using namespace std;
class twoStacks
{
int *a;
int size;
int top1, top2; //top of two stacks
public:
twoStacks(int n) // constructor
{
It is an improved variant of the binary search.For this algorithm to apply data should be in sorted form.
There are scenarios where the target location is already known. For example, in case of telephone directory the word to be searched is
