Search Results

Search found 19795 results on 792 pages for '8 bit'.

Page 495/792 | < Previous Page | 491 492 493 494 495 496 497 498 499 500 501 502  | Next Page >

• Asp.net Site on GoDaddy Loads Slowly

  - by Randy

  I just published a very small site to GoDaddy that I programmed in Microsoft Visual Web Developer 2008. The site only contains 6 sheets, none of which are data intensive. Each has a few small images that serve mostly to navigate to the other sheets. There is no data, no SQL, nothing like that. There is one master page that governs the page layout for all of the pages. Everything works fine, for the most part. I am posting because the site loads quite slowly, particularly considering how little content is being loaded. Can anybody give me any advice about what I should look at to speed this thing up a little bit? Is this an asp.net issue? Use of master pages? Godaddy? Something else? I'm a newbie, so speak slowly. Thanks.

  Read the article

• Good way to "wrap" jars for OSGi with Maven

  - by javamonkey79

  I was looking at the PAX tools on OPS4J for example: this one and I thought I'd found a nice way to: Specify an artifact Create an assembled jar (jar that contains all dependencies) from that jar and it's transitive dependencies Wrap it with BND to create an OSGi bundle It turns out, that I was wrong - it doesn't appear that the PAX stuff does this. (RTFM, right? :) ) But this got me wondering: is there something out there that does what I'm asking? I've thought maybe I could do this by creating a simple POM and using the maven-bundle-plugin but this seems like it might be a bit cumbersome for what I'm asking. NOTE: I get that embedding and assembling jar's is not really "the OSGi way" - so I wouldn't do this unless I really felt it useful. For example - Spring. Thanks in advance.

  Read the article

