Search Results

Search found 878 results on 36 pages for 'pairs'.

Page 20/36 | < Previous Page | 16 17 18 19 20 21 22 23 24 25 26 27  | Next Page >

• How do I get Mathematica to thread a 2-variable function over two lists, using functional programmin

  - by Leah Wrenn Berman

  Lets say I have a function f[x_, y_], and two lists l1, l2. I'd like to evaluate f[x,y] where x runs over the list l1 and y runs over the list l2, and I'd like to do it without having to make all pairs of the form {l1[[i]],l2[[j]]}. (Motivation: I'm trying to implement some basic Haskell programs in Mathematica. In particular, I'd like to be able…

  Read the article

• C++ assignment question [closed]

  - by Adam Joof

  (Bubble Sort) In the bubble sort algorithm, smaller values gradually "bubble" their way upward to the top of the array like air bubbles rising in water, while the larger values sink to the bottom. The bubble sort makes several passes through the array. On each pass, successive pairs of elements are compared. If a pair is in increasing order (or the…

  Read the article

• Creating a triple store query using SQL - how to find all triples that have a common predicate and o

  - by Ankur

  I have a database that acts like a triple store, except that it is just a simple MySQL database. I want to select all triples that have a common predicate and object. Info about RDF and triples I can't seem to work out the SQL. If I had just a single predicate and object to match I would do: select TRIPLE from TRIPLES where…

  Read the article

• Parsing a dynamic value with Lift-JSON

  - by Surya Suravarapu

  Let me explain this question with an example. If I have a JSON like the following: {"person1":{"name": "Name One", "address": {"street": "Some Street","city": "Some City"}}, "person2":{"name": "Name Two", "address": {"street": "Some Other Street","city": "Some Other City"}}} [There is no restriction on the…

  Read the article

• Matching process , issue with query

  - by Blerta Blerta

  i have this code which helps me match two different tables.. now, each of this tables, has a epos_id and a rbpos_id ! I have another table which has pairs of rbpos_id and epos_id, something like: id | epos_id | rbpos_id 1 a3566 465jd 2 hkiyb rbposi When i join this other table, i need to check this…

  Read the article

• Git Pull works; Git push fails

  - by Michael

  I thought I set up my key pairs correctly -- I can do git pulls. I can do git commits. But when I do a git push, it counts objects, decompresses, then says: fatal: the remote end hung up unexpectedly. What's the issue here? I'm a super user, so it's not folder writable / readable access problems -- it must be the…

  Read the article

• resizing arrays when close to memory capacity

  - by user548928

  So I am implementing my own hashtable in java, since the built in hashtable has ridiculous memory overhead per entry. I'm making an open-addressed table with a variant of quadratic hashing, which is backed internally by two arrays, one for keys and one for values. I don't have the ability to resize though. The…

  Read the article

• Is there an equivalent for the Zip function in Clojure Core or Contrib?

  - by John Kane

  In Clojure, I want to combine two lists to give a list of pairs, > (zip '(1 2 3) '(4 5 6)) ((1 4) (2 5) (3 6)) In Haskell or Ruby the function is called zip. Implementing it is not difficult, but I wanted to make sure I wasn't missing a function in Core or Contrib. There is a zip namespace in Core, but…

  Read the article

• Revisions: algorithm and data structure

  - by SODA

  Hi, I need ideas for structuring and processing data with revisions. For example, I have a database of objects (e.g. cars). Each object has a number of properties, which can be arbitrary, so there's no a set schema to describe these objects. These objects are probably saved as key-value pairs. Now I need to…

  Read the article

• Implement dictionary using java

  - by ahmad

  Task Dictionary ADT The dictionary ADT models a searchable collection of key-element entries Multiple items with the same key are allowed Applications: word-definition pairs Dictionary ADT methods: find(k): if the dictionary has an entry with key k, returns it, else, returns null findAll(k): returns an…

  Read the article

• Order database results by bayesian rating

  - by One Trick Pony

  I'm not sure this is even possible, but I need a confirmation before doing it the "ugly" way :) So, the "results" are posts inside a database which are stored like this: the posts table, which contains all the important stuff, like the ID, the title, the content the post meta table, which contains…

  Read the article

• How to roll my own index in c#?

  - by bill seacham

  I need a faster way to create an index file. The application generates pairs of items to be indexed. I currently add each pair as it is generated to a sorted dictionary and then write it out to a disk file. This works well until the number of items added exceeds one million, at which time it slows…

  Read the article

• Code Igniter - URL Rewrite

  - by André Alçada Padez

  Hey, i'm trying to get a project to work, but i am having trouble with the rewrite module. I'm running Wamp over Windows XP. I changed httpd.conf to change the root of localhost to: DocumentRoot "C:/wamp/www/project/docroot/" I have htaccess RewriteEngine On RewriteBase / my Apache has the…

  Read the article

• Drive space hungry NoSQL's databases

  - by forum_inquisitor

  I've tested NoSQL databases like CouchDB, MongoDB and Cassandra and observed tendence to absorbing very large amount of drive space relative to inserted key-value pairs. When comparing CouchDB and MySQL schemaless databases CouchDB is consuming much more drive space than MySQL. I know about…

  Read the article

• Split a map using Groovy

  - by Tihom

  I want to split up a map into an array of maps. For example, if there is a map with 25 key/value pairs. I want an array of maps with no more than 10 elements in each map. How would I do this in groovy? I have a solution which I am not excited about, is there better groovy version: …

  Read the article

• Efficient most common suffix algorithm?

  - by taw

  I have a few GBs worth of strings, and for every prefix I want to find 10 most common suffixes. Is there an efficient algorithm for that? An obvious solution would be: Store sorted list of <string, count> pairs. Identify by binary search extent for prefix we're searching. Find…

  Read the article

• C# Linq: Restructuring object

  - by Ben

  I'd like to take an object like this: SortedList<string, SortedList<int, SortedList<DateTime, double>>> Data and, for a given 'int' value (key of first nested sorted list), restructure it like this: SortedList<DateTime, SortedList<string, double>> …

  Read the article

• How to extract a couple marked strings from a line (python)

  - by GoJian

  My Friends, I spent quite some time on this one... but cannot yet figure out a better way to do it. I am coding in python, by the way. So, here is a line of text in a file I am working with, for example: "ref|ZP_01631227.1| 3-dehydroquinate synthase [Nodularia spumigena…

  Read the article

• Java, JavaCC: How to check if a char (or char pair) is inside a given UTF32 range?

  - by java.is.for.desktop

  Hello, everyone! I am referring to the XML 1.1 spec. Look at the definition of NameStartChar: NameStartChar ::= ":" | [A-Z] | "_" | [a-z] | [#xC0-#xD6] | [#xD8-#xF6] | [#xF8-#x2FF] | [#x370-#x37D] | [#x37F-#x1FFF] | [#x200C-#x200D] | [#x2070-#x218F] | [#x2C00-#x2FEF] |…

  Read the article

• Returning messages in Smalltalk

  - by Zachary

  I have a Dictionary of objects I have created in smalltalk, which I am iterating over by enumerating it based on the key/value pairs. For value object in the dictionary, I am calling a method on that object. Based on certain conditions, I would like for this object to…

  Read the article

• Ruby/RoR: calling original method via super()?

  - by fearless_fool

  In a RoR app, I want to specialize ActiveRecord's update_attributes() method in one of my models, extracting some of the attributes for special handling and passing the rest of them to the original update_attributes() method. The details: class Premise <…

  Read the article

• What Can A 'TreeDict' (Or Treemap) Be Used For In Practice?

  - by Seun Osewa

  I'm developing a 'TreeDict' class in Python. This is a basically a dict that allows you to retrieve its key-value pairs in sorted order, just like the Treemap collection class in Java. I've implemented some functionality based on the way unique indexes in…

  Read the article

• ASP.NET profile deletion

  - by Ben Aston

  We use the ASP.NET profile subsystem to associate key-value pairs of information with users. I am implementing functionality for the deletion of users. I have been using the ProfileManager.DeleteProfile(string userName) method, but I have noticed that…

  Read the article

• How to log POSTed forms submissions?

  - by justSteve

  Back in the ASP classic days when i needed to write out the name/value pairs of forms submitted by POST i thru this loop into the page: on error resume next for each x in Request.Form Response.AppendToLog x & "=" & Request(x) next It threw…

  Read the article

• What data structure would be the least painful DataTable replacement?

  - by MatthewMartin

  I'm storing a lot of sorted ~10 row 2 column/key value pairs in ASP.NET cache-- they're the data for dropdownlists. Right now they are all DataTables, which isn't very space efficient (the rule of thumb is 10x increase in size when data is strored in…

  Read the article

< Previous Page | 16 17 18 19 20 21 22 23 24 25 26 27  | Next Page >