QSlider and UISwitch

This is how to write Qt stylesheet code to make QSlider just like iPhone UISwitch on/off toggle button.

1. In QDesigner, drag QSlider into your form.
2. Modify properties. Make “minimum” to be “0″, “maximum” to be “1″, “orientation” to be “Horizontal”, etc.
3. Insert following code into the stylesheet field.


QSlider {
min-width:80px;
min-height:27px;
max-width:80px;
max-height:27px;
}
QSlider::groove:horizontal {
background-image: url(:/images/slider_bg.png);
background-repeat: no-repeat;
background-position:center;
margin:0px;
border:0px;
padding:0px;
}

QSlider::sub-page:horizontal {
background-image: url(:/images/slider_on.png);
background-repeat: no-repeat;
background-position:left;
background-origin:content;
margin:0px;
border:0px;
padding-left:0px;
}

QSlider::add-page:horizontal {
background-image: url(:/images/slider_off.png);
background-repeat: no-repeat;
background-position:right;
background-origin:content;
margin:0px;
border:0px;
padding-right:0px;
}

QSlider::handle:horizontal {
background-image: url(:/images/slider_handle.png);
width:39px;
height:27px;
margin:0px;
border:0px;
padding:0px;
}

QSlider::sub-page:horizontal:disabled {
background-image: url(:/images/slider_on_disabled.png);
background-repeat: no-repeat;
background-position:left;
background-origin:content;
margin:0px;
border:0px;
padding-left:0px;
}

QSlider::add-page:horizontal:disabled {
background-image: url(:/images/slider_off_disabled.png);
background-repeat: no-repeat;
background-position:right;
background-origin:content;
margin:0px;
border:0px;
padding-right:0px;
}

QSlider::handle:horizontal:disabled {
background-image: url(:/images/slider_handle.png);
width:39px;
height:27px;
margin:0px;
border:0px;
padding:0px;
}

4. Create your own png files like following images.

slider_bg.png

slider_on.png

slider_off.png

slider_handle.png

5. Done.


bool MyUtil::removeDir(const QString& dirName)
{
    bool result = true;
    QDir dir(dirName);

    if (dir.exists(dirName))
    {
        Q_FOREACH(QFileInfo info, dir.entryInfoList(QDir::NoDotAndDotDot|QDir::AllDirs|QDir::Files, QDir::DirsFirst))
        {
            if (info.isDir())
                result = removeDir(info.absoluteFilePath());
            else
                result = QFile::remove(info.absoluteFilePath());

            if (!result)
                return result;
        }
        result = dir.rmdir(dirName);
    }
    else
    {
        QFile file(dirName);
        if (file.exists())
            result = file.remove();
    }

    return result;
}//removeDir()

http://csbarn.blogspot.com/2011/02/how-to-compile-ffmpegx264-for-windows.html

Scenario:

I have an Android java code which will call my JNI (NDK) native code. In my native code, I create a pthread and in my pthread loop, I called AttachCurrentThread() to the JVM in the beginning of the loop.

When my java code finish some jobs, I need to stop the pthread and it crashed at the end of pthread loop.

Solution:

So, before I exit my pthread loop (before calling pthread_exit), I need to make sure I do call DetachCurrentThread from JVM.

• create a speex jni android project with following command line

• create a sub directory called ‘jni’ under mySpeex; download libspeex tar file and extract under jni directory.

• create a Android.mk file with following content.

• build the native library.

Think: We can use one RxC matrix a input data, then allocate another RxC matrix to store to output data. But, can you think of a smallest memory allocation to solve compute the next generation of the RxC input?

Solution: Following is my solution with source code and typescript. In RxC matrix, if (R < C), then we create a 2xC matrix as a temporary matrix. Then store the next generation back to original RxC matrix. If (C < R), then we create a Rx2 matrix as a temporary matrix.

Script started on Fri 30 Jul 2010 10:27:48 AM PDT
slee@ubuntu:~/test$ cat Test.java
import java.lang.*;
import java.util.*;

public class Test
{
    private int W;
    private int H;
    private int[][] m_matrix;

    public Test(int row, int col)
    {
	H = row; W = col;
	m_matrix = new int[H][W];
	generateRandomInputMatrix();
    }

    private void generateRandomInputMatrix()
    {
	Random random = new Random();
	for (int y = 0; y < H; y++)
	    for (int x = 0; x < W; x++)
		m_matrix[y][x] = (random.nextBoolean() == true) ? 1 : 0;
	printMatrix("Init Matrix");
    }

    private int nextValue(int neighbor)
    {
	return (neighbor == 2 || neighbor == 3) ? 1 : 0;
    }

