Search Results

Search found 9889 results on 396 pages for 'pointer speed'.

Page 191/396 | < Previous Page | 187 188 189 190 191 192 193 194 195 196 197 198  | Next Page >

  • How to read some bytes from BYTE*

    - by chekalin-v
    I have BYTE pointer. For example the length of this BYTE array is 10. How can I read 4 bytes from 3 position BYTE array? Now I doing it so BYTE *source = "1234567890\0"; BYTE* tmp = new BYTE[4+1](); for(int i=0; i<4; i++) { tmp[i] = source[i+3]; }

    Read the article

  • .net directoryService returns less result as compared to the CSVDE

    - by kapilg
    I am using .net directoryService to execute an LDAP query and retrieve the users from AD. but when I run the same query using CSVDE tool , i get more no of result as compared to the directorySerrvice. in both the case, i'm using thesame credential to run the application and CSVDE. does any one have any idea if I need to set some flag or any thing while using directoryservice. any pointer will be helpful.

    Read the article

  • xDebug : Output traces in php script?

    - by Industrial
    Hi! I have tried to use xDebug on my local Ubuntu environment to speed up development and it's a great asset. However, I would like to see the output of the Trace function directly in the browser, at the end of the script. How can this be done?

    Read the article

  • How to set StartingSlide without using pager cycle plugin

    - by Geetha
    Hi All, I want to set the starting slide manually for the cycle plugin without using pager. It is not working for me. Code: $('#divTrac').cycle({ fx: 'scrollHorz', speed: 1500, next: '#leftt', prev: '#rightt', startingSlide: 2, timeout: 0, continuous: false, pause: 1, sync: 1, nowrap: 1, slideExpr: '#myTrack' });

    Read the article

  • Getting following warning while compiling

    - by thetna
    warning: passing argument 1 of 'bsearch' makes pointer from integer without a cast and the corresponding code is Parent =bsearch((const size_t)ParentNum, ClauseVector, Size, sizeof(CLAUSE),pcheck_CompareNumberAndClause); the compilar is gcc. here CLAUSE is defined as *CLAUSE.

    Read the article

  • Unable to free const pointers in C

    - by lego69
    How can I free a const char*? I allocated new memory using malloc, and when I'm trying to free it I always receive the error "incompatible pointer type" The code that causes this is something like: char* name="Arnold"; const char* str=(const char*)malloc(strlen(name)+1); free(str); // error here

    Read the article

  • Good JavaScript engine for animating via Sprite Sheets (not in canvas)

    - by N. Taylor Mullen
    I've looked around a bit for a great JavaScript Sprite Sheet animator lib/engine but couldn't find any good ones so I thought I'd ask around =). What I'm looking for in the engine is: Animate an image in a non-canvas setting (ex: div via css or img tags) Control frame rate/animation speed Flags to loop or to animate once etc. Are there any engines like this out there? If not I can always make my own but then again, I don't want to re-invent the wheel =].

    Read the article

  • Finding contained bordered regions from Excel imports.

    - by dmaruca
    I am importing massive amounts of data from Excel that have various table layouts. I have good enough table detection routines and merge cell handling, but I am running into a problem when it comes to dealing with borders. Namely performance. The bordered regions in some of these files have meaning. Data Setup: I am importing directly from Office Open XML using VB6 and MSXML. The data is parsed from the XML into a dictionary of cell data. This wonks wonderfully and is just as fast as using docmd.transferspreadsheet in Access, but returns much better results. Each cell contains a pointer to a style element which contains a pointer to a border element that defines the visibility and weight of each border (this is how the data is structured inside OpenXML, also). Challenge: What I'm trying to do is find every region that is enclosed inside borders, and create a list of cells that are inside that region. What I have done: I initially created a BFS(breadth first search) fill routine to find these areas. This works wonderfully and fast for "normal" sized spreadsheets, but gets way too slow for imports into the thousands of rows. One problem is that a border in Excel could be stored in the cell you are checking or the opposing border in the adjacent cell. That's ok, I can consolidate that data on import to reduce the number of checks needed. One thing I thought about doing is to create a separate graph that outlines the cells using the borders as my edges and using a graph algorithm to find regions that way, but I'm having trouble figuring out how to implement the algorithm. I've used Dijkstra in the past and thought I could do similar with this. So I can span out using no endpoint to search the entire graph, and if I encounter a closed node I know that I just found an enclosed region, but how can I know if the route I've found is the optimal one? I guess I could flag that to run a separate check for the found closed node to the previous node ignoring that one edge. This could work, but wouldn't be much better performance wise on dense graphs. Can anyone else suggest a better method? Thanks for taking the time to read this.

    Read the article

  • How do I declare an array as a constant in Objective-c?

    - by Andrew
    The following code is giving me errors: // constants.h extern NSArray const *testArray; // constants.m NSArray const *testArray = [NSArray arrayWithObjects: @"foo", @"bar"]; The error I get is initializer element is not constant Or if I take away the pointer indicator (*) I get: statically allocated instance of Objective-C class 'NSArray'

    Read the article

  • UIPickerView didSelectRow delay

    - by Rob Bonner
    Hello all, I have a UIPickerView implemented in one of my pages that depends on the didSelectRow delegate method. An odd behavior I have noticed is when the user moves a wheel and leaves it between selections, then the wheel will move very slowly to the closest selection. The didSelectRow event will not fire until this is complete, sometimes 3 seconds later. Is there a way to speed this up, or detect when the wheel is being moved, so I can freeze my interface during this time?

    Read the article

  • How to create factories with attr_accesible?

    - by regedarek
    How to deal with factories and attr_accessible? My example: # model class SomeModel attr_accessible :name, full_name, other_name end #spec require 'spec_helper' describe "test" do it do create(:some_model, name: "test name", user: User.first) #factory end end #error ruby(17122,0x12a055000) malloc: *** error for object 0x8: pointer being freed was not allocated *** set a breakpoint in malloc_error_break to debug I think the error is because user_id is not in attr_accesible atributes

    Read the article

  • What are good or interesting Assembler-like languages, but at a higher level?

    - by CodexArcanum
    I've been looking at L.in.oleum and am intrigued by it's mix of higher-level constructs (loops, dynamic variables) with low-level assembler power (registers). Are there other languages like Lino out there, which blend the speed of assembler with productivity enhancing features? EDIT: I realized this kind of sounds like an ad. I'm genuinely interested in other assembler-like languages, Lino is just the only one I happen to know of.

    Read the article

  • Dynamic memory managment under Linux

    - by petersohn
    I know that under Windows, there are API functions like global_alloc() and such, which allocate memory, and return a handle, then this handle can be locked and a pointer returned, then unlocked again. When unlocked, the system can move this piece of memory around when it runs low on space, optimising memory usage. My question is that is there something similar under Linux, and if not, how does Linux optimize its memory usage?

    Read the article

  • Matrix multiplication in java

    - by Chapax
    Hi, I wanted to do matrix multiplication in Java, and the speed needs to be very good. I was thinking of calling R through java to achieve this. I had a couple of Qs though: Is calling R using Java a good idea? If yes, are there any code samples that can be shared? What are the other ways that can be considered to do matrix multiplication in Java? Many thanks. --Chapax

    Read the article

  • C++ segmentation error when first parameter is null in comparison operator overload

    - by user1774515
    I am writing a class called Word, that handles a c string and overloads the <, , <=, = operators. word.h: friend bool operator<(const Word &a, const Word &b); word.cc: bool operator<(const Word &a, const Word &b) { if(a == NULL && b == NULL) return false; if(a == NULL) return true; if(b == NULL) return false; return a.wd < b.wd; //wd is a valid c string } main: char* temp = NULL; //EDIT: i was mistaken, temp is a char pointer Word a("blah"); //a.wd = [b,l,a,h] cout << (temp<a); i get a segmentation error before the first line of the operator< method after the last line in the main. I can correct the problem by writing cout << (a>temp); where the operator> is similarly defined and i get no errors. but my assignment requires (temp < a) to work so this is where i ask for help. EDIT: i made a mistake the first time and i said temp was of type Word, but it is actually of type char*. so i assume that the compiler converts temp to a Word using one of my constructors. i dont know which one it would use and why this would work since the first parameter is not Word. here is the constructor i think is being used to make the Word using temp: Word::Word(char* c, char* delimeters=NULL) { char *temporary = "\0"; if(c == NULL) c = temporary; check(stoppers!=NULL, "(Word(char*,char*))NULL pointer"); //exits the program if the expression is false if(strlen(c) == 0) size = DEFAULT_SIZE; //10 else size = strlen(c) + 1 + DEFAULT_SIZE; wd = new char[size]; check(wd!=NULL, "Word(char*,char*))heap overflow"); delimiters = new char[strlen(stoppers) + 1]; //EDIT: changed to [] check(delimiters!=NULL,"Word(char*,char*))heap overflow"); strcpy(wd,c); strcpy(delimiters,stoppers); count = strlen(wd); } wd is of type char* thanks for looking at this big question and trying to help. let me know if you need more code to look at

    Read the article

  • MySQL: selecting all but one field?

    - by gsquare567
    instead of SELECT * FROM mytable, i would like to select all fields EXCEPT one (namely, the 'serialized' field, which stores a serialized object). this is because i think that losing that field will speed up my query by a lot. however, i have so many fields and am quite the lazy guy. is there a way to say... `SELECT ALL_ROWS_EXCEPT(serialized) FROM mytable` ? thanks!

    Read the article

  • Disable comments in stdout (DOS)

    - by Shadi
    If I use Dos command "copy" to concatenate two files: copy a1.txt + a2.txt a.txt I will have something like the following in stdout: C:\a1.txt C:\a2.txt 1 file(s) copied. I do not want to have anything written in stdout, I mean, I just want to have 'a.txt' without those 3 lines written in stdout. Is there any way to do so? the reason is, I need speed and I know that any IO takes time. Thanks, Shadi.

    Read the article

  • What are function pointers good for ?

    - by gramm
    Hi, I have trouble seing the utility of the function pointers. I guess it may be useful in some case (it exists, after all), but I can't think of a case where it's better or unavoidable to use a function pointer. Could you give some example of good use of function pointers (in C or C++)? Many thanks :)

    Read the article

  • C vs. C++ for performance in memory allocation

    - by Andrei
    Hi, I am planning to participate in development of a code written in C language for Monte Carlo analysis of complex problems. This codes allocates huge data arrays in memory to speed up its performance, therefore the author of the code has chosen C instead of C++ claiming that one can make faster and more reliable (concerning memory leaks) code with C. Do you agree with that? What would be your choice, if you need to store 4-16 Gb of data arrays in memory during calculation?

    Read the article

  • Cocoa : How do I catch drag operations initiated from an IKBrowserView?

    - by bucketmouse
    So I've got an IKBrowserView all wired up and happily dragging my custom datatype (provided lazily via PasteboardItem) from one window to another, but now I'm interested in detecting when the user drops some data onto the trashcan. Cocoa's documentation says to check the return type of the drag operation itself, but how exactly do I do this with an IKBrowserView? Once I call imageBrowser:writeItemsAtIndexes:toPasteboard: I don't seem to get any notifications other than the request for the pasteboard contents, which doesn't provide a pointer to the drag operation that invoked it.

    Read the article

  • How to access xmlParserCtxt structure from within xmlSAXHandler callbacks?

    - by Lux In Tenebris
    I'm parsing (X)HTML pages content with libxml using the following call: htmlDocPtr doc = htmlSAXParseDoc(content, NULL, &html_handler, NULL); But for debugging purposes I need to analyze some of the current node properties in the start/end element callbacks. I know that the fourth argument of htmlSAXParseDoc can be used to pass any user defined data to the callbacks, but I don't have a pointer to xmlParserCtxt.

    Read the article

< Previous Page | 187 188 189 190 191 192 193 194 195 196 197 198  | Next Page >