Search Results

Search found 10804 results on 433 pages for 'attribute keys'.

Page 324/433 | < Previous Page | 320 321 322 323 324 325 326 327 328 329 330 331  | Next Page >

• Order a List (C#) by many fields?

  - by Esabe

  Hi everyone, I want to order a List of objects in C# by many fields, not just by one. For example, let's suppose I have a class called X with two Attributes, A and B, and I have the following objects, in that order: object1 = A = "a", B = "h" object2 = A = "a", B = "c" object3 = A = "b", B = "x" object4 = A = "b", B = "b" and I want to order the list by A attribute first, and when they are equals, by B element, so the order would be: "a" "c" "a" "h" "b" "b" "b" "x" As far as I know, the OrderBy method order by one parameter. Question: How can I order a C# List by more than one field? Thank you very much

  Read the article

• How to programatically access web sites that are blocked by my work?

  - by Gilbo

  I'm interested in creating a web application that will let me view sites that my work won't let me go to. I have a server where I can host it that I have access to from my work. I've had some success by using the method described in this article. Unfortunately any images and css (basically any html that has a "SRC" attribute) are still being blocked. Can anyone think of a better method to view work filtered sites? I don't want to change any proxy server settings on my machine.

  Read the article

• Why does set key not do anything in AES/SymmetricAlgorithm?

  - by acidzombie24

  This MESSED ME UP hard. I thought i was setting the key but i was not. No exceptions, nothing happen except bad results. Why is there a setter if everything is ignored and no exceptions are thrown when i attempt to write? What is the point of the setter on the Keys property? When i do the below Key value are not changed. After an hour when i realize what was happening i wrote the loop to verify. I also tried aes.Key[0] = val; var b = val == aes.Key[0]; (and messed with it in immediate mode). Why does it have this behavior? Array.Copy(myKey, aes.Key, aes.Key.Length); int i = 0; foreach (var v in aes.Key) { var b = myKey[i++] == v; if (!b) b = b; }

  Read the article

• Poll for pressed buttons in Java

  - by directedition

  I have a WorldWind application build based on the Java SDK. It has a great event handler for detecting when you click on objects, but I've run into a snag. While I can click on and select individual objects, I can't determine if the user is pressing the control key while they click (if they want to select multiple objects). I can implement event handlers for both the mouse and the keyboard, but I can't for the life of me figure out how to tie the two together. How could I make my mouse listener poll the system for a list of currently depressed keys?

  Read the article

• rails: Get a list of items tagged x AND y AND z

  - by egarcia

  I've got two models: item and tags. Both have a name attribute. I want to find items tagged with several tags. class Item < ActiveRecord::Base has_many :tags validates_presence_of :name end class Tag < ActiveRecord::Base belongs_to :item validates_presence_of :name end Given a list of tag ids, I can easily enough get the list of items tagged with one tag or the other: # Find the items tagged with one or more of the tags on tag_ids Item.all(:conditions => ['tags.id in (?)', tag_ids], :joins => :tags) If tag_ids is {1,4}, then I get all pictures tagged with 1, or 4, or both. I want to know now how to get the pictures that are tagged with both - 1 AND 4. I can't even imagine the SQL that is needed here.

  Read the article

• Rails valiation among a three model relationship

  - by Andrew

  I'm working on a three model relationship with one aspect that I'm not sure how to approach. Here's the basic relationship: class Taxonomy has_many :terms # attribute: `inclusive`, default => false end class Term belongs_to :taxonomy has_and_belongs_to_many :photos end class Photo has_and_belongs_to_many :terms end This is pretty straightforward stuff except for one thing: A Taxonomy can be either 'Inclusive' or 'Exclusive'. Exclusive means the terms are mutually exclusive, Inclusive means they're not. So, if a Taxonomy is exclusive ie. taxonomy.inclusive = false, then there can only be one term from that taxonomy attached to a given photo. Now, I can handle this on the client-side without a problem, but I am not quite sure how to set up a validation on Photos (or somewhere else) that says basically: "validate that no more than one term from an exclusive taxonomy is associated with this record." Any ideas on how to do that?

  Read the article

• Documentation for JavaScript Event Hanlders.

  - by The Rook

  I am looking for a list of all JavaScript event handlers (such as onLoad, onSubmit ect...) and the corresponding html tags that they can be applied to. This is is the best document I have found so far, but I believe it is is incomplete. The W3 specs are even worse, all it says is "This attribute may be used with most elements.". All browsers have their own quarks, if you know of a document for a specific browser like Firefox or IE that would also be helpful.

  Read the article

• jQuery variable iteration with .each()

  - by user1143357

  My code needs to capture the 'src' of an image in a variable. It then needs to insert this variable into a 'href' tag on a link which surrounds the image. My code is as follows: $('.fancybox-image-li img').each(function(test) { var test = $(this).attr("src"); $('.fancybox-image-link').attr('href', ''+test+''); }); Unfortunately what seems to be happening is the 'test' var is only getting the attribute of the last img and then inserting this into all the 'href' attributes. Any ideas how I can get the variable to change per image. Cheers!

  Read the article

• Calculate sum of objects for each unique object property in Ruby

  - by macek

  I was helping with an answer in this question and it sparked a question of my own. Pie is an object that has a pieces array made of of PiePiece objects. Each PiePiece has a flavor attribute How do I create a hash that looks like this: # flavor => number of pieces { :cherry => 3 :apple => 1 :strawberry => 2 } This works, but I think it could be improved def inventory hash = {} pieces.each do |p| hash[p.flavor] ||= 0 hash[p.flavor] += 1 end hash end Any ideas?

  Read the article

• Multiple row insertion in a faster way

  - by Cyborgo

  Hi, I am using rails and I am trying to insert new rows into the table. The data comes from a text file and I created hash with one of the attribute as key. Then I find all the keys that are currently not in the table. Then I need to insert all of them into the table with all the attributes that I saved in hash. newvals.each{ |x| author = Author.create(:first => x, :second => hash[x][0], :third => hash[x][1]) author.save } This has lot of overhead as it makes an SQL update one at time. The newals array is usually quite big around the size of 20-30k. I know create can insert multiple objects at once, but I cant seem to figure out how. Is there any way to get this done. Thanks.

  Read the article

• Becoming better at Vim

  - by Autopulated

  I've been using Vim for quite a long time, but I'm at a level where I use insert mode most of the time, and I still use the arrow keys to move around(!). I feel like I'm not getting the best out of my lovely editor, particularly regarding navigating (especially code), copy & pasting, and doing other manipulations of existing code. (though I am quite comfortable with complicated search/replace patterns). How should I go about learning more? What resources would people recommend?

  Read the article

• how to export a 2D table in java

  - by kate

  hello i would like to ask you about the 2D tables in java!!my code is this an i would like to make a system out in order t see the registrations in mytable citylink can anyone help me? int i=0; while(i<=citylink.length){ for(Xml polh_is:fetchsite.child("site").child("poleis").children("polh")){ //url if((polh_is.string("name")=="")||(polh_is.content()==""))//attribute error += "Error in polh: name is - " + polh_is.string("name") + " with url - " + polh_is.content() + " -.\n"; else for(int j=0; j<citylink.length; j++){ citylink[j][0]=HtmlMethods.removeBreaks(polh_is.string("name")); citylink[j][1]=HtmlMethods.removeBreaks(polh_is.string("with url -"+polh_is.content() +"-.\n")); i++; } }

  Read the article

• What is Registry Condition?

  - by serhio

  I have a setup project and I add some registry keys. Say I have a key ..\MyApplication\ServerIp key. When installing the second time I'd like that the ancient value will not be overridden. 1) What kind of "Condition" should I set in the setup properties of ServerIp registry key. 2) Is it possible to recuperate the ancient value from registry and display it in the "ServerIp" textBox in the installer dialog box? In this case the override could be unconditional.

  Read the article

• Visual C++ CreateThread Parameter Problem

  - by Vanwaril

  I have a class that contains a function that calls create thread, and needs to pass itself (this) as a parameter: DWORD threadId; HANDLE h = CreateThread( NULL, 0, runThread, this, 0, &threadId); My runThread definition is as follows: DWORD WINAPI runThread(LPVOID args) { Obj *t = (Obj*)args; t->funct(); return 0; } Unfortunately, the object t that I get in runThread() gets garbage. My Obj class has a function pointer attribute. Could that be the problem? class Obj{ void(*funct)(); and in the constructor: Obj(void(*f)()) { funct = f; } where is my mistake? The function pointer, the createThread itself, or type-casting? I tried whatever I could think of.

  Read the article

• Physical storage of data in Access 2007

  - by ste

  I've been trying to estimate the size of an Access table with a certain number of records. It has 4 Longs (4 bytes each), and a Currency (8 bytes). In theory: 1 Record = 24 bytes, 500,000 = ~11.5MB However, the accdb file (even after compacting) increases by almost 30MB (~61 bytes per record). A few extra bytes for padding wouldn't be so bad, but 2.5X seems a bit excessive - even for Microsoft bloat. What's with the discrepancy? The four longs are compound keys, would that matter?

  Read the article

• Redirect to hash URL

  - by r1987

  I'm building a site with a hashchange on wordpress, all working good. It just loads a single.php template file into a div. The problem is that i can still access my single url (http://www.mydomain.com/my-single-post). Since its not having any head and style tags with it, i don't want people to go over there. Also google has picked up the direct links, because I use the href attribute to load content into the div. So my question is: If someone clicks a link lets say in a forum, http://www.mydomain.com/my-single-post , is it possible to redirect him instantly to http://www.mydomain.com/#my-single-post ? I have researched that it has something to do with .htaccess, but I also have Pages, where i don't want the hash infront of the page-name.

  Read the article

• Import external dll based on 64bit or 32bit OS

  - by Mike_G

  I have a dll that comes in both 32bit and 64bit version. My .NET WinForm is configured for "Any CPU" and my boss will not let us have separate installs for the different OS versions. So I am wondering: if I package both dlls in the install, then is there a way to have the WinForm determine if its 64bit/32bit and load the proper dll. I found this article for determining version. But i am not sure how to inject the proper way to define the DLLImport attribute on the methods i wish to use. Any ideas?

  Read the article

• Force an array to recalcuate length after sort

  - by Rhyono

  If you take an array and do the following: arr = []; arr[100] = 1; The length will be 101, which makes sense due to 0-99 being set as undefined Now if we sort that array: arr.sort() it will look like this: [1, undefined x100] since keys are not preserved. However, the length is still 101, since the undefined have all been moved to the end, instead of removed. Is this behavior intentional and if so: is there a built-in function that removes undefined and recalculates and why is it intentional? I am not asking how to write my own function to recalculate length. A sorted array's length can easily be forced with for (x = 0; arr[x] != undefined; x++);arr.length = x;

  Read the article

• jQuery Nested Droppables

  - by John

  I have a nested set of jQuery droppables...one outer droppable that encompasses most of the page and an a set of nested inner droppables on the page. The functionality I want is: If a draggable is dropped outside of any of the inner droppables it should be accepted by the outer droppable. If a draggable is dropped onto any of the inner droppables it should NOT be accepted by the outer droppable, regardless of whether the inner droppable accepts the draggable. So that would be easy if I could guarantee 1+ inner droppables would accept the draggable, because the greedy attribute would make sure it would only get triggered once. Unfortunately the majority of the time the inner droppable will also reject the draggable, meaning the greedy option doesn't really help. Summary: The basic functionality is a set of valid/invalid inner droppables to accept the draggable, but when you toss the draggable outside any of the draggables it gets destroyed by the outer droppable. What's the best way of doing this?

  Read the article

• [Android] Returning to a ListView with a text filter

  - by sosiouxme

  I enabled text filtering on my ListView in the expected way; adding android:textFilterEnabled=”true” in resource definition and (as I'm using a SimpleCursorAdapter) setting a FilterQueryProvider that provides a filtered cursor like so: public Cursor runQuery(CharSequence constraint) { Cursor cur = mDba.fetchTrackers(mCurrentGroupId, constraint.toString()); startManagingCursor(cur); return cur; } My question is this: once the user selects a list item, goes off to another activity, and returns to this one, how can I control the state of the filter previously applied? What I'm seeing right now is that when I return to the activity, the cursor being used is the unfiltered one set on the filter at creation, but the filter text they typed is still shown (and typing keys causes the filter to be applied). What I'd like to do is either clear the filter, or keep the filtered cursor that the activity was left with.

  Read the article

• mod_rewrite: no ? and # in REQUEST_URI

  - by tshabala

  Hello. What I'm trying to do: have pretty URLs in the format 'http://domain.tld/one/two/three', that get handled by a PHP script (index.php) by looking at the REQUEST_URI server variable. In my example, the REQUEST_URI would be '/one/two/three'. (Btw., is this a good idea in general?) I'm using Apache's mod_rewrite to achieve that. Here's the RewriteRule I use in my .htaccess: RewriteRule ^/?([a-zA-Z/]+)/?$ /index.php [NC,L] This works really well thus far; it forwards every REQUEST_URI that consists of a-z, A-Z or a '/' to /index.php, where it is processed. Only drawback: '?' (question marks) and '#' (hash keys) seem to still be allowed in the REQUEST_URI, maybe even more characters that I've yet to find. Is it possible to restrict those via my .htaccess and an adequate addition to the RewriteRule? Thanks!

  Read the article

• jQuery ajax get

  - by Happy

  There are many class="item" blocks on the page. For each one there is different var item_link and ajax request. Ajax searches for src attribute of .message img and throws it to var src. $(".item").each(function(){ var item_link = "http://..."; $(this).prepend('<div class="src"></div>'); $.get(item_link, function(data) { var src = $('.message img', data).attr('src'); }); }); How to print var src to <div class="src"></div>? Thanks.

  Read the article

• Python finding index in a array

  - by NIH

  I am trying to see if a company from a list of companies is in a line in a file. If it is I utilize the index of that company to increment a variable in another array. The following is my python code. I keep getting the following error: AttributeError: 'set' object has no attribute 'index'. I cannot figure out what is going wrong and think the error is the line that is surrounded by **. companies={'white house black market', 'macy','nordstrom','filene','walmart'} positives=[0 for x in xrange(len(companies))] negatives=[0 for x in xrange(len(companies))] for line in f: for company in companies: if company in line.lower(): words=tokenize.word_tokenize(line) bag=bag_of_words(words) classif=classifier.classify(bag) if classif=='pos': **indice =companies.index(company)** positives[indice]+=1 elif classif=='neg': **indice =companies.index(company)** negatives[indice]+=1

  Read the article

• How to sort a hash by value in descending order and output a hash in ruby?

  - by tipsywacky

  output.sort_by {|k, v| v}.reverse and for keys h = {"a"=>1, "c"=>3, "b"=>2, "d"=>4} => {"a"=>1, "c"=>3, "b"=>2, "d"=>4} Hash[h.sort] Right now I have these two. But I'm trying to sort hash in descending order by value so that it will return => {"d"=>4, "c"=>3, "b"=>2, "a"=>1 } Thanks in advance. Edit: let me post the whole code. def count_words(str) # YOUR CODE HERE output = Hash.new(0) sentence = str.gsub(/,/, "").gsub(/'/,"").gsub(/-/, "").downcase words = sentence.split() words.each do |item| output[item] += 1 end puts Hash[output.sort_by{ |_, v| -v }] return Hash[output.sort_by{|k, v| v}.reverse] end

  Read the article

• C#: Resource file refactoring

  - by Svish

  Does anyone know of a good tool for refactoring resources in a visual studio 2008 solution? We have a number of resource files with translated text in an assembly used for localizing our application. But they have gotten a bit messy... I would like to rename some of the keys, and move some of them into other resource files. And I would like those changes be done in my code, and the translated versions of the resource files as well. Maybe a some analysis on what strings are missing in the translated versions, and what strings have been removed from the original as well... Does anyone know of a good visual studio extension or ReSharper plugin that can help me with this? Right now it is kind of a pain, because I have to first rename the key in the base resource file, then in the localized versions. And then compile to get all the compile errors resulting from the key which now have a different name, and then go through and fix them all... very annoying =/

  Read the article

< Previous Page | 320 321 322 323 324 325 326 327 328 329 330 331  | Next Page >