Search Results

Search found 20359 results on 815 pages for 'fixed length record'.

Page 558/815 | < Previous Page | 554 555 556 557 558 559 560 561 562 563 564 565  | Next Page >

• jQuery ajax() function is ignoring dataType parameter in Firefox

  - by ccleve

  I'm trying to use jQuery.ajax() to fetch some html, but Firefox is giving me a "junk after document element" error message. As explained here and here the problem seems to be that Firefox is expecting XML from the server, and when it doesn't parse correctly it throws the error. Here's my ajax code: jQuery.ajax({ url: name, dataType: "html", success: function(result) { console.log(result); }, error: function (jqXHR, textStatus, errorThrown) { console.log(errorThrown); } }); The server returns the html with these response headers: Accept-Ranges bytes Content-Length 2957 Last-Modified Tue, 02 Jul 2013 16:16:59 GMT Note that there's no content-type header. I'm sure that adding one would solve the problem, but that's not an option. The real problem is that Firefox appears to be ignoring the dataType: parameter in the ajax call. I've also tried adding contentType: and accepts: parameters, but it doesn't help. What am I missing here? How do I force Firefox to process the response as plain text?

  Read the article

• Regex to match the first file in a rar archive file set in Python

  - by mridang

  I need to uncompress all the files in a directory and for this I need to find the first file in the set. I'm currently doing this using a bunch of if statements and loops. Can i do this this using regex? Here's a list of files that i need to match: yes.rar yes.part1.rar yes.part01.rar yes.part001.rar yes.r01 yes.r001 These should NOT be matched: no.part2.rar no.part02.rar no.part002.rar no.part011.rar no.r002 no.r02 I found a similar regex on this thread but it seems that Python doesn't support varible length lookarounds. A single line regex would be complicated but I'll document it well and it's not a problem. It's just one of those problems you beat your heap up, over. Thanks in advance guys. :)

  Read the article

• Creating a short unique string for each unique long string

  - by king.net

  I'm trying to create a url shortener system in c# and asp.net mvc. I know about hashtable and I know how to create a redirect system etc. The problem is indexing long urls in database. Some urls may have up to 4000 character length, and it seems it is a bad idea to index this kind of strings. The question is: How can I create a unique short string for each url? for example MD5 can help me? Is MD5 really unique for each string? NOTE: I see that Gravatar uses MD5 for emails, so if each email address is unique, then its MD5 hashed value is unique. Is it right? Can I use same solution for urls?

  Read the article

• What language has the longest "Hello world" program?

  - by Kip

  In most scripting languages, a "Hello world!" application is very short: print "Hello world" In C++, it is a little more complicated, requiring at least 46 non-whitespace characters: #include <cstdio> int main() { puts("Hello world"); } Java, at 75 non-whitespace characters, is even more verbose: class A { public static void main(String[] args) { System.out.print("Hello world"); } } Are there any languages that require even more non-whitespace characters than Java? Which language requires the most? Notes: I'm asking about the length of the shortest possible "hello world" application in a given language. A newline after "Hello world" is not required. I'm not counting whitespace, but I know there is some language that uses only whitespace characters. If you use that one you can count the whitespace characters.

  Read the article

• Fastest way to calculate an X-bit bitmask?

  - by Virtlink

  I have been trying to solve this problem for a while, but couldn't with just integer arithmetic and bitwise operators. However, I think its possible and it should be fairly easy. What am I missing? The problem: to get an integer value of arbitrary length (this is not relevant to the problem) with it's X least significant bits sets to 1 and the rest to 0. For example, given the number 31, I need to get an integer value which equals 0x7FFFFFFF (31 least significant bits are 1 and the rest zeros). Of course, using a loop OR-ing a shifted 1 to an integer X times will do the job. But that's not the solution I'm looking for. It should be more in the direction of (X << Y - 1), thus using no loops.

  Read the article

• Can an interface be implemented across an aggregate/composite class in vb.net?

  - by Casey

  VB.NET .NET 3.5 I have an aggregate class called Package as part of a shipping system. Package contains another class, BoxType . BoxType contains information about the box used to ship the package, such as length, width, etc. of the Box. Package has a method called GetShippingRates. This method calls a separate helper class, ShipRater, and passes the Package itself as an argument. ShipRater examines the Package as well as the BoxType, and returns a list of possible shipping rates/methods. What I would like to do is construct an Interface, IRateable, that would be supplied to the helper class ShipRater. So instead of: Class ShipRater Sub New(SomePackage as Package) End Sub End Class we would do: Class ShipRater Sub New(SomePackage as IRateable) End Sub End Class However, ShipRater requires information from both the Package and its aggregate, BoxType. If I write an interface IRateable, then how can I use the BoxType properties to implement part of the Interface? Is this possible?

  Read the article

