Search Results

Search found 23480 results on 940 pages for '32 bit'.

Page 248/940 | < Previous Page | 244 245 246 247 248 249 250 251 252 253 254 255  | Next Page >

• Preon library problem

  - by Kamahire

  I am using preon lib to parse binary data it contain short, int data The structure as follows @BoundNumber(size="32", byteOrder=ByteOrder.BigEndian) public int time;// @BoundString(size="2") public String alphaChar;// 2 byte array @BoundNumber(size="16", byteOrder=ByteOrder.BigEndian) public int code1;//short @BoundNumber(size="16", byteOrder=ByteOrder.BigEndian) public int code2;//short @BoundNumber(size="16", byteOrder=ByteOrder.BigEndian) public int code3;//short @BoundString(size="8") public String firstName;// 8 byte array @BoundString(size="8") public String middleName;// 8 byte array @BoundString(size="8") public String lastName;// 8 byte array @BoundNumber(size="16", byteOrder=ByteOrder.BigEndian) public int code4;//short I am getting correct values for code1, code2, code3 but for code4 it not giving me correct value. It always gives me 0(Zero); When I checked with position of byte array; it shows me correct value. Is there any kind padding require?

  Read the article

• DWORD to bytes using bitwise shift operators

  - by Dave18

  I can't get it to work correctly. #include <windows.h> int main() { DWORD i = 6521; BYTE first = i >> 32; BYTE second = i >> 24; BYTE third = i >> 16; BYTE fourth = i >> 8; i = (((DWORD)fourth) << 24) | (((DWORD)third) << 16) | (((DWORD)second) << 8) | first; }

  Read the article

• MySQL Insert Query Randomly Takes a Long Time

  - by ShimmerTroll

  I am using MySQL to manage session data for my PHP application. When testing the app, it is usually very quick and responsive. However, seemingly randomly the response will stall before finally completing after a few seconds. I have narrowed the problem down to the session write query which looks something like this: INSERT INTO Session VALUES('lvg0p9peb1vd55tue9nvh460a7', '1275704013', '') ON DUPLICATE KEY UPDATE sessAccess='1275704013',sessData=''; The slow query log has this information: Query_time: 0.524446 Lock_time: 0.000046 Rows_sent: 0 Rows_examined: 0 This happens about 1 out of every 10 times. The query usually only takes ~0.0044 sec. The table is InnoDB with about 60 rows. sessId is the primary key with a BTREE index. Since this is accessed on every page view, it is clearly not an acceptable execution time. Why is this happening? Update: Table schema is: sessId:varchar(32), sessAccess:int(10), sessData:text

  Read the article

• Null Pointer Exception with an array of bitsets

  - by p0ny

  could someone explain to me why the following results in a Null pointer Exception? And how to set a value for bitarray[0]? BitSet[] bitarray; bitarray= new BitSet[10]; bitarray[0].set(1); Also, why something like this work and not result in a pointer exception? BitSet[] bitarray = new BitSet[10]; BitSet bits = new BitSet(32); bits.set(1); bitarray[0] = bits; Thanks

  Read the article

• Size of a class with 'this' pointer

  - by psvaibhav

  The size of a class with no data members is returned as 1 byte, even though there is an implicit 'this' pointer declared. Shouldn't the size returned be 4 bytes(on a 32 bit machine)? I came across articles which indicated that 'this' pointer is not counted for calculating the size of the object. But I am unable to understand the reason for this. Also, if any member function is declared virtual, the size of the class is now returned as 4 bytes. This means that the vptr is counted for calculating the size of the object. Why is the vptr considered and 'this' pointer ignored for calculating the size of object?

  Read the article