• Why is Decimal('0') > 9999.0 True in Python?

  - by parxier

  This is somehow related to my question Why is ''0 True in Python? In Python 2.6.4: >> Decimal('0') > 9999.0 True From the answer to my original question I understand that when comparing objects of different types in Python 2.x the types are ordered by their name. But in this case: >> type(Decimal('0')).__name__ > type(9999.0).__name__ False Why is Decimal('0') > 9999.0 == True then? UPDATE: I usually work on Ubuntu (Linux 2.6.31-20-generic #57-Ubuntu SMP Mon Feb 8 09:05:19 UTC 2010 i686 GNU/Linux, Python 2.6.4 (r264:75706, Dec 7 2009, 18:45:15) [GCC 4.4.1] on linux2). On Windows (WinXP Professional SP3, Python 2.6.4 (r264:75706, Nov 3 2009, 13:23:17) [MSC v.1500 32 bit (Intel)] on win32) my original statement works differently: >> Decimal('0') > 9999.0 False I even more puzzled now. %-(

  Read the article

• JS 2 minute countdown then execute a function?

  - by Cyprus106

  I'm not that great at Javascript, for the record! I DO know how to use ajax. I just need a bit of help. I'm having a hard time figuring out how to display a 5 minute countdown, and once the countdown hits zero, to run a function. I need to pass a variable to the function that needs to run. I tried SetInterval but this isn't exactly my strong suit. Does anyone have any suggestions? I can post the code I've got, but I would equate it to a gorilla fumbling in the dark at a typewriter!

  Read the article

• Why does C's "fopen" take a "const char *" as its second argument?

  - by Chris Cooper

  It has always struck me as strange that the C function "fopen" takes a "const char *" as the second argument. I would think it would be easier to both read your code and implement the library's code if there were bit masks defined in stdio.h, like "IO_READ" and such, so you could do things like: FILE* myFile = fopen("file.txt", IO_READ & IO_WRITE); Is there a programmatic reason for the way it actually is, or is it just historic? (i.e. "That's just the way it is.")

  Read the article

• Java M4A atom tagging free space issue

  - by Brett

  Hey, I've been trying to be able to read and write iTunes style M4A atoms and while I've successfully done the reading part, I've come to a bit of a halt in regards to the free space atoms. I figured that I should be able edit and shift the padding around to accommodate writing an atom with more data than it originally had. I've been stuck on this for about a day now, and I've been trying to figure out how to determine the closest free space atom with enough size to accommodate the new data. so far I have: private freeAtom acquireFreeSpaceAtom( long position ) { long atomStart = Long.MAX_VALUE; freeAtom atom = null; for( freeAtom a : freeSpace ) { if( Math.abs( position - atomStart ) > Math.abs( position - a.getAtomStart() ) ) atomStart = ( atom = a ).getAtomStart(); } return atom; } That code only takes into account the closest free space atom and completely disregards the fact that it should be greater than or equal to a certain size, but I can't quite figure out how I should check for both closeness and size efficiently.

  Read the article

• forcing Management Studio to use alter table instead of drop/recreate

  - by marco

  Hi! I'm wondering if is there a way to force MSSQL Management Studio to produce a script like this: ALTER TABLE Mytable ADD MyCol bit NOT NULL CONSTRAINT MyColDefault DEFAULT 0 WITH VALUES ALTER TABLE [dbo].Mytable ALTER COLUMN MyCol2 int NULL GO when I alter a very simple property of a column on a table. If I do this in the designer and ask for the produced script, the script doesn't do such simple tasks, but instead copies all the data in a tmp table, drops the original table, renames the tmp table with the original table name. And, of course, drops and recreates every constraint and relationships. Is there any option I can change to change this behaviour? Or, this may be possible, is there some danger I don't see in using the simple ALTER TABLE above? thanks.

  Read the article

• iPhone StoreKit development: Can't create a test user?

  - by Cruinh

  I'm trying to get up to speed on how to develop an in-app store using the new 3.0 SDK... but I'm a bit stuck in that I don't seem to be able to create a test account. The iTunes Connect FAQ states "To create test users for your sandbox environment, go to the Manage Users section of iTunes Connect and select In App Purchase Test User. Your test users will not have iTunes Connect access. They will just have access to the sandbox environment." ...but when I go to that Manage Users section, there's no mention of any sort of "In App Purschase Test User" or how to make one. Did I miss doing something to enable that? There is another section of that same FAQ that seems to suggest I need to have a paid app in the store first? Is that the reason I can't even use the test environment?

  Read the article

• Is it possible to change the pane locations in Chrome Developer Tools?

  - by T.J. Crowder

  When debugging browser-based apps using Google Chrome's Developer Tools, is there a way to change the locations of the various panes? E.g., the Watch Expressions, the Call Stack, the code pane, etc.? The defaults are okay (console at bottom, code pane upper left, a column of Watch Expressions, Call Stack, Scope Vars, etc. in the upper right), but I'd rather swap things around a bit of it's possible. There doesn't seem to be anything to grab (other than for sizing) and I haven't found a way in my searching so far, but there are (still) some things about Chrome's options that aren't ... well-advertised in the UI, shall we say :-), especially around developer tools.

  Read the article

• Best way to reverse bitmap data that is upside down

  - by Wladimir

  Hello, I have a method that I call and it returns bitmap data from a capture device. It returns a pointer to the buffer data as an IntPtr and the buffer length as an int. I know in advance that this bitmap is a 24bpp and its width and height. The problem is that the buffer contains the bitmap data upside down and I need this data to be in the right order (reverse it). What I do is create a for loop and using CopyMemory, I copy each line (stride) of this data from bottom to up to a newly allocated memory space. Is there any way to make it faster than creating more memory each time I receive a new frame? It makes the application get a bit slow and consumes more memory as each bitmap is pretty big. I do this because I use another component that analyses the bitmaps and it doesn't work propertly if the bitmaps are upside down. I'm using .net, c# thanks!

  Read the article

• When not to use a Drupal node?

  - by stotastic

  I've recently created a very simple CRUD table where the user stores some data. For the data, I created a custom node. The functionality works great for creating, editing, and deleting data in the CRUD table using the basic node functionality (I'm actually amazed how fast and easy it was to program the basic functionality with proper access controls using only a tiny bit of code).... Since the data isn't meant to be treated the same way as 'content' such as a blog post (no title, no body, no commments, no revisions, shouldn't show up on ?q=node page, no previews, no teasers, etc)... I find that I'm spending most of my time 'turning off' and modifying the stuff that drupal does automatically for nodes. I know its a matter of taste, but where should one draw the line on what should be treated as a node and what shouldn't? In other words, would it be better to program this stuff from scratch without using nodes?

  Read the article

• Evenly distribute items on the screen

  - by abolotnov

  I am trying to solve this little puzzle (the algorithm): I have N image icons and I want to distribute them evenly on users screen. Say, I put them in a table. If there is one image, there will be one cell in a table. If two - one row with two columns, if three - one row and three columns, if four - two rows, two columns... and so on until row space is gone and since then the table should only grow in columns without adding extra rows. I'm trying to figure an algorithm for this and perhaps this is something that has a solution already somewhere? My attempt is so far something like this: obtain_max_rows() obtain_visible_columns() if (number_of_pictures > max_rows*max_columns) { columns = roundup(number_of_pictures/max_rows) for(max_rows){generate row;for columns{generate column}} } else { **here comes to trouble...** } This logic is bit silly though - it somehow needs to think cases where there are 12 pictures on first screen and 2 on the other trying to balance it say 8/6 or somehow like that.

  Read the article

