Search Results

Search found 22986 results on 920 pages for 'allocation unit size'.

Page 388/920 | < Previous Page | 384 385 386 387 388 389 390 391 392 393 394 395 | Next Page >

reading partially from sockets

- by nomad.alien

I'm having a little test program that sends a lot of udp packets between client-server-client (ping/pong test). The packets are fixed size on each run(last run is max allowable size of udp packet) I'm filling the packets with random data except for the beginning of each packet that contains the packet number. So I'm only interested to see if I receive all the packets back at the client. I'm using sendto() and recvfrom() and I only read the sizeof(packet_number) (which in this case is an int). What happens to the rest of the data? Does it end up in fairyland (gets discarded)? or does the new packet that arrives gets appended to this "old" data? (using linux)

Read the article
how to resolve resizing problem in asp web application

- by shmandor

when i am minmize web page the content controls as textboxes and buttons etc take anonthe position and size

Read the article
Image visualization with canvas. How to resize them?

- by Luca Matteis

I'm building a website photo gallery for a friend. Images are loaded as simple DOM image objects (<img src="" />), and the size of these images is based on the browser size. So I resize them with CSS. This isn't an optimal solution since CSS resizing seems to change the quality of the image and pixelate it quite a bit. I was thinking of rendering the image with canvas and then resize it with that so that the quality remains effective, but I can't find any info about this online. Any ideas?

Read the article
Copying 1-D array into 2 -D array

- by Digvijay Yadav

I have one two dimensional array and one single dimensional array. The two dimensional array is of NxM size. And the one dimensional array is of size N x M means it has N X M elements. Now I want to copy all the elements of the one dimensional array into the 2-D array. This is what I tried for(i = 0; i < M; i += 1) { for(j = 0; j < N; j += 1) { arr2d[i][j] = arr2d[(i*j +j)]; } } But not working Any suggestions???

Read the article
Firefox doesn't display text on webpage.

- by Ram

hello, I was successful in displaying text on webpage but in firefox, it does not display the text at all. If i see the page source, it has text in there. but why doesn't it display? In Chrome and IE, it works fine. Edit: When i used firebug, it looks like the content is behind the screen. I just guess. What you experts say on this? <asp:Content ID="Content1" ContentPlaceHolderID="ContentPlaceHolder1" runat="Server"> <div> <table id="Table2" width="150%" border="0" cellspacing="0" cellpadding="0" class="main_content"> <tr valign="top"> <td align="left" style="height: auto"> <br />                                                                <asp:Label ID="lblName" runat="server" Font-Bold="True" Font-Size="10pt" ForeColor="#006699" Font-Names="Verdana"></asp:Label> </td> </tr> <tr style="height:32px"> </tr> <tr valign="top"> <td align="center"> <div class="reusableBlueBox" style="width: 500px;height:auto;"> <div class="reusableBlueTop"> <span> </span> </div> <div class="reusableBlueContent"> <table id="Content" border="0" cellpadding="0" cellspacing="4" class="createAccountTable"> <%-- <tr><td align="left" valign="top"><h2 align="center">WELCOME TO OUR SITE...!</h2></td></tr>--%> <tr id="trwelcome" runat="server"> <td> <div style="text-align: center; margin: 0in 0in 0pt;"> <span style="color: #00669f; font-size:large; font-family:Arial; font-weight:bold" > Welcome</span> <br> <span style="color: #00669f; font-size:small; font-family:Arial" > Please look over this welcome page to familiarize yourself with your account. </span> </div> </td> </tr> <tr id="trhelp" runat="server" visible = "false"> <td> <div style="text-align: center; margin: 0in 0in 0pt;"> <span style="color: #00669f; font-size:large; font-family:Arial; font-weight:bold" > Help</span> <br> </div> </td> </tr> <tr style="height:10px"> <td> </td> </tr> <tr> <td id="tdWelcomeContent" runat="server" valign="top" class="listStyleNone"> </td> </tr> <tr id="trthankyou" runat="server"> <td align="left"> <strong><span style="color: rgb(0,102,153); font-size: medium">Thanks for joining.</span></strong> </td> </tr> </table> <table width="200"> <tr> <td style="width: 109px; height: auto"> </td> <td style="width: 100px; height: auto" align="center"> <asp:ImageButton ID="imgbtnEnterMyAccount" runat="server" ImageUrl="~/images/enter_my_account.gif" OnClick="imgbtnEnterMyAccount_Click" Width="185px" /></td> <td style="width: 100px; height: auto">  </td> </tr> </table> </div> <div class="reusableBlueBottom"> <span> </span> </div> </div> <br /> <%-- <table width="200"> <tr> <td style="width: 109px; height: 37px"> <asp:ImageButton ID="btnhelp" runat="server" ImageUrl="~/images/help2.gif" OnClick="btnhelp_Click" Visible="False" /></td> <td style="width: 100px; height: 37px" align="center">  <asp:ImageButton ID="imgbtnEnterMyAccount" runat="server" ImageUrl="~/images/enter_my_account.gif" OnClick="imgbtnEnterMyAccount_Click" Width="185px" /></td> <td style="width: 100px; height: 37px">  </td> </tr> <tr> <td style="width: 109px; height: 47px"> </td> <td style="width: 100px; height: 47px"> </td> <td style="width: 100px; height: 47px"> </td> </tr> </table>--%> </td> </tr> <tr> <td align="center"> </td> </tr> <tr> <td align="center">  </td> </tr> </table> </div> Thanks in advance!