• Heuristic algorithm for load balancing among threads.

  - by Il-Bhima

  I'm working on a multithreaded program where I have a number of worker threads performing tasks of unequal length. I want to load-balance the tasks to ensure that they do roughly the same amount of work. For task T_i I have a number c_i which provides a good approximation to the amount of work that is required for that task. I'm looking for an efficient (O(N) N = num tasks or better) algorithm which will give me "roughly" a good load balance given the values of c_i. It doesn't have to be optimal, but I would like to be able to have some theoretical bounds on how bad the resulting allocations are. Any ideas?

  Read the article

• Best way to produce automated exports in tab-delimited form from Teradata?

  - by Cade Roux

  I would like to be able to produce a file by running a command or batch which basically exports a table or view (SELECT * FROM tbl), in text form (default conversions to text for dates, numbers, etc are fine), tab-delimited, with NULLs being converted to empty field (i.e. a NULL colum would have no space between tab characters, with appropriate line termination (CRLF or Windows), preferably also with column headings. This is the same export I can get in SQL Assistant 12.0, but choosing the export option, using tab delimiter, setting my NULL value to '' and including column headings. I have been unable to find the right combination of options - the closest I have gotten is by building a single column with CAST and '09'XC, but the rows still have a leading 2-byte length indicator in most settings I have tried. I would prefer not to have to build large strings for the various different tables.

  Read the article

• How do I make this simple list comprehension?

  - by Carson Myers

  I'm new to python, and I'm trying to get to know the list comprehensions better. I'm not even really sure if list comprehension is the word I'm looking for, since I'm not generating a list. But I am doing something similar. This is what I am trying to do: I have a list of numbers, the length of which is divisible by three. So say I have nums = [1, 2, 3, 4, 5, 6] I want to iterate over the list and get the sum of each group of three digits. Currently I am doing this: for i in range(0, len(nums), 3): nsum = a + b + c for a, b, c in nums[i, i+3] print(nsum) I know this is wrong, but is there a way to do this? I'm sure I've overlooked something probably very simple... But I can't think of another way to do this.

  Read the article

• Javascript setters/getters

  - by Martin Hansen

  var author = { firstname: 'Martin', lastname: 'Hansen' } function settersGetters(propStr) { for (var i = 0; i < propStr.length; i++) { author['_'+ propStr[i]] = null; author.__defineGetter__(propStr[i], function() { return author['_'+ propStr[i]]; }); author.__defineSetter__(propStr[i], function(val) { author['_'+ propStr[i]] = val; }); }; } The above code would hopefully generate setters/getters for any supplied properties (in an array) for the object author. But when I call the below code Both firstname and lastname is olsen.. What am I doing wrong? settersGetters(['firstname', 'lastname']); author.firstname = 'per'; author.lastname = 'olsen'; console.log(author.firstname); console.log(author.lastname);

  Read the article

• Resolve formatted table value in wix custom action

  - by Michael Stoll

  Hi, I've created certificate wix extension (extension of IisExtension). This includes a custom table, which is consumed by a custom action. A column is defined as follows: <columnDefinition name="Account" type="string" length="72" primaryKey="yes" modularize="property" category="formatted" description="..." /> This column contains values like "[Property]". When the custom action reads this column like this: hr = WcaGetRecordString(hRecCertificate, vcpqAccount, &pwzTemp); it get's the string "[Property]". But I need "PropertyValue". How can this string be resolved? Regards Michael

  Read the article

• Tracking unique versions of files with hashes

  - by rwmnau

  I'm going to be tracking different versions of potentially millions of different files, and my intent is to hash them to determine I've already seen that particular version of the file. Currently, I'm only using MD5 (the product is still in development, so it's never dealt with millions of files yet), which is clearly not long enough to avoid collisions. However, here's my question - Am I more likely to avoid collisions if I hash the file using two different methods and store both hashes (say, SHA1 and MD5), or if I pick a single, longer hash (like SHA256) and rely on that alone? I know option 1 has 288 hash bits and option 2 has only 256, but assume my two choices are the same total hash length. Since I'm dealing with potentially millions of files (and multiple versions of those files over time), I'd like to do what I can to avoid collisions. However, CPU time isn't (completely) free, so I'm interested in how the community feels about the tradeoff - is adding more bits to my hash proportionally more expensive to compute, and are there any advantages to multiple different hashes as opposed to a single, longer hash, given an equal number of bits in both solutions?

  Read the article