    public void computeNextGeneration()
    {
	boolean isWSmaller = (W < H);
	int temp[][] = null;
	int x, y, neighbor, tmpCur, tmpPrev;
	if (isWSmaller)
	    temp = new int[2][W]; //tempRow0=temp[0][x], tempRow1=temp[1][x]
	else
	    temp = new int[H][2]; //tempCol0=temp[y][0], tempCol1=temp[y][1]

	if (isWSmaller)
	{
	    //1. copy row0/row1 to tempRow0/tempRow1
	    for (x = 0; x < W; x++)
	    {
		temp[0][x] = m_matrix[0][x];
		temp[1][x] = m_matrix[1][x];
	    }

	    //2. compute row0 and replace matrix
	    //top-left corner & top-right corner
	    neighbor = temp[1][0] + m_matrix[0][1] + m_matrix[1][1]; // top-left corner
	    m_matrix[0][0] = nextValue(neighbor);
	    neighbor = temp[0][W-2] + m_matrix[1][W-2] + m_matrix[1][W-1]; // top-right corner
	    m_matrix[0][W-1] = nextValue(neighbor);
	    //row0 except 2 corners
	    for (x = 1; x < W-1; x++)
	    {
		neighbor = temp[0][x-1] + temp[0][x+1] + m_matrix[1][x-1] + m_matrix[1][x] + m_matrix[1][x+1];
		m_matrix[0][x] = nextValue(neighbor);
	    }

	    //2. for 2 ~ H-1
	    //	 if (even)
	    //	     copy rowN to tempRow0, compute generation rowN with tempRow1, and replace matrix
	    //	 if (odd)
	    //	     copy rowN to tempRow1, compute generation rowN with tempRow0, and replace matrix
	    //
	    for (y = 1; y < H-1; y++)
	    {
		tmpCur = y%2;
		tmpPrev = (tmpCur == 0) ? 1 : 0;

		//copy rowY to tempRowOdd or tempRowEven
		for (x = 0; x < W; x++)
		    temp[tmpCur][x] = m_matrix[y][x];

		//left-most & right-most side cell
		neighbor = temp[tmpPrev][0] + temp[tmpPrev][1] + temp[tmpCur][1] + m_matrix[y+1][0] + m_matrix[y+1][1]; //left side
		m_matrix[y][0] = nextValue(neighbor);
		neighbor = temp[tmpPrev][W-1] + temp[tmpPrev][W-2] + temp[tmpCur][W-2] + m_matrix[y+1][W-1] + m_matrix[y+1][W-2]; //right side
		m_matrix[y][W-1] = nextValue(neighbor);

		for (x = 1; x < W-1; x++)
		{
		    neighbor = temp[tmpPrev][x-1] + temp[tmpPrev][x] + temp[tmpPrev][x+1] +
			       temp[tmpCur][x-1] + temp[tmpCur][x+1] +
			       m_matrix[y+1][x-1] + m_matrix[y+1][x] + m_matrix[y+1][x+1];
		    m_matrix[y][x] = nextValue(neighbor);
		}//for(x)
	    }//for(y)

	    //3. last row; similar to row0
	    y = H-1;
	    tmpCur = y%2;
	    tmpPrev = (tmpCur == 0) ? 1 : 0;

	    //copy rowY to tempRowOdd or tempRowEven
	    for (x = 0; x < W; x++)
		temp[tmpCur][x] = m_matrix[y][x];
	    //bottom-left corner & bottom-right corner
	    neighbor = temp[tmpPrev][0] + temp[tmpPrev][1] + temp[tmpCur][1]; //bottom-left corner
	    m_matrix[y][0] = nextValue(neighbor);
	    neighbor = temp[tmpPrev][W-1] + temp[tmpPrev][W-2] + temp[tmpCur][W-2];//bottom-right corner
	    m_matrix[y][W-1] = nextValue(neighbor);
	    //rowN-1 except 2 corners
	    for (x = 1; x < W-1; x++)
	    {
		neighbor = temp[tmpPrev][x-1] + temp[tmpPrev][x] + temp[tmpPrev][x+1] + temp[tmpCur][x-1] + temp[tmpCur][x+1];
		m_matrix[y][x] = nextValue(neighbor);
	    }

	}
	else
	{
	    //1. copy col0/col1 to tempCol0/tempCol1
	    for (y = 0; y < H; y++)
	    {
		temp[y][0] = m_matrix[y][0];
		temp[y][1] = m_matrix[y][1];
	    }

	    //2. compute col0 and replace matrix
	    //top-left corner & bottom-left corner
	    neighbor = temp[1][0] + m_matrix[0][1] + m_matrix[1][1]; // top-left corner
	    m_matrix[0][0] = nextValue(neighbor);
	    neighbor = temp[H-2][0] + m_matrix[H-2][1] + m_matrix[H-1][1]; // bottom-left corner
	    m_matrix[H-1][0] = nextValue(neighbor);
	    //col0 except 2 corners
	    for (y = 1; y < H-1; y++)
	    {
		neighbor = temp[y-1][0] + temp[y+1][0] + m_matrix[y-1][1] + m_matrix[y][1] + m_matrix[y+1][1];
		m_matrix[y][0] = nextValue(neighbor);
	    }

	    //2. for 2 ~ W-1
	    //	 if (even)
	    //	     copy colN to tempCol0, compute generation colN with tempCol1, and replace matrix
	    //	 if (odd)
	    //	     copy colN to tempCol1, compute generation colN with tempCol0, and replace matrix
	    //
	    for (x = 1; x < W-1; x++)
	    {
		tmpCur = x%2;
		tmpPrev = (tmpCur == 0) ? 1 : 0;

		//copy colX to tempColOdd or tempColEven
		for (y = 0; y < H; y++)
		    temp[y][tmpCur] = m_matrix[y][x];

		//top-most & bottom-most side cell
		neighbor = temp[0][tmpPrev] + temp[1][tmpPrev] + temp[1][tmpCur] + m_matrix[0][x+1] + m_matrix[1][x+1]; //top side
		m_matrix[0][x] = nextValue(neighbor);
		neighbor = temp[H-1][tmpPrev] + temp[H-2][tmpPrev] + temp[H-2][tmpCur] + m_matrix[H-2][x+1] + m_matrix[H-1][x+1];//bottom side
		m_matrix[H-1][x] = nextValue(neighbor);

		for (y = 1; y < H-1; y++)
		{
		    neighbor = temp[y-1][tmpPrev] + temp[y][tmpPrev] + temp[y+1][tmpPrev] +
			       temp[y-1][tmpCur] + temp[y+1][tmpCur] +
			       m_matrix[y-1][x+1] + m_matrix[y][x+1] + m_matrix[y+1][x+1];
		    m_matrix[y][x] = nextValue(neighbor);
		}//for(y)
	    }//for(x)

	    //3. last col; similar col0
	    x = W-1;
	    tmpCur = x%2;
	    tmpPrev = (tmpCur == 0) ? 1 : 0;

	    //copy colX to tempColOdd or tempColEven
	    for (y = 0; y < H; y++)
		temp[y][tmpCur] = m_matrix[y][x];
	    //top-right corner & bottom-right corner
	    neighbor = temp[0][tmpPrev] + temp[1][tmpPrev] + temp[1][tmpCur];//top-right corner
	    m_matrix[0][x] = nextValue(neighbor);
	    neighbor = temp[H-2][tmpPrev] + temp[H-1][tmpPrev] + temp[H-2][tmpCur];//bottom-right corner
	    m_matrix[H-1][x] = nextValue(neighbor);
	    //colW-1 except 2 corners
	    for (y = 1; y < H-1; y++)
	    {
		neighbor = temp[y-1][tmpPrev] + temp[y][tmpPrev] + temp[y+1][tmpPrev] + temp[y-1][tmpCur] + temp[y+1][tmpCur];
		m_matrix[y][x] = nextValue(neighbor);
	    }

	}
    }//computeNextGeneration()