• Handle CSliderCtl messages placed on a CDialogBar

  - by user173438

  VS2008, 32 Bit Win XP In a class derived from CFrameWnd, I have an object of CDialogBar that needs to have certain controls on it. Among these controls would be 2 sliders, whose event handling is to be done in CFrameWnd derived class. How shall I go about this? class CFrameWndCustom : public CFrameWnd { CDialogBar m_wndDialogBar; // the CDialogBar object. } In CFrameWnd derived class's OnCreateClient, I have created the DialogBar using the above object like: //Create the DialogBar if (!m_wndDialogBar.Create(this, IDD_DIALOGBAR_CONTROL, CBRS_BOTTOM, IDD_DIALOGBAR_CONTROL)) { TRACE("Warning: Couldn't create DialogBar Control!\n"); return FALSE; } Here, IDD_DIALOGBAR_CONTROL is a dialog resource with Style as Child. After this, I drag-dropped a CSliderCtrl on the IDD_DIALOGBAR_CONTROL in Resource View. Now, how/where should I handle the CSliderCtrl's events? There would be 2 such slider controls. I finally need the values of the sliders in CFrameWndCustom class. best regards, Divya

  Read the article

• JBoss 4.0.5 startup takes 15 minutes deploying a single war file

  - by dkblinux98

  This instance of JBoss deploys several war files. The rest of the JBoss startup takes about 5 minutes or less. But when it gets to one particular war file, startup just hangs with no further output to the jboss log. It waits there for about 15 minutes and then suddenly the war starts deploying. The rest of the JBoss startup is then fine. What I want to know is what steps do you recommend I take to diagnose the cause of this condition? It is not possible to upgrade this site to a newer version of JBoss nor java (currently 1.5.0.7). It is running on 32-bit CentOS 5.3 Linux on 3 xen-based virtual servers in a load balanced configuration. The code is common to all three servers via an nfs share. This same issue was seen, however, when the 3 servers were physical and the code was local to each server. The servers are each 2 cpu, 4GB RAM servers.

  Read the article

• Setting an empty default value for a char-column in MySQL?

  - by user281434

  Hi In phpMyAdmin I have a char(32) column that has no default value(ie. Default: None). When I try to insert data through a SQL query, it throws out an error saying that the column "doesn't have a default value". I need it to be empty, so instead I've just set it's default value as "As defined: " and then nothing in the value field. Is this a bad idea? And is it any better than simply throwing in an empty value for the column in the SQL query? Thanks for your time.

  Read the article

• Convert 2 char into 1 int

  - by Leo

  I have 2 chars: HIGH and LOW and I'd like to convert them to an int corresponding to HIGH + the 2 left bits from LOW. I tried somethine like : char *HIGH; char *LOW; HIGH = 152; LOW = 12; int result; result += (LOW + 6); result += (LOW + 7)*2; result += HIGH*4; result += (HIGH + 1)*8; result += (HIGH + 2)*16; result += (HIGH + 3)*32; result += (HIGH + 4)*64; result += (HIGH + 5)*128; result += (HIGH + 6)*256; result += (HIGH + 7)*512; return result; But it doesn't work and I don't understand why.

  Read the article

• TCP Scanner Python MultiThreaded

  - by user1473508

  I'm trying to build a small tcp scanner for a netmask. The code is as follow: import socket,sys,re,struct from socket import * host = sys.argv[1] def RunScanner(host): s = socket(AF_INET, SOCK_STREAM) s.connect((host,80)) s.settimeout(0.1) String = "GET / HTTP/1.0" s.send(String) data = s.recv(1024) if data: print "host: %s have port 80 open"%(host) Slash = re.search("/", str(host)) if Slash : netR,_,Wholemask = host.partition('/') Wholemask = int(Wholemask) netR = struct.unpack("!L",inet_aton(netR))[0] for host in (inet_ntoa(struct.pack("!L", netR+n)) for n in range(0, 1<<32-Wholemask)): try: print "Doing host",host RunScanner(host) except: pass else: RunScanner(host) To launch : python script.py 10.50.23.0/24 The problem I'm having is that even with a ridiculous low settimeout value set, it takes ages to cover the 255 ip addresses since most of them are not assigned to a machine. How can i make a way faster scanner that wont get stuck if the port is close.MultiThreading ? Thanks !

  Read the article

• Find all possible partitions of n elements with k-sized subsets, where two elements share same set o

  - by ypnos

  I have n=32 elements that need to be partitioned into 8 sets, each set has to hold exactly k=4 elements. I need to find all possible partitions with the constraint that each pair of elements only shares the same set once. So if I start with [1 2 3 4] [5 6 7 8] [...], all consecutive partitions cannot hold e.g. [1 2 X X] or [X X 1 3]. sets are unordered. Close to this problem are the stirling numbers of the second kind. However, they only solve the problem for arbitrarily sized sets.

  Read the article

• XAMPP on windows 7 not working properly

  - by 404Error

  Hey there, I just installed XAMPP lite on Windows 7. I have two drives - C: for the OS and regular files, and an external drive E:. I installed XAMPP lite on E: (on the root), and its been giving me problems. Apache works well enough, but MySQL doesn't work. When I go to http://localhost/phpmyadmin/, it gives me the following error: Error MySQL said: #2003 - Can't connect to MySQL server on 'localhost' (10061) Connection for controluser as defined in your configuration failed. Any ideas as to what could be the problem? I used the zip file for XAMPP lite, the 32 bit version. This is on Windows 7 Home premium. Thanks!

  Read the article

• counting characters program in c

  - by mena

  Hello, the output of characters number is the actual no. plus 3 i don't know why? This is the code: void main(void) { int ch,w=0,c=0; do { ch=getche(); ++c; if(ch==32) { ++w; ++c; } }while(ch!=13); printf("\nnum of characters is %d",c); printf("\nnum of words is %d",w); getch(); }

  Read the article

• Why is this js code so slow?

  - by SpiderPig

  This code takes 3 seconds on Chrome and 6s on Firefox. If I write the code in Java and run it under Java 7.0 it takes only 10ms. Chrome's JS engine is usually very fast. Why is it so slow here? btw. this code is just for testing. I know it's not very practical way to write a fibonacci function fib = function(n) { if (n < 2) { return n; } else { return fib(n - 1) + fib(n - 2); } }; console.log(fib(32));

  Read the article

• date comparison inside a list returned

  - by rob

  I have a ArrayList returned from a service which contains date-timestamp as String values (with values: 2010-05-06T23:38:18,2010-05-06T23:32:52,2010-04-28T18:23:06,2010-04-27T20:34:02,2010-04-27T20:37:02) to be more specific, This is part of a parent ArrayList ObjectHistory. This list contains the datestamp and serial number. I need to pick the correct serial number. Objecthistory is the List object and I need to get the latest timestamp within this ObjectHistory. I need to pick the latest timestamp from this Arraylist in Java 6. How should I be doing this? Should I do convert these values into calendar-time? I am in panic mode as this has to be done directly in production.

  Read the article

• Optimal (Time paradigm) solution to check variable within boundary

  - by kumar_m_kiran

  Hi All, Sorry if the question is very naive. I will have to check the below condition in my code 0 < x < y i.e code similar to if(x > 0 && x < y) The basic problem at system level is - currently, for every call (Telecom domain terminology), my existing code is hit (many times). So performance is very very critical, Now, I need to add a check for boundary checking (at many location - but different boundary comparison at each location). At very normal level of coding, the above comparison would look very naive without any issue. However, when added over my statistics module (which is dipped many times), performance will go down. So I would like to know the best possible way to handle the above scenario (kind of optimal way for limits checking technique). Like for example, if bit comparison works better than normal comparison or can both the comparison be evaluation in shorter time span? Other Info x is unsigned integer (which must be checked to be greater than 0 and less than y). y is unsigned integer. y is a non-const and varies for every comparison. Here time is the constraint compared to space. Language - C++. Now, later if I need to change the attribute of y to a float/double, would there be another way to optimize the check (i.e will the suggested optimal technique for integer become non-optimal solution when y is changed to float/double). Thanks in advance for any input. PS : OS used is SUSE 10 64 bit x64_64, AIX 5.3 64 bit, HP UX 11.1 A 64.

  Read the article

• How do I get the IPv4 subnetmask on interface with both v4 and v6 address?

  - by Per Fagrell

  I have an InterfaceAddress that returns an ipv4 address (4 octets). However the network prefix length seems to be for the ipv6 address associated with the interface (it's returning as 128). How do I find the correct network prefix length? Enumeration<NetworkInterface> NetworkInterface.getNetworkInterfaces() for (; interfaces.hasMoreElements();) { final List<InterfaceAddress>interfaceAddresses = interfaces.nextElement().getInterfaceAddresses(); for (final InterfaceAddress address : interfaceAddresses) { assert(address.getAddress().getAddress().length == 4); // [sic] assert(address.getNetworkPrefixLength() < 32); // <- Fails. Actually equals 128 } }

  Read the article

• [VC++ 2010] Stack around the variable 'xyz' was corrupted.

  - by tirolerhut

  hi, I'm trying to get some simple piece of code I found on a website to work in VC++ 2010 on windows vista 64: #include "stdafx.h" #include <windows.h> int _tmain(int argc, _TCHAR* argv[]) { DWORD dResult; BOOL result; char oldWallPaper[MAX_PATH]; result = SystemParametersInfo(SPI_GETDESKWALLPAPER, sizeof(oldWallPaper)-1, oldWallPaper, 0); fprintf(stderr, "Current desktop background is %s\n", oldWallPaper); return 0; } it does compile, but when I run it, I always get this error: Run-Time Check Failure #2 - Stack around the variable 'oldWallPaper' was corrupted. I'm not sure what is going wrong, but I noticed, that the value of oldWallPaper looks something like "C\0\:\0\0U\0s\0e\0r\0s[...]" -- I'm wondering where all the \0s come from. A friend of mine compiled it on windows xp 32 (also VC++ 2010) and is able to run it without problems any clues/hints/opinions? thanks

  Read the article

• discrepancy in google analytics pageview totals when tracking subdomains

  - by frabjousB

  We are using the old urchin.js and are tracking 2 subdomains under the same profile. We have a “track subdomains” advanced filter defined (as per http://www.google.com/support/googleanalytics/bin/answer.py?hl=en&answer=55524) as well as 2 segments for presenting data in the reports: hostname matches exactly subdomain1.domain-name.com and hostname matches exactly subdomain2.domain-name.com When I apply these segments to our Top Content Overview report, the All Visits total for PageViews does not correspond to the # of visits reported for each subdomain. For example: All Visits = 53 subdomain1 = 24 subdomain2 = 32 Is there any reason as to why we would be seeing this discrepancy in numbers?

  Read the article

• I am requesting ideas on manipulating output from an array and parse to something useful

  - by Cyber Demon

  First I am new to PS scripting. Please be gentle. This simple script I have written is ok. $Iplist = Get-Content ips.txt foreach ($ip in $Iplist) { .\psping -h -n 3 -w 0 $ip >> results.csv } Move-Item "C:\ping\results.csv" ("C:\ping\aftermath\{0:yyyyMMddhhmm}.csv" -f (get-date)) The Output is as follows, as an example (I used www.google.com): Pinging 74.125.225.48 with 32 bytes of data: 3 iterations (warmup 0) ping test: Reply from 74.125.225.48: 54.14ms Reply from 74.125.225.48: 54.85ms Reply from 74.125.225.48: 54.48ms Ping statistics for 74.125.225.48: Sent = 3, Received = 3, Lost = 0 (0% loss), Minimum = 54.14ms, Maximum = 54.85ms, Average = 54.49ms Latency Count 54.14 1 54.17 0 54.21 0 54.25 0 54.29 0 54.32 0 54.36 0 54.4 0 54.44 0 54.47 1 54.51 0 54.55 0 54.59 0 54.62 0 54.66 0 54.7 0 54.74 0 54.77 0 54.81 0 54.85 1 What I'm looking for is something to show me the following as an output. ServerIP Name TimeStamp Results AverageResponseTime in milli-seconds www.google.com 2014-08-14T16:09:59 Up 53 Can you guide me?

  Read the article

• Whats the best way to parse a file in Java

  - by chitresh

  Hi All, I have a text file with Tag - Value format data. I want to parse this file to form a Trie. What will be the best approach? Sample of File: (String inside "" is a tag and '#' is used to comment the line.) #Hi, this is a sample file. "abcd" = 12; "abcde" = 16; "http" = 32; "sip" = 21;

  Read the article

• Value [...] not a valid choice, django-updown

  - by tamara

  I am trying to implemet django-updown https://github.com/weluse/django-updown. When I try to add vote trough the admin panel it says Value 1 not a valid choice. This is the models.py from the application: _SCORE_TYPE_CHOICES = ( ('-1', 'DISLIKE'), ('1', 'LIKE'), ) SCORE_TYPES = dict((value, key) for key, value in _SCORE_TYPE_CHOICES) class Vote(models.Model): content_type = models.ForeignKey(ContentType, related_name="updown_votes") object_id = models.PositiveIntegerField() key = models.CharField(max_length=32) score = models.SmallIntegerField(choices=_SCORE_TYPE_CHOICES) user = models.ForeignKey(User, blank=True, null=True, related_name="updown_votes") ip_address = models.IPAddressField() date_added = models.DateTimeField(default=datetime.datetime.now, editable=False) date_changed = models.DateTimeField(default=datetime.datetime.now, editable=False) Do you have an idea what could be wrong?

  Read the article

• How to roeder the rows of one matrix with respect to the other matrix?

  - by user2806363

  I have two big matrices A and B with diffrent dimensions.I want to order the rows of matrix B with respect to rows of the matrix A. and add the rows with values 0 to matrix B, if that row is not exist in B but in A Here is the reproduceable example and expected output: A<-matrix(c(1:40), ncol=8) rownames(A)<-c("B", "A", "C", "D", "E") > A [,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] B 1 6 11 16 21 26 31 36 A 2 7 12 17 22 27 32 37 C 3 8 13 18 23 28 33 38 D 4 9 14 19 24 29 34 39 E 5 10 15 20 25 30 35 40 > B<-matrix(c(100:108),ncol=3) rownames(B)<-c("A", "E", "C") > B [,1] [,2] [,3] A 100 103 106 E 101 104 107 C 102 105 108 Here is the Expected output : >B [,1] [,2] [,3] B 0 0 0 A 100 103 106 C 102 105 108 D 0 0 0 E 101 104 107 > Would someone help me to implement this in R ?

  Read the article

• Sphinx without using an auto_increment id

  - by squeeks

  I am current in planning on creating a big database (2+ million rows) with a variety of data from separate sources. I would like to avoid structuring the database around auto_increment ids to help prevent against sync issues with replication, and also because each item inserted will have a alphanumeric product code that is guaranteed to be unique - it seems to me more sense to use that instead. I am looking at a search engine to index this database with Sphinx looking rather appealing due to its design around indexing relational databases. However, looking at various tutorials and documentation seems to show database designs being dependent on an auto_increment field in one form or another and a rather bold statement in the documentation saying that document ids must be 32/64bit integers only or things break. Is there a way to have a database indexed by Sphinx without auto_increment fields as the id?

  Read the article

• Inconsistent behaviour from SDL_BlitSurface

  - by bardes

  Here is an example code: #include <SDL/SDL.h> #include <SDL/SDL_image.h> #include <stdio.h> int main() { if(SDL_Init(SDL_INIT_EVERYTHING) == -1) { printf("SDL ERROR: %s", SDL_GetError()); return 1; } SDL_Surface *screen; screen = SDL_SetVideoMode(128, 128, 32, SDL_SWSURFACE); SDL_Surface *img; img = IMG_Load("./debug.png"); SDL_BlitSurface(img, NULL, screen, NULL); SDL_Flip(screen); SDL_Delay(1000); SDL_FreeSurface(img); SDL_Quit(); return 0; } It compiles fine, but when I run it sometimes it works and most times only part of the image is displayed. I really can't imagine what's causing that... EDIT: This is the image I'm using to test the program: http://img140.imageshack.us/img140/3858/debugi.png

  Read the article

< Previous Page | 244 245 246 247 248 249 250 251 252 253 254 255  | Next Page >