• Indentation (and wrap-indentation) of debug strings output by printf()/fprintf() in C program

  - by mbaitoff

  I'm using a debug output using printf() in my functions, but the output goes to the console starting at the 1st columns. I'd like to distinguish the nesting level of functions by indenting their output strings each time I dive into the function (it's implemented easily having a static int indentlevel; variable, which is incremented at the beginning of a function, used as a space-filler-count and decremented at the end). But the flaw is that once the output line becomes too long to be wrapped at the console edge, lines' wrapped parts start at column 1 of the console. Should I take care about this, since once the output is redirected to a file, lines are, say, one-line-length, and widths of the lines depend only on the text file viewer settings?

  Read the article

• Object as an array

  - by owca

  I need to create class Dog and PurebredDog extending Dog. Problem is that Dog can be at once single object and array of objects (Dogs and PurebreedDogs : Dog pack[]={new Dog(76589,"As","black",18, "Ann","Kowalsky"), new PurebreedDog(45321,"Labrador","Elf","black",25, "Angus","Mati","Barbara","Smith"), new Dog(102467,"Gamma","brown",89, "Josh","Coke"), new PurebreedDog(9678,"York","Theta","brown",8, "Emka","Figaro","Alice","Cat")}; for(int i=0; i < pack.length; i++) System.out.println(pack[i]+"\n\n"); How to write proper constructor for Dog ?

  Read the article

• catDog string problem at Codingbat.com [closed]

  - by stanny110

  public boolean catDog(String str) { int catAnswer = 0; int dogAnswer = 0; int cat_Count = 0; int dog_Count = 0; for (int i=0; i< str.length()-1; i++) { String sub = str.substring(i, i+2); if ((sub.equals("cat"))) cat_Count++; if ((sub.equals("dog"))) dog_Count++; catAnswer = cat_Count; dogAnswer = dog_Count; } //end for if(dogAnswer == catAnswer ) {return true;} // else return (dogAnswer != catAnswer) ;

  Read the article

• Convert From Custom List to List of String

  - by Paul Johnson

  Hi all I have the following code: Public Shared Function ConvertToString(ByVal list As IList) As String Dim strBuilder = New System.Text.StringBuilder() Dim item As Object For Each item In list strBuilder.Append(obj.ToString()) strBuilder.Append(",") Next Return strBuilder.ToString(strBuilder.Length - 1) End Function The intention is to convert an IList of custom objects to a string equivalent comprising each element in the Ilist. Unfortunately I can't seem to find a way to get the underlying data of the custom object, and of course as in the above example, using object simply gives me a string of types definitions, rather than access to the underlying data. Any assistance much appreciated. Paul.

  Read the article

• jump search algorithm

  - by davit-datuashvili

  i am doing jump search algorithm but it show me that element is not in array while it is here is code import java.math.*; public class jamp { public static int min(int a,int b){ return a } public static void main(String[]args){ int a[]=new int[]{3,7,9,12,14,15,16,17,18}; int l=14; System.out.println(jumpsearch(a,a.length,l)); } public static int jumpsearch(int a[],int n, int l ){ int t=0; int b=(int)Math.sqrt(n); while (a[min(b,n)-1]=n) return -1 ; } while (a[t] return -1 ; if ( a[t]==l) { return t; } } return -1; } } please help

  Read the article

• Rails 2.x http basic authentication

  - by randombits

  I'm trying to get basic http authentication working on my Rails app. I'm offering a simple REST interface served by a Rails server, only xml/json output. Every method needs authentication, so I put the authenticate filter in ApplicationController: class ApplicationController < ActionController::Base helper :all # include all helpers, all the time before_filter :authenticate protected def authenticate authenticate_or_request_with_http_basic do |u, p| true end end end Even with having the method return true, I'm receiving a 401 from the server: $ curl http://127.0.0.1:3000/myresource/1.xml -i HTTP/1.1 401 Unauthorized Cache-Control: no-cache WWW-Authenticate: Basic realm="Application" X-Runtime: 1 Content-Type: text/html; charset=utf-8 Content-Length: 27 Server: WEBrick/1.3.1 (Ruby/1.9.1/2010-01-10) Date: Thu, 03 Jun 2010 02:43:55 GMT Connection: Keep-Alive HTTP Basic: Access denied. If I'm explicitly returning true, yet getting served a 401.

  Read the article

• draw line over uilable after loading from nib

  - by Nnp

  here is my code CGContextRef c = UIGraphicsGetCurrentContext(); CGContextBeginPath(c); CGContextMoveToPoint(c, 277.0f, 21.0f); CGFloat newpoint = 277.0f + (CGFloat)(self.msrp.text.length * 8); //NSLog(@"%f", newpoint); CGContextAddLineToPoint(c, newpoint, 21.0f); CGContextStrokePath(c); i am trying to draw a line over UIlabel, i am loading my view from nib.i dont know what i am doing wrong. i just work fine if i draw entire view instead loading from nib.(but i dont wanna do that)

  Read the article

• Anonymous Methods / Lambda's (Coding Standards)

  - by Mystagogue

  In Jeffrey Richter's "CLR via C#" (the .net 2.0 edtion page, 353) he says that as a self-discipline, he never makes anonymous functions longer than 3 lines of code in length. He cites mostly readability / understandability as his reasons. This suites me fine, because I already had a self-discipline of using no more than 5 lines for an anonymous method. But how does that "coding standard" advice stack against lambda's? At face value, I'd treat them the same - keeping a lambda equally as short. But how do others feel about this? In particular, when lambda's are being used where (arguably) they shine brightest - when used in LINQ statements - is there genuine cause to abandon that self-discipline / coding standard?

  Read the article

• Multidimensional arrays in VB.NET 2010

  - by matt_t

  Is there any way to create a multidinensional array that contains arrays of different lengths (similar to nesting arrays of different lengths in python). Because if I were to declare a variable Dim accounts(2,2) As Integer all 1D arrays at each dimension have the same length. Is there any way to create an array so that this is not the case? e.g The above code would create an array like this: [[0,0],[0,0]] but would it be possible to create this: [[0,0],[0,0,0]] Apologies for the poor explanation but I cannot think of any better ways to explain.

  Read the article

• images are getting clipped when Jquery animate opacity is used in IE

  - by Raja

  I use the function given below: function rotate() { //Get the first image var current = ($('div#rotator ul li.show') ? $('div#rotator ul li.show') : $('div#rotator ul li:first')); //Get next image, when it reaches the end, rotate it back to the first image var next = ((current.next().length) ? ((current.next().hasClass('show')) ? $('div#rotator ul li:first') : current.next()) : $('div#rotator ul li:first')); //Set the fade in effect for the next image, the show class has higher z-index next.css({ opacity: 0.0 }) .addClass('show') .animate({ opacity: 1.0 }, 1000); //Hide the current image current.animate({ opacity: 0.0 }, 1000) .removeClass('show'); }; It does a slide show of images. It works perfect on Firefox and Google Chrome but clips the images in IE 7 and IE 8. Any help is much appreciated. Thanks in advance.

  Read the article

• android getAppWidgetIds failed, what wrong?

  - by bright

  I want to use following code to get a widget id, but getAppWidgetIds always return an empty array, the num is alway 0, what wrong? Thanks! public class test extends Activity implements OnTouchListener { public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); ..... AppWidgetManager mAppWidgetManager; AppWidgetHost mAppWidgetHost; mAppWidgetManager = AppWidgetManager.getInstance(this.getApplicationContext()); ComponentName THIS_APPWIDGET =new ComponentName("com.android.music", "com.android.music.MediaAppWidgetProvider"); int[] appWidgetId=mAppWidgetManager.getAppWidgetIds(THIS_APPWIDGET); int num=appWidgetId.length;

  Read the article

• Javascript replace last occurence of text in a string

  - by Ruth

  Hi all see my code snippet below: var list = ['one', 'two', 'three', 'four']; var str = 'one two, one three, one four, one]; for ( var i = 0; i < list.length; i++) { if (str.endsWith(list[i]) { str = str.replace(list[i], 'finsih') } } I want to replace the last occurence of the word one with the word finish in the string, what I have will not work because the replace method will only replace the first occurence of it. Does anyone know how I can amend that snippet so that it only replaces the last instance of 'one' Thank you Ruth

  Read the article

• Scala regex Named Capturing Groups

  - by Brent

  In scala.util.matching.Regex trait MatchData I see that there support for groupnames (Named Capturing Groups) But since Java does not support groupnames until version 7 as I understand it, Scala version 2.8.0.RC4 (Java HotSpot(TM) 64-Bit Server VM, Java 1.6. gives me this exception: scala> val pattern = """(?<login>\w+) (?<id>\d+)""".r java.util.regex.PatternSyntaxException: Look-behind group does not have an obvio us maximum length near index 11 (?<login>\w+) (?<id>\d+) ^ at java.util.regex.Pattern.error(Pattern.java:1713) at java.util.regex.Pattern.group0(Pattern.java:2488) at java.util.regex.Pattern.sequence(Pattern.java:1806) at java.util.regex.Pattern.expr(Pattern.java:1752) at java.util.regex.Pattern.compile(Pattern.java:1460) So the question is Named Capturing Groups supported in Scala? If so any examples out there? If not I might look into the Named-Regexp lib from clement.denis.

  Read the article

< Previous Page | 554 555 556 557 558 559 560 561 562 563 564 565  | Next Page >