    public void printMatrix(String prompt)
    {
	System.out.println();
	System.out.println("======= " + prompt + " ========");
	StringBuilder sb = new StringBuilder();
	for (int y = 0; y < H; y++)
	{
	    sb.setLength(0);
	    for (int x = 0; x < W; x++)
	    {
		if (m_matrix[y][x] == 1)
		    sb.append((int)1);
		else
		    sb.append((int)0);
		sb.append(" ");
	    }
	    System.out.println(sb.toString());
	}
    }//printMatrix()

    public static void main(String[] args)
    {
	if (args.length != 3)
	{
	    System.out.println("Usage: Test row col generation_times");
	    return;
	}

	int row, col, gen;
	try
	{
	    row = Integer.parseInt(args[0]);
	    col = Integer.parseInt(args[1]);
	    gen = Integer.parseInt(args[2]);
	} catch (Exception e)
	{
	    System.out.println("Usage: Test row col generation_times");
	    return;
	}

	Test t = new Test(row, col);

	for (int i=1; i<=gen; i++)
	{
	    t.computeNextGeneration();
	    t.printMatrix("" + i + "th Generation");
	}

    }//main()
}//class - Test

slee@ubuntu:~/test$ javac Test.java
slee@ubuntu:~/test$ java Test 10 20 4

======= Init Matrix ========
1 1 1 1 0 0 1 0 1 0 0 1 0 0 0 1 1 0 1 1
1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0
0 0 0 0 1 1 0 1 1 1 0 0 1 0 1 0 0 1 0 0
1 0 1 0 1 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1
0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 1 1 0
1 0 1 1 1 0 1 0 0 1 0 0 0 1 1 0 0 0 0 0
1 1 1 1 0 0 1 1 0 1 0 0 1 1 1 0 1 1 0 1
0 1 0 0 1 0 1 0 0 0 1 1 0 1 0 1 1 1 0 0
0 0 1 1 0 1 0 0 1 1 1 1 1 1 0 0 0 0 1 1
1 1 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0 0 1