Read the article
How can I find out how much memory an object of a C++ class consumes?

- by Shadow

Hi, I am developing a Graph-class, based on boost-graph-library. A Graph-object contains a boost-graph, so to say an adjacency_list, and a map. When monitoring the total memory usage of my program, it consumes quite a lot (checked with pmap). Now, I would like to know, how much of the memory is exactly consumed by a filled object of this Graph-class? With filled I mean when the adjacency_list is full of vertices and edges. I found out, that using sizeof() doesn't bring me far. Using valgrind is also not an alternative as there is quite some memory allocation done previously and this makes the usage of valgrind impractical for this purpose. I'm also not interested in what other parts of the program cost in memory, I want to focus on one single object. Thank you.

Read the article
why isn't the input text file being read into the ArrayList<String>, diary?

- by hmg

Here's my code: public void readFile() throws IOException { System.out.println("Input file name: "); Scanner in = new Scanner(System.in); String readName = in.nextLine(); Scanner reader = new Scanner(new File(readName)); System.out.println("Reading file..."); while (reader.hasNextLine()) { System.out.println(reader.nextLine()); } System.out.println("File read."); Scanner inAgain = new Scanner(System.in); System.out.println("Would you like to read this into the current Diary?"); System.out.println("Warning: This will overwrite your current Diary!"); String readFileConfirm = inAgain.nextLine(); ArrayList<String> readData = new ArrayList<String>(); if (readFileConfirm.equalsIgnoreCase("yes")) { for (int i = 0; i < readData.size(); i++) { readData.add(reader.nextLine()); } System.out.println("Data added to extra array..."); System.out.println("Here are the contents."); for (int i = 0; i < readData.size(); i++) { System.out.println(readData.get(i)); } System.out.println("Contents read."); System.out.println("Now overwriting current Diary with read file..."); diary.clear(); for (int i = 0; i < diary.size(); i++) { diary.add(readData.get(i)); } System.out.println("New Diary created!"); System.out.println("Use 'recall' to see your new Diary!"); } else { System.out.println("Very well, returning to first command entry."); } } Thanks in advance! -h

Read the article
2 Minute question - HTML / CSS If div within div expands expand parent div

- by Ozaki

I have a setup lets say like follows: <div id="nav"> <div id="innernav"> //With dynamic content here. </div> </div> I am running a script that sizes #nav to the size of the browser window in height. But sometimes my dynamic content is now getting bigger than the height of the window.. Is there a way I can enforce that when #innernav exceeds #nav that #nav will increase in size?