• Do somthing when animation is ready.

  - by f0rz

  Hi! I have a animation in my navigationbased application. [UIView beginAnimations:nil context:nil]; [UIView setAnimationDuration:1.5]; [UIView setAnimationBeginsFromCurrentState:YES]; [UIView setAnimationTransition:UIViewAnimationTransitionCurlDown forView:self.view cache:YES]; [UIImageView commitAnimations]; Directly after this bit of code i call [self.navigationController popViewControllerAnimated:NO]; The thing is, I dont want to pop my ViewController before my animation is ready. Can someone point me to right directions here ?

  Read the article

• Get positions for NAs only in the "middle" of a matrix column

  - by Abiel

  I want to obtain an index that refers to the positions of NA values in a matrix where the index is true if a given cell is NA and there is at least one non-NA value before and after it in the column. For example, given the following matrix [,1] [,2] [,3] [,4] [1,] NA 1 NA 1 [2,] 1 NA NA 2 [3,] NA 2 NA 3 the only value of the index that comes back TRUE should be [2,2]. Is there a compact expression for what I want to do? If I had to I could loop through columns and use something like min(which(!is.na(x[,i]))) to find the first non-NA value in each column, and then set all values before that to FALSE (and the same for all values after the max). This way I would not select leading and trailing NA values. But this seems a bit messy, so I'm wondering if there is a cleaner expression that does this without loops.

  Read the article