======= 1th Generation ========
1 1 1 0 1 1 0 1 0 0 0 0 0 0 1 1 1 1 0 0
1 0 1 1 0 1 0 0 0 1 1 1 1 1 1 0 1 0 1 1
1 1 0 1 1 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1
0 1 1 0 1 1 1 1 0 0 1 1 1 0 1 0 1 0 0 1
1 0 0 0 0 1 1 1 0 1 1 1 1 0 1 0 0 1 1 1
1 0 0 0 1 1 1 1 0 1 1 1 0 0 1 1 1 0 0 1
1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 0 0 1 1 0
1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1
1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 1
0 1 1 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 1 1

======= 2th Generation ========
1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1
0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1
1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
1 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1
1 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1
1 1 0 1 1 0 0 0 0 1 0 1 1 0 1 0 0 1 1 1
1 1 0 0 0 1 1 0 0 0 1 0 0 0 1 1 0 0 0 1
1 0 1 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 0
1 1 0 1 0 1 1 1 0 1 1 0 0 0 0 1 1 0 0 1

======= 3th Generation ========
0 1 0 1 0 1 1 1 1 1 1 1 0 1 0 1 0 1 1 1
1 1 0 1 1 1 0 1 0 0 0 1 1 1 0 1 1 1 0 1
0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0
1 0 1 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 1 0
1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0
0 0 0 0 1 1 0 0 0 0 1 1 1 0 0 0 1 0 0 1
0 0 0 1 1 0 1 0 0 0 1 1 1 0 0 0 0 1 0 1
0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1
0 0 0 1 0 0 0 1 1 0 0 1 0 1 0 0 0 1 1 1
1 1 0 1 0 1 1 0 1 1 1 1 0 0 1 0 0 1 1 0

======= 4th Generation ========
1 1 0 1 0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 1
1 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1
0 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1
1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 1 1 0 1
0 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1
0 1 1 0 0 0 1 0 0 1 1 0 1 1 0 1 1 0 0 1
0 0 0 1 0 0 1 1 0 1 1 0 0 1 0 0 1 0 0 1
0 0 1 1 0 1 1 0 1 1 1 0 0 1 0 0 1 1 0 1
1 1 1 0 0 1 0 0 0 0 0 1 0 1 1 0 1 1 0 1
0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 1 0 1
slee@ubuntu:~/test$ java Test 20 10 4

======= Init Matrix ========
0 1 1 1 1 0 0 0 0 1
1 0 1 0 0 0 0 1 0 1
1 1 1 1 0 1 0 1 1 1
0 1 0 0 1 1 0 0 1 1
1 0 1 0 1 0 0 0 1 1
0 0 1 0 0 0 1 1 0 1
0 1 0 1 0 0 1 0 1 1
1 0 1 1 0 0 1 0 1 0
0 0 0 1 0 0 0 1 0 0
0 1 0 1 1 1 1 1 1 1
1 1 0 0 1 0 0 1 1 0
1 0 0 1 1 1 1 1 0 1
1 1 0 1 0 0 1 1 1 0
0 1 0 0 0 0 0 0 0 1
0 1 1 0 0 1 0 1 0 0
0 1 0 0 0 0 0 1 1 0
1 0 1 1 0 1 0 1 1 0
0 0 0 1 0 1 1 0 0 0
1 0 0 0 0 0 1 0 0 1
1 1 1 1 0 0 1 0 0 1

======= 1th Generation ========
1 1 1 1 0 0 0 0 1 0
1 0 0 0 0 1 1 1 0 1
1 0 0 1 0 1 0 1 0 0
0 0 0 0 0 1 1 0 0 0
0 0 1 0 1 0 1 0 0 0
1 0 1 0 1 1 1 0 0 0
1 1 0 1 1 1 1 0 0 1
0 1 0 1 1 1 1 0 1 1
1 1 0 0 0 0 0 0 0 1
1 1 0 1 0 1 0 0 0 1
1 1 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 1
1 1 0 1 0 0 0 0 0 1
0 0 0 1 1 1 0 0 0 0
1 1 1 0 0 0 1 1 0 1
1 0 0 1 1 1 0 0 0 1
0 1 1 1 0 1 0 0 1 1
1 1 1 1 0 1 0 0 1 1
1 0 0 1 1 0 1 1 1 0
1 1 1 0 0 1 0 1 1 0

======= 2th Generation ========
1 1 1 0 1 1 1 1 1 1
1 0 0 1 0 1 0 1 0 0
0 1 0 0 0 0 0 1 1 0
0 1 1 1 0 0 0 1 0 0
0 1 0 0 1 0 0 1 0 0
1 0 1 0 0 0 0 1 0 0
1 0 0 0 0 0 0 0 1 1
0 0 0 1 0 0 1 1 1 1
0 0 0 1 0 0 1 1 0 1
0 0 0 0 1 0 0 0 1 0
1 1 0 1 1 0 0 0 1 1
0 0 0 0 1 0 0 0 1 0
0 0 0 1 0 1 0 0 1 0
0 0 0 1 1 1 1 1 1 1
1 1 1 0 0 0 1 0 1 0
1 0 0 0 0 1 0 1 0 1
0 0 0 0 0 1 1 1 0 0
1 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 0 0 1 1