Read the article
How can I find out how much memory an instance of a C++ class consumes?

- by Shadow

Hi, I am developing a Graph-class, based on boost-graph-library. A Graph-object contains a boost-graph, so to say an adjacency_list, and a map. When monitoring the total memory usage of my program, it consumes quite a lot (checked with pmap). Now, I would like to know, how much of the memory is exactly consumed by a filled object of this Graph-class? With filled I mean when the adjacency_list is full of vertices and edges. I found out, that using sizeof() doesn't bring me far. Using valgrind is also not an alternative as there is quite some memory allocation done previously and this makes the usage of valgrind impractical for this purpose. I'm also not interested in what other parts of the program cost in memory, I want to focus on one single object. Thank you.

Read the article
c struct question

- by lhw

Hi, I'm trying to implement a simple priority queue from array of queues. I'm trying to define a struct queue, and than a struct priority queue that has an array of queues as its member variable. However, when I try to compile the code, I get the following error: pcb.h:30: error: array type has incomplete element type The code is below: typedef struct{ pcb *head; pcb *tail; SINT32 size; } pcb_Q; typedef struct { struct pcb_Q queues[5]; SINT32 size; } pcb_pQ; Could someone give me a hand? Thanks a lot.

Read the article
boost scoped_lock mutex crashes

- by JahSumbar

hello, I have protected a std::queue's access functions, push, pop, size, with boost::mutexes and boost::mutex::scoped_lock in these functions from time to time it crashes in a scoped lock the call stack is this: 0 0x0040f005 boost::detail::win32::interlocked_bit_test_and_set include/boost/thread/win32/thread_primitives.hpp 361 1 0x0040e879 boost::detail::basic_timed_mutex::timed_lock include/boost/thread/win32/basic_timed_mutex.hpp 68 2 0x0040e9d3 boost::detail::basic_timed_mutex::lock include/boost/thread/win32/basic_timed_mutex.hpp 64 3 0x0040b96b boost::unique_lock<boost::mutex>::lock include/boost/thread/locks.hpp 349 4 0x0040b998 unique_lock include/boost/thread/locks.hpp 227 5 0x00403837 MyClass::inboxSize - this is my inboxSize function that uses this code: MyClass::inboxSize () { boost::mutex::scoped_lock scoped_lock(m_inboxMutex); return m_inbox.size(); } and the mutex is declared like this: boost::mutex m_inboxMutex; it crashes at the last pasted line in this function: inline bool interlocked_bit_test_and_set(long* x,long bit) { long const value=1<<bit; long old=*x; and x has this value: 0xababac17 Thanks for the help

Read the article
Show a SplashScreenScene before to GameScene?

- by lisovaccaro

