Changing the mouse pointer globally - C / C++ / MFC Discussion Boards

Nikesh Jagtap15-Sep-10 21:47

15-Sep-10 21:47

I have wrote one program which deletes the elements from first vector 'v1' which are not in another vector 'v3'. At the deleting time i also want to delete that same index element from vector v2.
Eg. The 3 value of 'v3' is not present in 'v1', so i want to delete value 3 from 'v1' and value 7 of index 2 (if we consider 0 based index) from 'v2'.
But it goes crash at some point.
When you see program you get clear with this thing.
I am using Microsoft Visual Studio 6.0 editor. The code snippet is as

#include "stdafx.h"
#include <vector>
#include <algorithm>

#include <iostream>

int main( )
{
using namespace std;
vector <int> v1,v2,v3;
vector <int>::iterator result;

v1.push_back( 1 );
v1.push_back( 2 );
v1.push_back( 3 );
v1.push_back( 4 );

v2.push_back( 7 );
v2.push_back( 7 );
v2.push_back( 7 );
v2.push_back( 7 );

v3.push_back( 1 );
v3.push_back( 2 );

vector <int>::iterator V1Startitr = v1.begin();
vector <int>::iterator V1Enditr = v1.end();

vector <int>::iterator V2Startitr = v2.begin();
vector <int>::iterator V2Enditr = v2.end();

for(V1Startitr,
V2Startitr;
V1Startitr != V1Enditr;
V1Startitr++,V2Startitr++)
{
result = find(v3.begin(),v3.end(),*V1Startitr);

if(result == v3.end())
{
cout<

Re: Vector Error

Cedric Moonen15-Sep-10 22:04

Cedric Moonen

15-Sep-10 22:04

You can't erase an element from a vector by using an iterator that you will reuse later (in the for loop). What you have to do, is use the iterator returned by erase instead (but you shouldn't increment it, since it is already pointing to the next element).

Here is some pseudo-code:

while(iter!=v1.end())
{
   ....
   if(remove)
   {
      iter = v1.erase(iter);
   }
   else
   {
      iter++;
   }
}

PS: please use the pre tags to format your code properly when posting snippets of code.

Cédric Moonen
Software developer

Charting control [v3.0]
OpenGL game tutorial in C++

Error during compilation

arupsarkar15-Sep-10 16:48

arupsarkar

15-Sep-10 16:48

Hi:

I am using Visual Studio 2010, I am getting an error while compiling the following header file.

[pre]
bool normalize_exponent(limeq_price* set, size_t nmemb, int8_t* min_exponent);
[/pre]

[pre]
bool decode_siac_sales_conditions(uint8_t siac_sales_conditions, uint8_t additionalProperties, char sales_conditions[SIAC_SALES_CONDITIONS_LEN]);
[/pre]

I am getting the following error during compilation.

<br />
common_util.h(198): error C2061: syntax error : identifier 'normalize_exponent'<br />
common_util.h(198): error C2059: syntax error : ';'<br />
common_util.h(198): error C2059: syntax error : 'type'<br />
common_util.h(206): error C2061: syntax error : identifier 'decode_siac_sales_conditions'<br />
common_util.h(206): error C2059: syntax error : ';'<br />
common_util.h(206): error C2059: syntax error : 'type'<br />

I would really appreciate if someone can help me.

Regards
Arup

Re: Error during compilation

Luc Pattyn15-Sep-10 17:16

Luc Pattyn

15-Sep-10 17:16

it would be wise to specify the language you are using.

Assuming it is C (not C++), keyword bool does not exist and gets interpreted as a function name, which results in an unexpected identifier (normalize_exponent), from then on the compiler is unable to understand you.

to convince yourself, replace bool by int, and see how it compiles.
to solve, probably also replace bool by int; or add a typedef to that effect.

Smile | :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use <PRE> tags for code snippets, they preserve indentation, and improve readability.

Re: Error during compilation

arupsarkar15-Sep-10 18:30

arupsarkar

15-Sep-10 18:30

Hi Luc,

Next time I will surely put the code in pre tag. I have pasted the header file and c file. I have to integrate this in my c++ project. It is a vendor code.

Regards
Arup

common_util.h

/*
* bitop.h
*
*  Created on: May 3, 2010
*      Author: val
*/

#ifndef BITOP_H_
#define BITOP_H_
#include "limetypes.hh"
#include <stdlib.h>

#ifdef __cplusplus
extern "C" {
	namespace LimeBrokerage {
#endif /* __cplusplus */


#ifndef MIN
#define MIN(X, Y)  ((X) < (Y) ? (X) : (Y))
#endif

#ifndef MAX
#define MAX(X, Y)  ((X) > (Y) ? (X) : (Y))
#endif

		enum BIT_FIELD_SIGN { BIT_FIELD_POSITIVE_SIGN, BIT_FIELD_NEGATIVE_SIGN };

		// Used to validate sizeof() structures,
		// e.g. COMPILE_TIME_ASSERT(sizeof(book_item)==2*DCACHE_LINE_SIZE)
#define CONCAT(x,y) x##y
#define _CT_ASSERT(expr,unique) char CONCAT(constraint,unique)[(expr)?1:-1]
#define COMPILE_TIME_ASSERT(expr) _CT_ASSERT(expr,__LINE__)

		/*
		* This portion defines set of macros that allow bit manipulation.
		* It allow packing and unpacking set of fields into one set of
		* contiguous bits.
		*/

		//Decode function list of parameters declaration
#define DECODE_DECLARATION_BODY(type, name, value) \
	, type* name##_val

		//Decode function declaration
#define DECODE_DECLARATION(name, list) \
	int name##_decode(name##_t* __result \
	list(DECODE_DECLARATION_BODY) \
	)

#define DECODE_DEBUG_DECLARATION(name, list) \
	int name##_decode_debug(name##_t* __result \
	list(DECODE_DECLARATION_BODY) \
	)

		//Individual value decoding
#define DECODE_DEFINITION_BODY(type, name, value) \
	__shift_bits -= name; \
	__tmp = *__result >> __shift_bits; \
	__tmp &= (__one << name) - 1; \
	*name##_val = __tmp; \
	__tmp = 0;

#define DECODE_BODY(name, list) \
		{ \
		name##_t __tmp = 0;\
		name##_t __one = 1;\
		int __shift_bits = sizeof(name##_t) * 8; \
		list(DECODE_DEFINITION_BODY) \

		//Decode function definition
#define DECODE_DEFINITION(name, list) \
	DECODE_DECLARATION(name, list) \
	DECODE_BODY(name, list) \
	return 0; \
		} \

#define POPULATE_RES_STRING(type, name, value) \
	__pos += sprintf(&__output_str[__pos], "%d, ", (int) (* name##_val));

#define PRINT_RESULTS(function, name, list) \
	int __pos = 0; \
	char __output_str[1024*10]; \
	list(POPULATE_RES_STRING) \
	printf("%s: %lld = %s\n", #function, (long long int)(*__result), __output_str); \
	return 0; \

#define DECODE_DEBUG_DEFINITION(name, list) \
	DECODE_DEBUG_DECLARATION(name, list)\
	DECODE_BODY(name, list) \
	PRINT_RESULTS(decode, name, list) \
	} \

		//Encode function list of parameters declaration
#define ENCODE_DECLARATION_BODY(type, name, value) \
	, type* name##_val

		//Encode function declaration
#define ENCODE_DECLARATION(name, list) \
	int name##_encode(name##_t* __result \
	list(ENCODE_DECLARATION_BODY) \
	)

#define ENCODE_DEBUG_DECLARATION(name, list) \
	int name##_encode_debug(name##_t* __result \
	list(ENCODE_DECLARATION_BODY) \
	)
		//Individual value encoding
#define ENCODE_DEFINITION_BODY(type, name, value) \
	__shift_bits -= name; \
	__tmp = *name##_val; \
	__tmp = __tmp << __shift_bits; \
	*__result |= __tmp;

#define ENCODE_BODY(name, list) \
		{ \
		name##_t __tmp = 0; \
		name##_t __one = 1; \
		int __shift_bits = sizeof(name##_t) * 8; \
		list(ENCODE_DEFINITION_BODY) \


		//Encode function definition
#define ENCODE_DEFINITION(name, list) \
	ENCODE_DECLARATION(name, list) \
	ENCODE_BODY(name, list) \
	return 0; \
		}

#define ENCODE_DEBUG_DEFINITION(name, list) \
	ENCODE_DEBUG_DECLARATION(name, list) \
	ENCODE_BODY(name, list) \
	PRINT_RESULTS(encode, name, list) \
	return 0; \
}

		//Allow to sum value of all the bitfields
#define BITFIELD_SUM(type, name, value) \
	+ name

		//Define individual bit value pairs for enum declaration
#define BITOP_DEFINITION_BODY(type, name, value) \
	name = value,


		/*
		* This macro defines set of fields that can be packed into
		* data structure identified by 'name'. It declare enum of bit fields passed as a list.
		* It checks that sum of the
		* bits can fit into the data structure and identifies functions to
		* encode/decode fields.
		* It defines 2 functions:
		* int 'name'_decode(name* _output, type1* var1, type2* var2);
		* int 'name'_encode(name* _output, type1* var1, type2* var2);
		* Total number of parameters in each function depends on total number of elements
		* in definition list *
		* (see spread_manager.c|h for usage example)
		*/
#define BITOP_DEFINITION(name, list) \
	enum name##_bits { \
	list(BITOP_DEFINITION_BODY) \
		}; \
		typedef enum name##_bits name##_bits_t; \
		ENCODE_DECLARATION(name, list); \
		DECODE_DECLARATION(name, list);

#define BITOP_COMPILE_TIME_ASSERT(name, list) \
	COMPILE_TIME_ASSERT((sizeof(name##_t) * 8) == \
	0 \
	list(BITFIELD_SUM) \
	);

		typedef struct limeq_price {
			int32_t mantissa;
			int8_t exponent;
		} limeq_price;

		/*
		* This function finds greater common divider accross array of 1 byte integers
		* set -  is array of elements element_size each that contains uint8_t number to calculate greater_common_divider for
		* element_size - is size of the each element in the set
		* element_offset - position of required uint8_t field in the element
		* nmemb - number of elements in the set
		*/
		uint8_t greater_common_divider(void* set, size_t element_size, size_t element_offset, size_t nmemb);

		/*
		* Normalize mantissa of the price
		* Divide all the mantissas by max power of 10 possible
		* Calculate minimum exponent while doing it
		*/
		void normalize_mantissa(limeq_price* price, int8_t* min_exponent);

		/*
		* Recalculate set of prices based on minimum exponent
		*/
		bool normalize_exponent(limeq_price* set, size_t nmemb, int8_t* min_exponent);

		/**
		* Siac specific function shared by API and QS
		*/

#define SIAC_SALES_CONDITIONS_LEN 4
#define SIAC_LONG_MSG_SALE_CONDITIONS 1
		bool decode_siac_sales_conditions(uint8_t siac_sales_conditions, uint8_t additionalProperties, char sales_conditions[SIAC_SALES_CONDITIONS_LEN]);
		void encode_siac_sales_conditions(uint8_t *reserved, uint8_t *additional_prop, char sales_conditions[SIAC_SALES_CONDITIONS_LEN]);

		/**
		* 64 bit hton and ntoh
		*/
		uint64_t lime_ntohll(uint64_t);
		uint64_t lime_htonll(uint64_t);

#ifdef __cplusplus
} //extern "C"
} // namespace LimeBrokerage
#endif /* __cplusplus */
#endif /* BITOP_H_ */

common_util.c

/*
 * common_util.c
 *
 *  Created on: May 28, 2010
 *      Author: val
 */

#include <stdio.h>
#include "common_util.h"
#include "limeq_def.h"
#ifdef __linux__
#include "byteswap.h"
#endif
#ifdef WIN32
#include <winsock2.h>
#include <Windows.h>
#endif

#ifdef __cplusplus
extern "C" {
namespace LimeBrokerage {
#endif /* __cplusplus */


const int power10[] = {
        1,
        10,
        100,
        1000,
        10000,
        100000,
        1000000,
        10000000,
        100000000,
        1000000000
};
const int power10_size = sizeof(power10)/sizeof(power10[0]);

static const uint8_t _prime_numbers[] = {
	2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
	53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107,
	109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167,
	173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233,
	239, 241, 251
};
static const uint8_t _prime_numbers_size = sizeof(_prime_numbers)/sizeof(_prime_numbers[0]);

/*
 * Extract specific element from array of alements size sturct_size
 */
uint8_t* _get_element(void* array, int array_pos, size_t struct_size, size_t field_offset)
{
	return (uint8_t*)((uint8_t*)array+(array_pos * struct_size) + field_offset);
}
#define MAX_ELEMENTS 1024
static uint8_t divided_set[MAX_ELEMENTS];
/*
 * Calculate greatest common divider
 */
uint8_t greater_common_divider(void* set, size_t element_size, size_t element_offset, size_t nmemb)
{
	uint8_t res = 1;
	size_t es = element_size;
	size_t eo = element_offset;
	void* current_set = set;
	if (nmemb > MAX_ELEMENTS) return 1;

	for (int i = 0; i < _prime_numbers_size; i++) {
		bool all_divided = true;

		for (int j = 0; j < nmemb; j++) {

			uint8_t* element = _get_element(current_set, j, es, eo);
			if (_prime_numbers[i] > *element) {
				return res;
			}
			if (((*element) % _prime_numbers[i])  == 0) {
				divided_set[j] = (*element) / _prime_numbers[i];
			}
			else {
				all_divided = false;
			}
		}
		if (all_divided) {
			res *= _prime_numbers[i];
			current_set = divided_set;
			es = 1;
			eo = 0;
		}
	}
	return res;
}
/*
 * Normalize mantissa of the price point
 */
void normalize_mantissa(limeq_price* price, int8_t* min_exponent)
{
	//Normalize mantissa by removing trailing zeroes
	int zeroes = 0;
	for (int i = 1; i < power10_size; i++) {
		if ((price->mantissa % power10[i]) == 0) {
			zeroes = i;
		}
		else {
			break;
		}
	}
	price->mantissa /= power10[zeroes];
	price->exponent += zeroes;
	if (abs(price->exponent) > power10_size) {
		//Exponent can't be bigger than that
		int diff = price->exponent - power10_size;
		price->mantissa *= power10[diff];
		price->exponent += diff;
	}
	*min_exponent = MIN(*min_exponent, price->exponent);
}
/*
 * Normalize pricess to minimum exponent
 */
bool normalize_exponent(limeq_price* set, size_t nmemb, int8_t* min_exponent)
{
	for (int i = 0; i < nmemb; i++) {
		int8_t exp = set[i].exponent - *min_exponent;
		if (abs(exp) > power10_size) {
			printf("Exponent is too big %d\n", exp);
			return false;
		}
		if (exp < 0) {
			set[i].mantissa /= power10[exp * -1];
		}
		else {
			set[i].mantissa *= power10[exp];
		}
		set[i].exponent = *min_exponent;
	}
	return true;
}

void encode_siac_sales_conditions(uint8_t *reserved, uint8_t *additional_prop,
		char sales_conditions[SIAC_SALES_CONDITIONS_LEN]) {
	*reserved = 0;
	*additional_prop = 0;

	//Setting 0 byte of siac sale conditions
	switch (sales_conditions[0]) { //Enconding bit 0-3
	case '@':
		*reserved |= 15 << 0;
		break;
	case ' ':
		*reserved |= 14 << 0;
		break;
	case 'C':
		*reserved |= 13 << 0;
		break;
	case 'N':
		*reserved |= 12 << 0;
		break;
	case 'R':
		*reserved |= 11 << 0;
		break;
	default:
		*reserved |= 0 << 0;
		break;
	}
	//Setting 1st byte of siac sale conditions
	//This field occupy last 4 bits of reserve byte
	switch (sales_conditions[1]) {
	case ' ':
		*reserved |= 15 << 4;
		break;
	case 'F':
		*reserved |= 14 << 4;
		break;
	case 'O':
		*reserved |= 13 << 4;
		break;
	case '4':
		*reserved |= 12 << 4;
		break;
	case '5':
		*reserved |= 11 << 4;
		break;
	case '6':
		*reserved |= 10 << 4;
		break;
	case '7':
		*reserved |= 9 << 4;
		break;
	case '8':
		*reserved |= 8 << 4;
		break;
	case '9':
		*reserved |= 7 << 4;
		break;
	default:
		*reserved |= 0 << 4;
		break;

	}
	//3rd byte of siac sale conditions
	//This byte occupy 1st 4 bits of additional_prop byte
	switch (sales_conditions[2]) {
	case ' ':
		*additional_prop |= 15 << 0;
		break;
	case 'L':
		*additional_prop |= 14 << 0;
		break;
	case 'T':
		*additional_prop |= 13 << 0;
		break;
	case 'U':
		*additional_prop |= 12 << 0;
		break;
	case 'Z':
		*additional_prop |= 11 << 0;
		break;
	default:
		*additional_prop |= 0 << 0;
		break;

	}
	//4th byte of siac sale conditions
	//This byte occupy 2nd 4 bits of additional_prop byte
	switch (sales_conditions[3]) {
	case ' ':
		*additional_prop |= 15 << 4;
		break;
	case 'B':
		*additional_prop |= 14 << 4;
		break;
	case 'E':
		*additional_prop |= 13 << 4;
		break;
	case 'G':
		*additional_prop |= 12 << 4;
		break;
	case 'H':
		*additional_prop |= 11 << 4;
		break;
	case 'I':
		*additional_prop |= 10 << 4;
		break;
	case 'K':
		*additional_prop |= 9 << 4;
		break;
	case 'P':
		*additional_prop |= 8 << 4;
		break;
	case 'Q':
		*additional_prop |= 7 << 4;
		break;
	case 'X':
		*additional_prop |= 6 << 4;
		break;
	default:
		*additional_prop |= 0 << 4;
		break;

	}
}

bool decode_siac_sales_conditions(uint8_t siac_sales_conditions,
		uint8_t additionalProperties,
		char sales_conditions[SIAC_SALES_CONDITIONS_LEN]) {
	//Siac trade properties
	uint8_t byte_0 = siac_sales_conditions & 0xF;
	uint8_t byte_1 = ((siac_sales_conditions & 0xF0) >> 4);
	uint8_t byte_2 = (additionalProperties & 0xF);
	uint8_t byte_3 = ((additionalProperties & 0xF0) >> 4);
	bool res = true;
	switch (byte_0) {
	case 15:
		sales_conditions[0] = '@';
		break;
	case 14:
		sales_conditions[0] = ' ';
		break;
	case 13:
		sales_conditions[0] = 'C';
		break;
	case 12:
		sales_conditions[0] = 'N';
		break;
	case 11:
		sales_conditions[0] = 'R';
		break;
	default:
		//      printf("Unknown byte 0 of trade conditions: %d = %c", byte_0, byte_0);
		sales_conditions[0] = 13;
		res = false;
		break;
	}

	switch (byte_1) {
	case 15:
		sales_conditions[1] = ' ';
		break;
	case 14:
		sales_conditions[1] = 'F';
		break;
	case 13:
		sales_conditions[1] = 'O';
		break;
	case 12:
		sales_conditions[1] = '4';
		break;
	case 11:
		sales_conditions[1] = '5';
		break;
	case 10:
		sales_conditions[1] = '6';
		break;
	case 9:
		sales_conditions[1] = '7';
		break;
	case 8:
		sales_conditions[1] = '8';
		break;
	case 7:
		sales_conditions[1] = '9';
		break;
	default:
		//      printf("Unknown byte 1 of trade conditions: %d = %c", byte_1, byte_1);
		sales_conditions[1] = 13;
		res = false;
		break;
	}

	switch (byte_2) {
	case 15:
		sales_conditions[2] = ' ';
		break;
	case 14:
		sales_conditions[2] = 'L';
		break;
	case 13:
		sales_conditions[2] = 'T';
		break;
	case 12:
		sales_conditions[2] = 'U';
		break;
	case 11:
		sales_conditions[2] = 'Z';
		break;
	default:
		//      printf("Unknown byte 0 of trade conditions: %d = %c", byte_1, byte_1);
		sales_conditions[2] = 13;
		res = false;
		break;
	}

	switch (byte_3) {
	case 15:
		sales_conditions[3] = ' ';
		break;
	case 14:
		sales_conditions[3] = 'B';
		break;
	case 13:
		sales_conditions[3] = 'E';
		break;
	case 12:
		sales_conditions[3] = 'G';
		break;
	case 11:
		sales_conditions[3] = 'H';
		break;
	case 10:
		sales_conditions[3] = 'I';
		break;
	case 9:
		sales_conditions[3] = 'K';
		break;
	case 8:
		sales_conditions[3] = 'P';
		break;
	case 7:
		sales_conditions[3] = 'Q';
		break;
	case 6:
		sales_conditions[3] = 'X';
		break;
	default:
		//      printf("Unknown byte 0 of trade conditions: %d = %c", byte_1, byte_1);
		sales_conditions[3] = 13;
		res = false;
		break;
	}
	return res;
}

ENCODE_DEFINITION(leg_def_data, LEG_INFO_REQUEST_BITS_LIST);
DECODE_DEFINITION(leg_def_data, LEG_INFO_REQUEST_BITS_LIST);


ENCODE_DEFINITION(spread_data, SPREAD_DATA_BITS_LIST);
DECODE_DEFINITION(spread_data, SPREAD_DATA_BITS_LIST);


#ifndef __bswap_64
#define __bswap_64(x) (((_int64)(ntohl((int)((x << 32) >> 32))) << 32) | (unsigned int)ntohl(((int)(x >> 32))))
#endif //__linux__

# if BYTE_ORDER == LITTLE_ENDIAN

#  define htobe64(x) __bswap_64 (x)
#  define htole64(x) (x)
#  define be64toh(x) __bswap_64 (x)
#  define le64toh(x) (x)
# else

#  define htobe64(x) (x)
#  define htole64(x) __bswap_64 (x)
#  define be64toh(x) (x)
#  define le64toh(x) __bswap_64 (x)
# endif


uint64_t lime_ntohll(uint64_t val) {
	return be64toh(val);
}
uint64_t lime_htonll(uint64_t val) {
	return htobe64(val);
}


#ifdef __cplusplus
} //extern C
} //namespace LimeBrokerage
#endif

Re: Error during compilation

Luc Pattyn16-Sep-10 0:55

Luc Pattyn

16-Sep-10 0:55

Hi,

1.
I see no question here. I see a lot of code and I'm not impressed by it.

2.
One does not need prime numbers to determine the greatest common divisor of some numbers.

3.
AFAICT the answer was already given here[^]

4.
The PRE suggestion is part of my sig. You're doing fine on that issue.

Hmmm | :|

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use <PRE> tags for code snippets, they preserve indentation, and improve readability.

Re: Error during compilation

David Crow16-Sep-10 2:55

David Crow

16-Sep-10 2:55

Please narrow this down to only that which is relevant. Everything else is just undue noise.

"One man's wage rise is another man's price increase." - Harold Wilson

"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons

"Man who follows car will be exhausted." - Confucius

Changing the mouse pointer globally

pjdriverdude15-Sep-10 9:56

pjdriverdude

15-Sep-10 9:56

I am trying to load a cursor globally using cursors made in VC++ 6.0. However, the loadcursor function is either returning a HCURSOR of zero, or it is returning something completely different from what is in the visual studios resources.

I'm really trying to load a blank cursor (I have a touch screen monitor that has a program that I have no control over loading on it, in which I would still like to hide the mouse pointer). Here's the code below.

Returns a handle of 0:

HCURSOR blankCursor = LoadCursor(NULL, MAKEINTRESOURCE(IDC_CURSOR1)) ; //blank cursor
HCURSOR theCursor = CopyCursor(blankCursor) ;
SetSystemCursor(theCursor, OCR_NORMAL) ;

Loads a random cursor:

HCURSOR blankCursor = LoadCursor(NULL, MAKEINTRESOURCE(IDC_POINTER_COPY)) ; //pointer copy being template in the resource editor
HCURSOR theCursor = CopyCursor(blankCursor) ;
SetSystemCursor(theCursor, OCR_NORMAL) ;

Not sure if it's just some setting I'm missing or what. The two cursors don't have any special settings in their properties, why would one return nothing and the other return something random? Loading the default windows pointers works fine.

Re: Changing the mouse pointer globally

David Crow15-Sep-10 10:00

David Crow

15-Sep-10 10:00

pjdriverdude wrote:
However, the loadcursor function is either returning a HCURSOR of zero...

Which means you should be calling GetLastError() to find out why.

Re: Changing the mouse pointer globally

pjdriverdude15-Sep-10 10:40

pjdriverdude

15-Sep-10 10:40

Hmm interesting:

ERROR_RESOURCE_TYPE_NOT_FOUND - The specified resource type cannot be found in the image file.

Re: Changing the mouse pointer globally

pjdriverdude16-Sep-10 5:08

pjdriverdude

16-Sep-10 5:08

Well it turns out that there's a blank.cur file in the windows\cursor folder. I just used the following and it loaded up just fine.

HCURSOR blankCursor = LoadCursorFromFile("C:\\WINDOWS\\Cursors\\blank.cur") ;
::SetSystemCursor(blankCursor, OCR_NORMAL) ;

fatal error c1020: unexpected #endif [modified]

AmbiguousName15-Sep-10 6:52

AmbiguousName

15-Sep-10 6:52

hello guys...i am writing small program for TAPI app. When I try to compile this I get this error in tapi.h header file

fatal error c1020: unexpected #endif

I looked like my code has nothing to do with it so im gonna paste the very last portion in tapi.h and there, very last line #endif is my problem.

#define TAPIERROR_FORMATMESSAGE(__ErrCode__)                                                   \
                                                                                               \
                    ( ( (__ErrCode__) > 0xFFFF0000 ) ?                                         \
                                                                                               \
                            ( (__ErrCode__) & 0x0000FFFF ) :                                   \
                                                                                               \
                            ( ( (__ErrCode__) & 0x10000000 ) ?                                 \
                                                                                               \
                              ( (__ErrCode__) - 0x90000000 + 0xF000 ) :                        \
                                                                                               \
                              ( (__ErrCode__) - 0x80000000 + 0xE000 ) ) )



#ifdef __cplusplus
}                       /* End of extern "C" { */
#endif  /* __cplusplus */


#pragma pack()

#endif // TAPI_H

modified on Thursday, September 16, 2010 1:14 AM

Re: fatal error c1020: unexpected #endif

David Crow15-Sep-10 7:11

David Crow

15-Sep-10 7:11

Have you see this? What is contained in the stdafx.h file (that is perpetuating all the way into tapi.h)? The rest of the code you've shown really has nothing to do with the error.

Re: fatal error c1020: unexpected #endif

Luc Pattyn15-Sep-10 7:18

Luc Pattyn

15-Sep-10 7:18

your #if and #endif preprocessor statements are unbalanced, in particular there seems to be an #endif without a matching #if. Although the balance needs to be maintained only at the top level, it is good practice to also keep things balanced in each and every file.

If your compiler complains about tapi.h then that is where you must check your #if and #endifs.

Smile | :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use <PRE> tags for code snippets, they preserve indentation, and improve readability.

Re: fatal error c1020: unexpected #endif

AmbiguousName15-Sep-10 19:13

AmbiguousName

15-Sep-10 19:13

It is complaining about tapi.h, how would I know that which #if is missing in tapi.h heafer file??

Re: fatal error c1020: unexpected #endif

Luc Pattyn16-Sep-10 0:57

Luc Pattyn

16-Sep-10 0:57

overloaded Name wrote:
how would I know that which #if is missing in tapi.h heafer file??

by reading the content of said file, balancing each #if (or #ifdef or #ifndef) with its #endif, until you find an orphaned #endif. (That is also how the compiler does it). Chances are it is near the end of the file, but that is not a given.

Smile | :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use <PRE> tags for code snippets, they preserve indentation, and improve readability.

Re: fatal error c1020: unexpected #endif

David Crow16-Sep-10 2:51

David Crow

16-Sep-10 2:51

There's likely nothing wrong with tapi.h. Check your project's stdafx.h file.

Re: fatal error c1020: unexpected #endif

Richard MacCutchan15-Sep-10 8:37

Richard MacCutchan

15-Sep-10 8:37

Perhaps if you showed the full message including the module name and line number someone could have a guess at what is wrong.

It's time for a new signature.

Re: fatal error c1020: unexpected #endif

AmbiguousName15-Sep-10 19:11

AmbiguousName

15-Sep-10 19:11

File: tapi.h...............
Line: 5281

Re: fatal error c1020: unexpected #endif

Richard MacCutchan15-Sep-10 21:56

Richard MacCutchan

15-Sep-10 21:56

overloaded Name wrote:
File: tapi.h...............
Line: 5281

OK, so now go and look at that file - there should be a #endif statement on that line, so you can scan backwards to find out why it does not have an opening #if. However, as someone else has suggested, it is more likely something external to that header file that is causing the problem. Check your own source files to make sure you have not coded a spurious #if statement somewhere.

It's time for a new signature.

Re: fatal error c1020: unexpected #endif

Emilio Garavaglia15-Sep-10 21:37

Emilio Garavaglia

15-Sep-10 21:37

Unless you mistakenly modified tapi.h that is NOT the problem.

The message means that, while compiling a Cpp file (.h don't exist for the compiler, they are pasted in by the preprocessor in a previous compilation stage) and #endif ending nothing had been found.

Jut check if you didn't place an extra #endif in a file you include before including <tapi.h> in the Cpp file that gives the error.

2 bugs found.
> recompile ...
65534 bugs found.
D'Oh! | :doh:

Re: fatal error c1020: unexpected #endif

AmbiguousName15-Sep-10 23:17

AmbiguousName

15-Sep-10 23:17

Emilio Garavaglia wrote:
Unless you mistakenly modified tapi.h ......

well i dont remember doing so but lets suppose I did that, what is the solution??

Best practice for managing large quantity of hard-coded string in application.

Maximilien15-Sep-10 4:17

Maximilien

15-Sep-10 4:17

We come to a point where we have a lot of hard-coded string in our application (because laziness, design issues, release-scheduling, ...).

Most of our string are in the resources (string tables) and are used in the UI part of the application, but some of them are in the non-UI part (libraries) that does not have a direct access to the resources, and we don't want to have a dependence on the resources.

Is there a best-practice way to deal with large quantity of string ?

Simple header file with <code>const char*</code> ?

const char* myString = "my string";

or with <code>#define</code> ? Easy but not user friendly for potential localization.

#define myString "my string"

or an XML file with something like that (rough idea)?

<string ID="myString">
my string
</string&g

Or stick with the main resource file and string tables ? or one new resource for each libraries and include them in the main application resource ? possible issues with ID conflicts ?

Thanks.

Max.

Watched code never compiles.

Re: Best practice for managing large quantity of hard-coded string in application.

Aescleal15-Sep-10 5:28

Aescleal

15-Sep-10 5:28

Have a look at gettext. I've used it in a couple of projects and it's worked okay. It doesn't require loads of changes to the source and it's not too bad for localisation. It also handles strings from libraries fairly well.

One big bugger is that it's a bit arcane to support unicode, but you can get over that with a bit of reading.

Cheers,

Ash

Re: Best practice for managing large quantity of hard-coded string in application.

Maximilien15-Sep-10 8:19

Maximilien

15-Sep-10 8:19

Aescleal wrote:
Have a look at gettext.

gettext what ?

I've googled a bit on MSDN and could not find a reference, are you talking about the gnu/linux/whateverux gettext ?

Watched code never compiles.

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.