======= 3th Generation ========
1 1 1 1 1 1 0 1 1 0
1 0 0 1 0 1 0 0 0 1
1 1 0 1 1 0 0 1 1 0
1 1 0 1 1 0 1 1 0 0
1 0 0 0 0 0 1 1 1 0
1 0 0 1 0 0 1 1 0 1
0 1 1 1 0 0 1 0 0 1
0 0 1 0 1 1 1 0 0 0
0 0 1 1 1 1 1 0 0 1
1 1 1 0 1 1 1 0 0 0
0 0 1 1 1 1 0 1 1 1
1 1 1 0 0 1 0 1 1 0
0 0 1 1 0 0 0 0 0 0
1 1 0 1 0 0 0 0 0 1
1 1 1 1 0 0 0 0 0 0
1 0 1 0 1 1 0 0 0 0
1 1 0 0 1 1 0 1 1 0
0 0 0 0 1 1 0 1 0 0
1 0 1 1 0 1 1 0 1 1
0 1 1 1 1 0 0 0 0 0

======= 4th Generation ========
1 1 1 1 0 1 1 0 1 1
0 0 0 0 0 1 0 0 0 1
0 0 0 0 0 0 0 1 1 1
0 0 0 1 1 0 0 0 0 1
1 0 1 1 1 0 0 0 0 1
1 0 0 1 1 1 0 0 0 1
1 1 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 1 1 1
1 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 1 0 1 0 1
0 0 0 1 1 0 1 1 1 1
1 0 0 0 1 0 0 0 0 0
0 0 0 0 0 1 0 0 0 0
0 0 0 0 0 1 1 1 1 0
1 1 1 0 0 0 0 1 1 0
1 0 1 0 0 0 0 0 0 1
0 0 0 0 0 0 1 1 1 0
1 1 0 0 1 1 1 1 1 1
slee@ubuntu:~/test$ exit
exit

Script done on Fri 30 Jul 2010 10:28:08 AM PDT

#ifndef CURL_STATICLIB
#define CURL_STATICLIB
#endif
#include <curl/curl.h>

//===========================================
typedef struct IOData
{
    char     *m_senddata;
    int       m_sendlen;
    char     *m_readdata;
    int       m_readlen;
 
    int       m_readAllocLen;
} IOData;
 
typedef struct DebugData
{
    char      m_trace_ascii; //1 or 0
} DebugData;
class MyCurl
{
public:
    MyCurl(int sNum, bool needCookieInfo, const char *url, const char *sslcert = 0, const char *sslkey = 0, const char *proxyHost = 0, long proxyPort = 0, const char *proxyUserPwd = 0);
    virtual ~MyCurl();

    //caller will need to delete[] rturned buf
    char *write(const char *senddata, int sendlen, int& readlen, bool& success);
    void  setBandwidth(long sendKbPerSec, long recvKbPerSec);

    static void   s_initUnInitLibCurl(bool isInit);
private:
    static size_t s_writeFunc(void *ptr, size_t size, size_t nmemb, void *data);
    static size_t s_headerFunc(void *ptr, size_t size, size_t nmemb, void *data);
    static int    s_debugFunc(CURL *handle, curl_infotype type, unsigned char *data, size_t size, void *userp);
    static bool   s_hasInitialized;
private:
    void          init();

    CURL                  *m_handle;
    struct curl_slist     *m_header;

    char                   m_resCookie[512];
    char                   m_url[512];
    char                   m_sslcert[512];
    char                   m_sslkey[512];
    char                   m_proxyHost[512];
    long                   m_proxyPort;
    char                   m_proxyUserPwd[512];
    bool                   m_needCookieInfo;
    IOData                 m_ioData;
    int                    m_staticNum;

};

#endif // _MYCURL_H_

 Source File:
#include “mycurl.h”
#include “globals.h”
#include <stdio.h>
#include <stdlib.h>
#include <strings.h>
#include <string.h>
 
//============ static1 =====================
size_t MyCurl::s_writeFunc(void *ptr, size_t size, size_t nmemb, void *userp)
{
    //data is m_ioData
    int readlen = size * nmemb;
 
    IOData *data = (IOData *)(userp);
 
    if (readlen > 0 && readlen < 1024000)
    {
        if ((data->m_readlen + readlen) >= data->m_readAllocLen)
        {
            fprintf(stderr, “====== realloc %d %d %d==\n”, data->m_readlen, data->m_readAllocLen, readlen);
            char *savedBuf = 0;
            if (data->m_readlen > 0)
            {
                savedBuf = new char[data->m_readlen];
                memcpy(savedBuf, data->m_readdata, data->m_readlen);
            }
            delete[] data->m_readdata;
            data->m_readdata = 0;
            do 
            {
                data->m_readAllocLen = (data->m_readAllocLen * 2);
                fprintf(stderr, “====loop = realloc %d %d %d==\n”, data->m_readlen, data->m_readAllocLen, readlen);
            } while((data->m_readlen + readlen) >= data->m_readAllocLen);
            data->m_readdata = new char[data->m_readAllocLen];
            if (savedBuf)
            {
                memcpy(data->m_readdata, savedBuf, data->m_readlen);
                delete[] savedBuf;
                savedBuf = 0;
            }
        }
        memcpy(data->m_readdata + data->m_readlen, (char *)(ptr), readlen);
        data->m_readlen += readlen;
    }
    else
    {
        if (gDebugLevel > 0)
        {
            fprintf(stderr, “%s ===== Weird %d ======\n”, getTimeStamp(), readlen);
            fflush(stderr);
        }
    }
 
    return readlen;
}//s_writeFunc
 