• Adding dlls in VS 2008

  - by Bart

  Hello, i would like to add some external .dll libraries e.g. glut32.dll (but it's only example) in vs 2008 using C#. Can you please tell me what should i do step by step? i am a little bit confused cause i found a lot of solutions to add dll files but they significantly differ.. some of them add dll's only using code, some using properties in vs, add references and in other tutorials there is about registering dlls in system. But how to put it all together? Regards!

  Read the article

• deprecated readLine() What to change?

  - by user1681751

  I'm trying to get this to work in the eclipse, but the "readLine" is striked through and a notice says it is depreciated, the code works, albeit not the "while ((var2 = var5.readLine()) != null) {" bit.. So I'm wondering how to fix it, a java beginner. String var2 = ""; HttpURLConnection var3 = null; DataOutputStream var4 = null; DataInputStream var5 = null; ...more code here.... try { var5 = new DataInputStream(var3.getInputStream()); while ((var2 = var5.readLine()) != null) { System.out.println("Server Response " + var2); ScreenShotHelper.mc.thePlayer.addChatMessage("\u00a7aSuccessfully uploaded screenshot! Direct link:"); ScreenShotHelper.mc.thePlayer.addChatMessage("\u00a7a" + var2); } var5.close(); }

  Read the article

• How is a h264 idea bitstream organized? / header start codes

  - by Wolax

  I was trying to learn a bit about h264 by looking at the bitstream of a video file with a hex editor. I found here the start codes for a video object planes (0x000001b6) and for i-frames (0x000001b600). But I can't find many of those bytes in video files. Most of the time those start codes appear at the beginning of a file with only a few bites in between. I expected them to show up very regularly, in equal distance all over the file!? Is is even ok to look at a file with a hex editor this way? What other start codes exist and how is a h264 file organised?

  Read the article

• How to check code is compatible with Windows 7

  - by Julen

  Hello, We are developing using Visual C# 2008 Express a program based on WPF under Windows XP machines (32 bits). The thing is that we have tried to run the program in two Windows 7 machines, one is 32 bits Windows 7 and the other is 64 bits Windows 7. Under Windows XP everything is fine. In Windows 7 machine, it launches in the 32 bits version altough there is an error when running one functionality (it does not happen in XP). In W7 64 bits it even does not launch. Is this normal? Is not possible to run 32 bit programs under W7 64-bits,even if they execute slower?? How can we check the code is compatible with Windows 7? Thank you very much in advance. Julen.

  Read the article

• XHTML editor wanted!

  - by stolsvik

  I need an editor that outputs clean HTML, and preferably strict XHTML with CSS, as I am going to display the resulting pages as help pages in a java application using xhmtlrenderer ("Flying Saucer") which apparently very much prefers XHTML with CSS 2.1. Having searched stackoverflow for HTML editor and XHTML editor, I've found several mentioned. Aptana is one, Eclipse's Web Tools is another, and KompoZer is a third. I am going to try these out. With this question, I ask whether there are other good options that would satisfy my requirements, and if there are any one of these mentioned or new ones that you'd recommend in particular, that I should focus a bit extra on?

  Read the article

• Track unicode words from Twitter using Ruby and the Tweetstream API

  - by Régis B.

  I am trying to track a set of keywords from Twitter by using the Streaming API (can't post the link here because of spam limitations: google twitter streaming API). I am doing this inside Ruby, using the TweetStream gem: http://bit.ly/cODAWI The problem I have is that I want to track keywords that contain some unicode/UTF-8 characters. For instance: require 'rubygems' require 'tweetstream' TweetStream::Client.new("my_user_name", "my_password").track("é") do |s| puts s.text end (you can try it out, provided you installed the tweetstream and json gems) This piece of code does not print anything, while replacing "é" with "e" outputs a bunch of tweets continuously. I did not find any reliable documentation about Unicode in Ruby, so I have no idea where the problem comes from. Thanks for your help!

  Read the article

• Is it okay to truncate a SHA256 hash to 128 bits?

  - by Sunny Hirai

  MD5 and SHA-1 hashes have weaknesses against collision attacks. SHA256 does not but it outputs 256 bits. Can I safely take the first or last 128 bits and use that as the hash? I know it will be weaker (because it has less bits) but otherwise will it work? Basically I want to use this to uniquely identify files in a file system that might one day contain a trillion files. I'm aware of the birthday problem and a 128 bit hash should yield about a 1 in a trillion chance on a trillion files that there would be two different files with the same hash. I can live with those odds. What I can't live with is if somebody could easily, deliberately, insert a new file with the same hash and the same beginning characters of the file. I believe in MD5 and SHA1 this is possible.

  Read the article

• Returning a ReadOnlyCollection from a method with an IList return type

  - by devoured elysium

  Here I have the following bit of code: private IList<IState> _states = new List<IState>(); private ReadOnlyCollection<IState> _statesViewer; public IList<IState> States { get { return _statesViewer; } } Generally it is preferable to return interfaces than the concrete classes themselves, but in this case, shouldn't I set as the return type of the States property a ReadOnlyCollection? Any user of my library will think it is possible to anything you can do with an IList if I set it as so, and that means adding elements. That is not true and I'm definitely breaking the contract exposing it as an IList. Am I right with this view or there is something else I am missing here?

  Read the article

• Creating a new project from a project skeleton using git

  - by asciitaxi

  In order to get a new django project up and running faster, I'd like to maintain a separate "project skeleton" on which I base all my new projects. It would be great if, as I improved the skeleton, I could bring those improvements into my active projects. How can I accomplish this with git? So, maybe in my remote git repository machine I would have 1 repo for each project and one for the skeleton? proj-A-repo proj-B-repo skeleton-repo If I want to create a new proj-C locally based on the skeleton, then push my local changes up to the remote server in a new repo called proj-C-repo, how might I do this? I've read through quite a bit of git documentation, but I'm confused about how to go about this. Do I need to clone the skeleton, or create an empty repo and then track a remote branch, or something else?

  Read the article

• Strict pointer aliasing: any solution for a specific problem?

  - by doublep

  I have a problem caused by breaking strict pointer aliasing rule. I have a type T that comes from a template and some integral type Int of the same size (as with sizeof). My code essentially does the following: T x = some_other_t; if (*reinterpret_cast <Int*> (&x) == 0) ... Because T is some arbitary (other than the size restriction) type that could have a constructor, I cannot make a union of T and Int. (This is allowed only in C++0x only and isn't even supported by GCC yet). Is there any way I could rewrite the above pseudocode to preserve functionality and avoid breaking strict aliasing rule? Note that this is a template, I cannot control T or value of some_other_t; the assignment and subsequent comparison do happen inside the templated code. (For the record, the above code started breaking on GCC 4.5 if T contains any bit fields.)

  Read the article

• Book recommendation for a Ruby dev learning Java

  - by cpjolicoeur

  I've been a Ruby developer for the past 4-5 years, and prior to that coded in Perl and a language called ProvideX for years. As hard as it may seem, I've never written a Java application short of the basic Hello World app probably a decade ago. I'm beginning to start doing some Android development to port some iPhone applications we did for a client over to the Android platform. As such, I'm wondering what the best reference book I can buy is to get up to speed quickly with the features (and peculiarities) of Java. There are numerous "Learn Ruby for Java programmers" out there, but not really any reference books for going the otherway of Ruby-to-Java. I'm looking for something preferably like the "Learn Perl the Hard Way" book. I know how to code, I just need a reference on learning the proper mechanics of Java after having done Ruby (and a bit of Obj-C) work exclusively for the past few years.

  Read the article

< Previous Page | 491 492 493 494 495 496 497 498 499 500 501 502  | Next Page >