Search Results

Search found 9017 results on 361 pages for 'efficient storage'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 180/361 | < Previous Page | 176 177 178 179 180 181 182 183 184 185 186 187  | Next Page >

  • PHP code to convert a MySQL query to CSV

    - by Reilly
    What is the most efficient way to convert a MySQL query to CSV in PHP please? It would be best to avoid temp files as this reduces portability (dir paths and setting file-system permissions required). The CSV should also include one top line of field names. Cheers.

    Read the article

  • Duplicating an array of strings.

    - by Jon
    arr = ["red","green","yellow"] arr2 = arr.clone arr2[0].replace("blue") puts arr.inspect puts arr2.inspect produces: ["blue", "green", "yellow"] ["blue", "green", "yellow"] Is there anyway to do a deep copy of an array of strings, other than using Marshal as i understand that is a hack. I could do: arr2 = [] arr.each do |e| arr2 << e.clone end but it doesn't seem very elegant, or efficient. Thanks

    Read the article

  • How to iterate all query paths within an image header namespace in WIC?

    - by muruge
    Hello All, I am using Windows Imaging Component to read/write image metadata in my WPF application. I would like to know if there is an efficient way to know if any paths exist within a namespace. For instance I would like to know if any paths within IPTC namespace exist and if not I want to delete the namespace from the image header. Any pointers would be greatly appreciated. Thanks, Murugesh.

    Read the article

  • Storing data in HTML, javascript book, articles recommendations.

    - by michael
    I'm looking for articles or books that discuss schemes and techniques adopted by pro javascript developers to store and organize data with html tags. In other words, how to emulate xml data storage with html as semantically as possible. Some various solutions that I've seen mentioned in passing are custom DTD, custom attributes with xhtml, early adoption of html5 and its data- attribute. Now, I'm looking for some tangible material that goes in depth with these concepts.

    Read the article

  • Allow repeater to be arranged using drag-drop

    - by o-logn
    Hey all, I have a repeater that's bound to a SQL Data Source (using ASP.NET). Are there any JQuery plugins/efficient way of converting my repeater into something that can be sorted via drag and drop? i.e. users can rearrange the order of the data, which updates the database? Thanks

    Read the article

  • Java fixed memory map

    - by juber
    Hi, Is there a simple, efficient Map implementation that allows a limit on the memory to be used by the map. My use case is that I want to allocate dynamically most of the memory available at the time of its creation but I don't want OutOFMemoryError at any time in future. Basically, I want to use this map as a cache, but but I wanna avoid heavy cache implementations like EHCache. My need is simple (at most an LRU algorithm)

    Read the article

  • Rails - good tool to create a scheduled background process which will regularly retrieve messages fr

    - by adam
    Background Job gets mentioned a lot but all the tutorials I've seen seem to indicate that its for queuing jobs which are created by some external event such as a user clicking "Send mail". But what about when you have code that needs to scheduled to run every 30 seconds to listen for new messages from twitter? Normally rake is recommended for set in stone schedules but it inst so efficient for frequent jobs as it has to to load the entire rails app each time. Can anyone recommend anything for this situation?

    Read the article

  • Control statements in Haskell?

    - by Nathan
    I am just beginning Haskell, but from all the online tutorials I've found I can't seem to find if there is one accepted way to do a conditional control statement. I have seen if-else, guards, and pattern matching, but they all seem to accomplish the same thing. Is there one generally accepted/faster/more efficient way than the rest?

    Read the article

  • Jquery selector question

    - by fizzer
    Hi, I have a working selector but I just wondered whether there was another way I could write it. Here's the html structure: THIS IS TEXT I WANT TO SELECT item 1 item 2 item 3 I have a click event attached to the nested listitems. In the click event I am trying to select the anchor tag. I have used the follwing selector: $(this).parents('li').children('a') Is this the most efficient way of selecting the anchor tag?

    Read the article

  • Substitute for Iterator that is Serialization

    - by Mahmoud
    I'm working on a GWT project, and I have a bunch of Java classes that use Java Object Iterators on the server side. As I was reading through the internet...Iterators seem to not be serializable preventing me from sending them over to the client side from the server side. My question is is there an efficient way to serialize the iterator or use a substitute that might be serializable ? Many thanks!

    Read the article

  • As an experiment I want to work a bit with AWS. How much might I expect to pay?

    - by dartdog
    I'm about to go to Pycon, and while I have my hosting at Webfaction one of the tutorials (JKM) asks for students to have AWS instances. I've been trying to figure out what some minimum charge examples might look like? I'll have a lamp server with Django and a requisite amount of storage but next to no traffic,,Any one have some guidance/advice? My Google searches and look here did not turn up much useful info?

    Read the article

  • MySQL: Which is faster — INSTR or LIKE?

    - by Grekker
    If your goal is to test if a string exists in a MySQL column (of type 'varchar', 'text', 'blob', etc) which of the following is faster / more efficient / better to use, and why? Or, is there some other method that tops either of these? INSTR( columnname, 'mystring' ) > 0 vs columnname LIKE '%mystring%'

    Read the article

  • cons operator (::) in F#

    - by Max
    The :: operator in F# always prepends elements to the list. Is there an operator that appends to the list? I'm guessing that using @ operator [1; 2; 3] @ [4] would be less efficient, than appending one element.

    Read the article

  • Take the intersection of an arbitrary number of lists in python

    - by thepandaatemyface
    Suppose I have a list of lists of elements which are all the same (i'll use ints in this example) [range(100)[::4], range(100)[::3], range(100)[::2], range(100)[::1]] What would be a nice and/or efficient way to take the intersection of these lists (so you would get every element that is in each of the lists)? For the example that would be: [0, 12, 24, 36, 48, 60, 72, 84, 96]

    Read the article

  • Best Method for "Back Button"

    - by CitadelCSCadet
    I'm working on a web application using JSP/Servlets, etc. And I have a lot of form progression. I am aware of some ways to use the "Back" functionality, but I am not sure if its efficient enough. What are the best ways to implement this? Does it Involve using the session object? or just the request? or neither?

    Read the article

  • How to create a complete binary tree of height 'h' using Python?

    - by Jack
    Here is the node structure class Node: def __init__(self, data): # initializes the data members self.left = None self.right = None self.parent = None self.data = data complete binary tree Definition: A binary tree in which every level, except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible. -- http://www.itl.nist.gov/div897/sqg/dads/HTML/completeBinaryTree.html I am looking for an efficient algorithm.

    Read the article

  • ruby number to human-readable string conversion

    - by yaya3
    I need to have a list with id's for each list item being #one, #two etc. Is this the most efficient way or am I missing an in built ruby function here? -num_array = ["one", "two", "three", "four", "five", "six", "seven"] -navigation[:primary_level].each_with_index do |primary_item, idx| %li{ :id => "#{num_array[idx]}"}

    Read the article

  • PHP: Count-IF for Arrays

    - by st4ck0v3rfl0w
    Hi All, What would be the most efficient way of counting the number of times a value appears inside an array? Example Array ('apple','apple','banana','banana','kiwi') Ultimately I want a function to spit out the percentages for charting purposes (e.g. apple = 40%, banana = 40%, kiwi = 20%)

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 176 177 178 179 180 181 182 183 184 185 186 187  | Next Page >