size_t MyCurl::s_headerFunc(void *ptr, size_t size, size_t nmemb, void *data)
{
    int readlen = size * nmemb;
    if (strncmp((char *)ptr, “Set-Cookie”, 10) == 0)
    {
        char *cookie = new char[readlen];
        //strncpy((char *)data, (char *)ptr + 12, readlen);
        strncpy(cookie, (char *)ptr + 12, readlen);
        char *sep = strchr(cookie, ‘;’);
        if (sep)
            strncpy((char *)data, cookie, sep-cookie);
        else
            strcpy((char *)data, cookie);
 
        delete[] cookie;
        cookie = 0;
    }
 
    return readlen;
}//s_headerFunc
 
int  MyCurl::s_debugFunc(CURL *handle, curl_infotype type, unsigned char *data, size_t size, void *userp)
{
    DebugData *dd = (DebugData *)(userp);
 
    char prompt[64];
 
    switch (type)
    {
    case CURLINFO_HEADER_OUT:
        sprintf(prompt, “%s [CURL][H=>] “, getTimeStamp());
        break;
    case CURLINFO_DATA_OUT:
        sprintf(prompt, “%s [CURL][D=>] “, getTimeStamp());
        break;
    case CURLINFO_SSL_DATA_OUT:
        sprintf(prompt, “%s [CURL][S=>] “, getTimeStamp());
        break;
    case CURLINFO_HEADER_IN:
        sprintf(prompt, “%s [CURL][<=H] “, getTimeStamp());
        break;
    case CURLINFO_DATA_IN:
        sprintf(prompt, “%s [CURL][<=D] “, getTimeStamp());
        break;
    case CURLINFO_SSL_DATA_IN:
        sprintf(prompt, “%s [CURL][<=S] “, getTimeStamp());
        break;
    case CURLINFO_TEXT:
        fprintf(stderr, “%s [CURL][T] %s\n”, getTimeStamp(), data);
        fflush(stderr);
    default:
        return 0;
    }
 
    size_t i;
    size_t c;
    unsigned int w = 0×10;
 
    if (dd->m_trace_ascii)
        w = 0×40;
 
    fprintf(stderr, “%s, %zd bytes (0x%zx)\n”, prompt, size, size);
 
    for (i=0; i<size; i+=w)
    {
        fprintf(stderr, “%04zx: “, i);
 
        if (!dd->m_trace_ascii)
        {
            for (c=0; c<w; c++)
            {
                if (i+c < size)
                    fprintf(stderr, “%02x “, data[i+c]);
                else 
                    fprintf(stderr, “   “);
            }
        }
 
        for (c=0; (c<w) && (i+c < size); c++)
        {
            //check for 0D0A; if found, skip past and start a new line
            if (dd->m_trace_ascii && (i+c+1 < size) && data[i+c] == 0x0D && data[i+c+1] == 0x0A)
            {
                i += (c+2-w);
                break;
            }
 
            fprintf(stderr, “%c”, (data[i+c]>=0×20) && (data[i+c]<0×80) ? data[i+c] : ‘.’);
 
            //check again for 0D0A, to avoid an extra \n if it’s at width
            if (dd->m_trace_ascii && (i+c+2<size) && data[i+c+1]==0x0D && data[i+c+2]==0x0A)
            {
                i += (c+3-w);
                break;
            }
        }//in for
        fprintf(stderr, “\n”);
    }//out for
 
    fflush(stderr);
    return 0;
}//s_debugFunc
 
 
 