I want to add a splash screen to my game. I created a SplashScene.sks and a SplashScene.swift file. I'm trying to load my SplashScene before GameScene but I cannot manage to do it. How should I do this? This is what I'm trying now: class GameViewController: UIViewController { override func viewDidLoad() { super.viewDidLoad() let skView = self.view as SKView skView.ignoresSiblingOrder = true /* Set the scale mode to scale to fit the window */ var scene = SplashScreenScene() // Present SplashScreenScene first scene.scaleMode = .AspectFill skView.presentScene(scene) } Then on my SplashScreenScene: class SplashScreenScene: SKScene { override func didMoveToView(view: SKView) { self.size = view.bounds.size self.anchorPoint = CGPointMake(0.5, 0.5) var background = SKSpriteNode(imageNamed:"LaunchImage") self.addChild(background) // Start timer to load next scene NSTimer.scheduledTimerWithTimeInterval(1, target: self, selector: Selector("changeScene"), userInfo: nil, repeats: false) } func changeScene() { let scene = GameScene() view.presentScene(scene) } } This is very close to the solution, however for some reason when I do this my game becomes laggy (if I present GameScene directly the game runs fine).

Read the article
new operator overwriting an existing object

- by dvpdiner2

I have a custom FastStack class, implemented as a fixed size array and an index into that array. In my copy constructor, I allocate the array and then assign each object from the copy's array into the new array. There's some refcounting in the objects on the stack, hence assignment is used rather than a simple copy. The problem is that when allocating the array, it sometimes overwrites part of the other stack's array. As can be expected, this leads to eventual segmentation faults when that data is dereferenced. class FastStack { private: int m_size, m_ptr; ObjectRef* m_stack; public: FastStack(int size) : m_size(size), m_ptr(-1) { m_stack = new ObjectRef[m_size]; } FastStack(const FastStack& copy) : m_size(copy.m_size), m_ptr(copy.m_ptr) { long a = (long)copy.m_stack[0]; m_stack = new ObjectRef[m_size]; if ((long)copy.m_stack[0] != a) fprintf(stderr, "\nWe have a serious problem!\n\n"); for (int i = 0; i <= m_ptr; i++) m_stack[i] = copy.m_stack[i]; } ~FastStack() { delete[] m_stack; } }; class ObjectRef { private: DataObj* m_obj; public: ObjectRef() : m_obj(0) { } ObjectRef(DataObj* obj) : m_obj(obj) { if (m_obj) m_obj->addRef(); } ObjectRef(const ObjectRef& obj) : m_obj(obj.m_obj) { if (m_obj) m_obj->addRef(); } ~ObjectRef() { if (m_obj) m_obj->delRef(); } ObjectRef& operator=(DataObj* obj) { if (obj) obj->addRef(); if (m_obj) m_obj->delRef(); m_obj = obj; return *this; } ObjectRef& operator=(const ObjectRef& obj) { if (obj.m_obj) obj.m_obj->addRef(); if (m_obj) m_obj->delRef(); m_obj = obj.m_obj; return *this; } }; I see that "We have a serious problem!" line shortly before a segfault, and stepping through it with gdb I can see that one of the ObjectRefs created by new has the same address as the other stack's array. My first instinct is to say that new should never be allocating memory that is already in use, but that clearly seems to be the case here and I am at a complete loss as to what can be done. Added: At the time that I see this happen, m_size = 2 and m_ptr = 0.

Read the article
Converting a C++ Checksum function to Java

- by user1897599

I'm trying to convert this C++ checksum to Java but for the time being I've failed. What am I doing wrong? What is it supposed to do? It is supposed to return a positive checksum for a buffer in OpenGL Here's the C part. DWORD QuickChecksum(DWORD *data, int size){ if(!data) { return 0x0; } DWORD sum; DWORD tmp; sum = *data; for(int i = 1; i < (size/4); i++) { tmp = data[i]; tmp = (DWORD)(sum >> 29) + tmp; tmp = (DWORD)(sum >> 17) + tmp; sum = (DWORD)(sum << 3) ^ tmp; } return sum; } And here is what I have tried in Java. As far As I know DWORD is 32bit so I use int in a long to get a unsigned int which should be done in java with ? I've been looking at this problem so much now that I've grown blind to it. public static long getChecksum(byte[] data, int size) { long sum, tmp; sum = getInt(new byte[]{data[0], data[1], data[2], data[3]},true) & 0xFF; for(int I = 4; I < data.length; I += 4) { tmp = getInt(new byte[]{data[I],data[I+1],data[I+2],data[I+3]},true) & 0xFF; tmp = (sum >>> 29) + tmp; tmp = (sum >>> 17) + tmp; sum = (sum << 3) ^ tmp; } return sum & 0xFF; } private static int getInt(byte[] bytes, boolean big) { ByteBuffer bb = ByteBuffer.wrap(bytes); return bb.getInt(); } Thank you all for your help!

Read the article
Java, merging two arrays evenly

- by user2435044

What would be the best way to merge two arrays of different lengths together so they are evenly distributed in the new array? Say I have the following arrays String[] array1 = new String[7]; String[] array2 = new String[2]; String[] mergedArray = new String[array1.length + array2.length]; I would want mergedArray to have the following elements array1 array1 array1 array2 array1 array1 array1 array2 array1 but if I were to change the size of the arrays to String[] array1 = new String[5]; String[] array2 = new String[3]; String[] mergedArray = new String[array1.length + array2.length]; then I would want it to be array1 array2 array1 array2 array1 array2 array1 array1 basically if it can be helped each array2 element shouldn't be touching each other; exception if array2 has a size larger than array1.

Read the article
Elastic Collision Formula in Java

- by Shijima

I'm trying to write a Java formula based on this tutorial: 2-D elastic collisions without Trigonometry. I am in the section "Elastic Collisions in 2 Dimensions". In step 1, it mentions "Next, find the unit vector of n, which we will call un. This is done by dividing by the magnitude of n". My below code represents the normal vector of 2 objects (I'm using a simple array to represent the normal vector), but I am not really sure what the tutorial means by dividing the magnitude of n to get the un. int[] normal = new int[2]; normal[0] = ball2.x - ball1.x; normal[1] = ball2.y - ball1.y; Can anyone please explain what un is, and how I can calculate it with my array in Java?

Read the article
CSS / HTML - Image will not show up

- by weka

Ugh, ok. I've been up all night working this thing and now an image won't show. It's so darn annoying. Trying to get this .png image to show up on a simple PHP webpage. I just wanna go to sleep X_X CSS: <style> .achievement { position:relative; width:500px; background:#B5B5B5; float:left; padding:10px; margin-bottom:10px; } .icon { float:left; width:32px; height:32px; background: url("images/trophy.php") no-repeat center; padding:05px; border:4px solid #4D4D4D; } .ptsgained { position:absolute; top:0; right:0; background:#79E310; color:#fff; font-family:Tahoma; font-weight:bold; font-size:12px; padding:5px; } .achievement h1 { color:#454545; font-size:12pt; font-family:Georgia; font-weight:none; margin:0;padding:0; } .achievement p { margin:0;padding:0; font-size:12px; font-family:Tahoma; color:#1C1C1C; } .text { margin-left:10px; float:left; } </style> HTML: <div class="achievement"> <span class="ptsgained">+10</span> <div class="icon"></div> <div class="text"><h1>All Around Submitter</h1> <p>Submit and have approved content in all 6 areas.</p> </div> </div> What am I doing wrong, guys? :\

Read the article
WCF methods sharing a dictionary

- by YeomansLeo

I'm creating a WCF Service Library and I have a question regarding thread-safety consuming a method inside this library, here is the full implementation that I have until now. namespace WCFConfiguration { [ServiceBehavior(InstanceContextMode = InstanceContextMode.PerCall, ConcurrencyMode = ConcurrencyMode.Single)] public class ConfigurationService : IConfigurationService { ConcurrentDictionary<Tuple<string,string>, string> configurationDictionary = new ConcurrentDictionary<Tuple<string,string>, string>(); public void Configuration(IEnumerable<Configuration> configurationSet) { Tuple<string, string> lookupStrings; foreach (var config in configurationSet) { lookupStrings = new Tuple<string, string>(config.BoxType, config.Size); configurationDictionary.TryAdd(lookupStrings, config.RowNumber); } } public void ScanReceived(string boxType, string size, string packerId = null) { } } } Imagine that I have a 10 values in my configurationDictionary and many people want to query this dictionary consuming ScanReceived method, are those 10 values be shared for each of the clients that request ScanReceived? Do I need to change my ServiceBehavior? The Configuration method is only consumed by one person by the way.

Read the article
Android, how to make two buttons next to each other with the same width

- by user3674127

Im trying to place two buttons on the xml next to each other and I want them both to be the same size(half from the width of the screen) - this is my xml: <LinearLayout android:layout_width="fill_parent" android:orientation="horizontal" android:id="@+id/linearLayout2" android:layout_height="fill_parent" android:gravity="bottom" android:weightSum="2"> <Button android:layout_weight="1" android:layout_width="wrap_content" android:layout_height="wrap_content" android:id="@+id/bAddDelete" /> <Button android:layout_weight="1" android:layout_width="wrap_content" android:layout_height="wrap_content" android:id="@+id/bMainMenu" /> </LinearLayout> Everything works well, but when im changing the text in java, the width is changing, how can I make them the same size? Thanks

Read the article
python input for itertools.product

- by user364249

Looking for a way to simulate nested loops (or a cartesian product) i came across the itertools.product function. i need a function or piece of code that receive a list of integers as input and returns a specific generator. example: input = [3,2,4] - gen = product(xrange(3),xrange(2),xrange(4)) or input = [2,4,5,6] - gen = product(xrange(2),xrange(4),xrange(5),xrange(6)) as the size of the lists varies i am very confused in how to do that without the need of a lot of precoding based on a crazy amount of ifs and the size of the list. also is there a difference in calling product(range(3)) or product(xrange(3))?

Read the article
What is the fastest way to write hundreds of files to disk using C#?

- by Ehsan

My program should write hundreds of files to disk, received by external resources (network) each file is a simple document that I'm currently store it with the name of GUID in a specific folder but creating hundred files, writing, closing is a lengthy process. Is there any better way to store these amount of files to disk? I've come to a solution, but I don't know if it is the best. First, I create 2 files, one of them is like allocation table and the second one is a huge file storing all the content of my documents. But reading from this file would be a nightmare; maybe a memory-mapped file technique could help. Could working with 30GB or more create a problem?

Read the article
android localization: Is it a good practice to have only needed resource to put in localized folder?

- by MobileDev123

Hi, My application has 4 languages in it. However only one module needs to be localized out of 5, This module has 4 layout files and some images, remaining files can be there in default layout folder and drawable folders. My question is : is it good practice to put only needed files in localization folders, if I leave other files in its respective folders and don't copy them in translation folders, does my application throw NullPointerException when my application runs in other language? and Does android market have any size limit? (Also being a BB developer,AFAIK they do not allow OTA, if the application size grows more than 3 mb) [In case i need to copy the layout and image files]. Note about NullPointerException : it throws in string if you omit some string in localization and application runs in that particular locale. Thanks

Read the article
the use of private keyword

- by LAT

Hi everyone I am new to programming. I am learning Java now, there is something I am not really sure, that the use of private. Why programmer set the variable as private then write , getter and setter to access it. Why not put everything in public since we use it anyway. public class BadOO { public int size; public int weight; ... } public class ExploitBadOO { public static void main (String [] args) { BadOO b = new BadOO(); b.size = -5; // Legal but bad!! } } I found some code like this, and i saw the comment legal but bad. I don't understand why, please explain me.

Read the article
Custom deleters for std::shared_ptrs

- by Kristian D'Amato

Is it possible to use a custom deleter after creating a std::shared_ptr without using new? My problem is that object creation is handled by a factory class and its constructors & destructors are protected, which gives a compile error, and I don't want to use new because of its drawbacks. To elaborate: I prefer to create shared pointers like this, which doesn't let you set a custom deleter (I think): auto sp1 = make_shared<Song>(L"The Beatles", L"Im Happy Just to Dance With You"); Or I can create them like this, which does let met set a deleter through an argument: auto sp2(new Song, MyDeleterFunc); But the second one uses new, which AFAIK isn't as efficient as the top sort of allocation. Maybe this is clearer: is it possible to get the benefits of make_shared<> as well as a custom deleter? Would that mean having to write an allocator?

Read the article
Algorithms for finding the intersections of intervals

- by tomwu

I am wondering how I can find the number of intervals that intersect with the ones before it. for the intervals [2, 4], [1, 6], [5, 6], [0, 4], the output should be 2. from [2,4] [5,6] and [5,6] [0,4]. So now we have 1 set of intervals with size n all containing a point a, then we add another set of intervals size n as well, and all of the intervals are to the right of a. Can you do this in O(nlgn) and O(nlg^2n)?

Read the article

< Previous Page | 384 385 386 387 388 389 390 391 392 393 394 395 | Next Page >