void MyCurl::s_initUnInitLibCurl(bool isInit)
{
    if (isInit && !s_hasInitialized)
    {
        curl_global_init(CURL_GLOBAL_ALL);
        s_hasInitialized = true;
    }
 
    if (!isInit)
        curl_global_cleanup();
}//s_initUnInitLibCurl

 
//=============================================================
MyCurl::MyCurl(int sNum, bool needCookieInfo, const char *url, const char *sslcert, const char *sslkey, const char *proxyHost, long proxyPort, const char *proxyUserPwd)
       :m_handle(0),
        m_header(0),
        m_needCookieInfo(needCookieInfo),
        m_staticNum(sNum)
{
    s_initUnInitLibCurl(true);

    strcpy(m_url, url);   
    if (sslcert)
        strcpy(m_sslcert, sslcert);
    else
        m_sslcert[0] = 0;
    if (sslkey)
        strcpy(m_sslkey, sslkey);
    else
        m_sslkey[0] = 0;
    if (proxyHost)
        strcpy(m_proxyHost, proxyHost);
    else
        m_proxyHost[0] = 0;
    m_proxyPort = proxyPort;
    if (proxyUserPwd)
        strcpy(m_proxyUserPwd, proxyUserPwd);
    else
        m_proxyUserPwd[0] = 0;
    m_resCookie[0] = 0;

    m_ioData.m_senddata = 0;
    m_ioData.m_sendlen = 0;
    m_ioData.m_readlen = 0;
    m_ioData.m_readAllocLen = /*20480*/65000;
    m_ioData.m_readdata = new char[m_ioData.m_readAllocLen];

    init();
}

MyCurl::~MyCurl()
{
    curl_slist_free_all(m_header);
    curl_easy_cleanup(m_handle);
 
    delete[] m_ioData.m_readdata;
}

void MyCurl::init()
{
    m_handle = curl_easy_init();

    //set url
    curl_easy_setopt(m_handle, CURLOPT_URL, m_url);

    //set proxy
    if (m_proxyHost && m_proxyPort > 0)
    {
        curl_easy_setopt(m_handle, CURLOPT_PROXY, m_proxyHost);
        curl_easy_setopt(m_handle, CURLOPT_PROXYPORT, m_proxyPort);

        //set proxy auth
        if (m_proxyUserPwd)
        {
            curl_easy_setopt(m_handle, CURLOPT_PROXYUSERPWD, m_proxyUserPwd);
        }
    }

    //ssl
    if (m_sslcert[0] != 0 && m_sslkey[0] != 0)
    {
        if (gDebugLevel > 0)
        {
            fprintf(stderr, “%s MyCurl::init() sslcert=%s sslkey=%s\n”, getTimeStamp(), m_sslcert, m_sslkey);
            fflush(stderr);
        }
        curl_easy_setopt(m_handle, CURLOPT_SSLCERT, m_sslcert);
        curl_easy_setopt(m_handle, CURLOPT_SSLKEY,  m_sslkey);
    }
    curl_easy_setopt(m_handle, CURLOPT_SSL_VERIFYHOST, 1);
    curl_easy_setopt(m_handle, CURLOPT_SSL_VERIFYPEER, false);

/*
    long timeout = 30;
    //set timeout 30(sec) for connection establishment phase
    curl_easy_setopt(m_handle, CURLOPT_CONNECTTIMEOUT, timeout);

    //set timeout 60(sec) for overall transfer operation
    timeout = 60;
    curl_easy_setopt(m_handle, CURLOPT_TIMEOUT, timeout);

    //for unix-mult-threaded process, avoid using kernel signals to enable nonblocking system calls
    curl_easy_setopt(m_handle, CURLOPT_NOSIGNAL, 1);
*/

    m_header = curl_slist_append(m_header, “Accept:”);

    //callback
    curl_easy_setopt(m_handle, CURLOPT_WRITEFUNCTION, MyCurl::s_writeFunc);
    curl_easy_setopt(m_handle, CURLOPT_WRITEDATA, (void *)&m_ioData);

    if (m_needCookieInfo)
    {
        curl_easy_setopt(m_handle, CURLOPT_HEADERFUNCTION, MyCurl::s_headerFunc);
        curl_easy_setopt(m_handle, CURLOPT_WRITEHEADER, (void *)m_resCookie);
    }
 
if (0)
{
    //debug
    if (gDebugLevel > 0)
    {
        DebugData dd;
        dd.m_trace_ascii = 1; 
        curl_easy_setopt(m_handle, CURLOPT_DEBUGFUNCTION, MyCurl::s_debugFunc);
        curl_easy_setopt(m_handle, CURLOPT_DEBUGDATA, &dd);
        curl_easy_setopt(m_handle, CURLOPT_VERBOSE, 1);
    }
}
 
    //set header request property
    m_header = curl_slist_append(m_header, “Content-Type: application/octet-stream”);
    m_header = curl_slist_append(m_header, “Pragma: no-cache”);
    m_header = curl_slist_append(m_header, “Cache-Control: no-cache”);
    m_header = curl_slist_append(m_header, “Connection: Keep-Alive”);
    if (m_needCookieInfo && m_resCookie[0] != 0)
    {
        //TODO : does it work??
        char cookiestr[512];
        strcpy(cookiestr, “Cookie: “);
        strcat(cookiestr, m_resCookie);
        m_header = curl_slist_append(m_header, cookiestr); 
        m_resCookie[0] = 0;
    }

    curl_easy_setopt(m_handle, CURLOPT_HTTPHEADER, m_header);
}//init()

char *MyCurl::write(const char *senddata, int sendlen, int& readlen, bool& success)
{
    m_ioData.m_senddata = (char *)senddata;
    m_ioData.m_sendlen = sendlen;
    m_ioData.m_readlen = 0;
 
    if (m_needCookieInfo && m_resCookie[0] != 0)
    {
        //TODO : does it work??
        char cookiestr[512];
        strcpy(cookiestr, “Cookie: “);
        strcat(cookiestr, m_resCookie);
        m_header = curl_slist_append(m_header, cookiestr); 
        m_resCookie[0] = 0;
        curl_easy_setopt(m_handle, CURLOPT_HTTPHEADER, m_header);
    }
 

    curl_easy_setopt(m_handle, CURLOPT_POSTFIELDS, m_ioData.m_senddata);
    curl_easy_setopt(m_handle, CURLOPT_POSTFIELDSIZE, m_ioData.m_sendlen);

    int ret = curl_easy_perform(m_handle);

    if (ret == CURLE_OK)
    {
        long curlRetCode;
        curl_easy_getinfo(m_handle, CURLINFO_RESPONSE_CODE, &curlRetCode);
        if (curlRetCode == 407)
        {
            fprintf(stderr, “proxy auth failure”);
            fflush(stderr);
        } 
        success = true;
    }
    else
    {
        fprintf(stderr, “%s —> %d CURLE_NOT_OK ret = %d\n”, getTimeStamp(), m_staticNum, ret);
        fflush(stderr);
        success = false;
    }
 
    //caller will need to delete[] retBuf
    char *retBuf = 0;
    if (success && m_ioData.m_readlen > 0 && m_ioData.m_readlen < 1024000) //Protection
    {
        retBuf = new char[m_ioData.m_readlen];
        memcpy(retBuf, m_ioData.m_readdata, m_ioData.m_readlen);
        readlen = m_ioData.m_readlen;
    }
 
    return retBuf;
}

void MyCurl::setBandwidth(long sendKbPerSec, long recvKbPerSec)
{
    //MUST: libcurl > 7.15.5
    curl_off_t  sendspeed = sendKbPerSec * 1024;
    curl_off_t  recvspeed = recvKbPerSec * 1024;

    curl_easy_setopt(m_handle, CURLOPT_MAX_SEND_SPEED_LARGE, sendspeed);
    curl_easy_setopt(m_handle, CURLOPT_MAX_RECV_SPEED_LARGE, recvspeed);
}
 

bool MyCurl::s_hasInitialized = false;

I don’t have the IR remote device, but, I believe it is doable.

1. You will need to write a win32 application that can control pan/tilt/zoom of orbit.
2. And in that application, you will need to listen (catch) keyboard events; such as up/down/right/left arrow key events.
3. For instance, in your app, once you catch UP key even, your app will call DirectShow functions to let orbit moving up.

It is not hard, but, you will have some knowledge of DirectShow programming.

LOCAL_PATH := $(call my-dir)

include $(CLEAR_VARS)

LOCAL_MODULE    := libxvidcore
#LOCAL_CFLAGS = -DFIXED_POINT -DEXPORT=”" -UHAVE_CONFIG_H -I$(LOCAL_PATH)/include
LOCAL_CFLAGS := -DARCH_IS_32BIT -DARCH_IS_GENERIC -I$(LOCAL_PATH)/src

LOCAL_SRC_FILES :=  \
./src/decoder.c \
./src/encoder.c \
./src/xvid.c \
./src/bitstream/bitstream.c \
./src/bitstream/cbp.c \
./src/bitstream/mbcoding.c \
./src/dct/fdct.c \
./src/dct/idct.c \
./src/dct/simple_idct.c \
./src/image/colorspace.c \
./src/image/image.c \
./src/image/interpolate8x8.c \
./src/image/font.c \
./src/image/postprocessing.c \
./src/image/qpel.c \
./src/image/reduced.c \
./src/motion/estimation_bvop.c \
./src/motion/estimation_common.c \
./src/motion/estimation_gmc.c \
./src/motion/estimation_pvop.c \
./src/motion/estimation_rd_based.c \
./src/motion/estimation_rd_based_bvop.c \

./src/motion/gmc.c \

./src/motion/motion_comp.c \
./src/motion/vop_type_decision.c \
./src/motion/sad.c \
./src/prediction/mbprediction.c \
./src/plugins/plugin_single.c \
./src/plugins/plugin_2pass1.c \
./src/plugins/plugin_2pass2.c \
./src/plugins/plugin_lumimasking.c \
./src/plugins/plugin_dump.c \
./src/plugins/plugin_psnr.c \
./src/plugins/plugin_ssim.c \
./src/quant/quant_h263.c \
./src/quant/quant_matrix.c \
./src/quant/quant_mpeg.c \
./src/utils/emms.c \
./src/utils/mbtransquant.c \
./src/utils/mem_align.c \
./src/utils/mem_transfer.c \
./src/utils/timer.c

include $(BUILD_STATIC_LIBRARY)