Search Results

Search found 31743 results on 1270 pages for 'list comprehension'.

Page 138/1270 | < Previous Page | 134 135 136 137 138 139 140 141 142 143 144 145  | Next Page >

  • rearranging a list of months

    - by MacUsers
    How can I list the numbers 01 to 12 (one for each of the 12 months) in such a way so that the current month always comes last where the oldest one is first. In other words, if the number is grater than the current month, it's from the previous year. e.g. 02 is Feb, 2011 (the current month right now), 03 is March, 2010 and 09 is Sep, 2010 but 01 is Jan, 2011. In this case, I'd like to have [09, 03, 01, 02]. This is what I'm doing to determine the year: for inFile in os.listdir('.'): if inFile.isdigit(): month = months[int(inFile)] if int(inFile) <= int(strftime("%m")): year = strftime("%Y") else: year = int(strftime("%Y"))-1 mnYear = month + ", " + str(year) I don't have a clue what to do next. What should I do here?

    Read the article

  • Customized bulleted list items in ASP.NET

    - by sudarsanyes
    Hi, I am just a beginner in ASP.NET. My question is simple, I wanna add list items dynamically from the code behind file and I want each item to have a text and couple of images as hyperlinks. The HTML sample should be like, <ul> <li>do foo &nbsp;<a href="#"><img src="some_image.png" /></a></li> <li>do bar &nbsp;<a href="#"><img src="some_image.png" /></a></li> ... </ul> The number of items is dependent on the collection retrieved by the code behind file. P.S. my code behind file is written in C#

    Read the article

  • Inheriting from List<T> in .NET (vb or C#)

    - by Tony
    I have been delved in C++ world for a while, but now I'm in .NET world again, VB and C# and I wondered if you have a class that represents a collection of something, and you want the ability to use this in a foreach loop, etc... is it better to implement IEnumerable and IEnumerator yourself or should you inherit from the List<T> where T is the object type in it's singular form? I know in C++ for example, inheriting from a container is considered a bad idea. But what about .NET.

    Read the article

  • How to OrderBy on a generic IEnumerable (IEnumerable<T>) using LINQ in C#?

    - by Jeffrey
    In my generic repository I have below method: public virtual IEnumerable<T> GetAll<T>() where T : class { using (var ctx = new DataContext()) { ctx.ObjectTrackingEnabled = false; var table = ctx.GetTable<T>().ToList().AsReadOnly(); return table; } } T is a Linq to Sql class and I want to be able to OrderBy on a particular property. Say if T has property name "SortOrder" then do OrderBy on this property. But I am not sure how I can achieve this. So I need some helps. Thank you!

    Read the article

  • How to customize the Combobox dropdown list?

    - by lp
    I have created a Combo box using HIComboBoxCreate(). When I have a long string in the dropdown list, it goes beyond the screen and the starting of the string is not visible. I want the string to be truncated with ellipsis in such a case. I have looked into the ComboBox attributes but couldn't find any that I can use to set this. I'm ready to write some extra code to do this, but I'm not sure if it possible. Can someone please help?

    Read the article

  • Looking for an array (vs linked list) hashtable implementation in C

    - by kingusiu
    hi, I'm looking for a hashtable implementation in C that stores its objects in (twodimensional) arrays rather than linked lists. i.e. if a collision happens, the object that is causing the collision will be stored in the next free row index rather than pushed to the head and first element of a linked list. plus, the objects themselves must be copied to the hashtable, rather than referenced by pointers. (the objects do not live for the whole lifetime of the program but the table does). I know that such an implementation might have serious efficiency drawbacks and is not the "standard way of hashing" but as I work on a very special system-architecture i need those characteristics. thanks

    Read the article

  • looping thru a list of checkboxes and saving the values, now working properly

    - by Erez
    Hello all, I'm having a bit of a problem with this code. The program gives me a list of checkboxes but a user ID. then u user can change his selection and push the save button (id="btnSaveUserIntersts") and i am trying to save in the hidden textbox all the values of the checkboxes that was choosen. The problem is that i am getting all the time the same selections that came form the database and not getting the new selection that the user made. Can any one tell me what am i doing wrong here? $(document).ready( function() { $('#btnSaveUserIntersts').bind( 'click', function() { var strCheckBoxChecked = new String(); $('input[type=checkbox][checked]').each( function() { strCheckBoxChecked += $(this).val(); strCheckBoxChecked += ','; } ); $('#hidUserInterests').val(strCheckBoxChecked); } ); } ); 10x

    Read the article

  • list all functions on CRAN

    - by baptiste
    Suppose I'm trying to run a script of unknown origin, and one of the functions is from a package that is not loaded by the script (an oversight, maybe it was loaded in the .Rprofile of the person who wrote it). How can I find in which package this function resides? There's some information compiled on CRAN, that doesn't require the user to download/install all R packages locally; however as far as I could tell it only gives access to the DESCRIPTION files. RSiteSearch, and its web equivalent, seem to access an online database of all CRAN packages, where presumably a list of all functions would be available. Is there some way of accessing this information? Thanks. Edit: I know sos::findFn, utils::RSiteSearch and search.r-project; what I would like is to get the raw data that these tools use.

    Read the article

  • Python lxml - returns null list

    - by Chris Finlayson
    I cannot figure out what is wrong with the XPATH when trying to extract a value from a webpage table. The method seems correct as I can extract the page title and other attributes, but I cannot extract the third value, it always returns an empty list? from lxml import html import requests test_url = 'SC312226' page = ('https://www.opencompany.co.uk/company/'+test_url) print 'Now searching URL: '+page data = requests.get(page) tree = html.fromstring(data.text) print tree.xpath('//title/text()') # Get page title print tree.xpath('//a/@href') # Get href attribute of all links print tree.xpath('//*[@id="financial"]/table/tbody/tr/td[1]/table/tbody/tr[2]/td[1]/div[2]/text()') Unless i'm missing something, it would appear the XPATH is correct: Chrome screenshot I checked Chrome console, appears ok! So i'm at a loss $x ('//*[@id="financial"]/table/tbody/tr/td[1]/table/tbody/tr[2]/td[1]/div[2]/text()') [ "£432,272" ]

    Read the article

  • How to save an order (permutation) in an sql db

    - by Bendlas
    I have a tree structure in an sql table like so: CREATE TABLE containers ( container_id serial NOT NULL PRIMARY KEY, parent integer REFERENCES containers (container_id)) Now i want to define an ordering between nodes with the same parent. I Have thought of adding a node_index column, to ORDER BY, but that seem suboptimal, since that involves modifying the index of a lot of nodes when modifying the stucture. That could include adding, removing, reordering or moving nodes from some subtree to another. Is there a sql datatype for an ordered sequence, or an efficient way to emulate one? Doesn't need to be fully standard sql, I just need a solution for mssql and hopefully postgresql EDIT To make it clear, the ordering is arbitrary. Actually, the user will be able to drag'n'drop tree nodes in the GUI

    Read the article

  • insert into table where if not in list

    - by jim smith
    Can anybody help me with the syntax? insert into history (company,partnumber,price) values ('blah','IFS0090','0.00') if company NOT IN ('blah','blah2','blah3','blah4','blah4') and partnumber='IFS0090'; Background: I have a history table which stores daily company, products and prices. But sometimes a company will remove itself for a few days. Complicating the issue is because I'm only saving daily CHANGES to prices only and not snapshotting the entire days list (the data would be huge) when I display the data the company will still come up for the previous days price. So I need to do something like this, where a 0.00 price means they're no longer there.

    Read the article

  • Recurssion Question : Revision

    - by stan
    My slides say that A recurssive call should always be on a smaller data structure than the current one There must be a non recurssive option if the data structure is too small You need a wrapper method to make the recurssive method accessible Just reading this from the slides makes no sence, especially seeing as it was a topic from before christmas! Could anyone try and clear up what it means please? Thank you

    Read the article

  • List of uninteresting words

    - by Hooked
    [Caveat] This is not directly a programing question, but it is something that comes up so often in language processing that I'm sure it's of some use to the community. Does anyone have a good list of uninteresting (English) words that have been tested by more then a casual look? This would include all prepositions, conjunctions, etc... words that may have semantic meaning, but are often frequent in every sentence, regardless of the subject. I've built my own lists from time to time for personal projects but they've been ad-hoc; I continuously add words that I forgotten as they come in.

    Read the article

  • Automatically change div on mouseover and on timer

    - by IrishSaffa
    I'm a bit o a noob so any help would be great... What I need to do is have it so that the div associated to a specific li can change on hover as well as automatically change on a timer so that it scrolls through the option. here is my code: <script type="text/javascript"> $(function () { $("#switches li").mouseover(function () { var $this = $(this); $("#slides div").hide(); $("#slide" + $this.attr("id").replace(/switch/, "")).show(); }); }); </script> <div id="featured"> <ul id="switches"> <li id="switch1"><a href="activity_spa.html">Spa &amp; Wellness</a></li> <li id="switch2"><a href="#">Gala Venues</a></li> <li id="switch3"><a href="#">Dining</a></li> <li id="switch4"><a href="#">Shopping</a></li> <li id="switch5"><a href="#">Golf</a></li> <li id="switch6"><a href="#">Team Building</a></li> <li id="switch7"><a href="#">Equestrian</a></li> </ul> <div id="slides"> <div id="slide1"><img src="images/image2.jpg" alt="" /></div> <div id="slide2" style="display:none;"><img src="images/image6.jpg" alt="" /></div> <div id="slide3" style="display:none;"><img src="images/image1.jpg" alt="" /></div> <div id="slide4" style="display:none;"><img src="images/image3.jpg" alt="" /></div> <div id="slide5" style="display:none;"><img src="images/image5.jpg" alt="" /></div> <div id="slide6" style="display:none;"><img src="images/image7.jpg" alt="" /></div> <div id="slide7" style="display:none;"><img src="images/image4.jpg" alt="" /></div> </div> </div>

    Read the article

  • Is the method that I am using for retrieval in my generic list optimized

    - by fishhead
    At some time there will be a large amount of records, about 50,000. with that in mind is the method GetEquipmentRecord up to the task. thanks for you opinions. public enum EquipShift { day, night }; public class EquipStatusList : List<EquipStatus> { string SerialFormat = "yyyyMMdd"; int _EquipmentID; string _DateSerial; EquipShift _Shift; public EquipStatus GetEquipmentRecord(int equipmentID, EquipShift shift, DateTime date) { _DateSerial = date.ToString(SerialFormat); _Shift = shift; _EquipmentID = equipmentID; return this.Find(checkforEquipRecord); } bool checkforEquipRecord(EquipStatus equip) { if ((equip.EquipmentID == _EquipmentID) && (equip.Shift == _Shift) && (equip.Date.ToString(SerialFormat) == _DateSerial)) return true; else return false; } }

    Read the article

  • Reason for unintuitive UnboundLocalError behaviour 2

    - by Jonathan
    Following up on Reason for unintuitive UnboundLocalError behaviour (I will assume you've read it). Consider the following Python script: def f(): # a+=1 # 1 aa=a aa+=1 # b+='b' # 2 bb=b bb+='b' c[0]+='c' # 3 c.append('c') cc=c cc.append('c') # 4 a=1 b='b' c=['c'] f() print a print b print c The result of the script is: 1 b ['cc', 'c', 'c'] The commented out lines (marked 1,2) are lines that would through an UnboundLocalError and the SO question I referenced explains why. However, the line marked 3 works! By default, lists are copied by reference in Python, therefore it's understandable that c changes when cc changes. But why should Python allow c to change in the first place, if it didn't allow changes to a and b directly from the method's scope? I don't see how the fact that by default lists are copied by reference in Python should make this design decision inconsistent. What am I missing folks?

    Read the article

  • How to know the type of an object in a list?

    - by nacho4d
    Hi, I want to know the type of object (or type) I have in my list so I wrote this: void **list; //list of references list = new void * [2]; Foo foo = Foo(); const char *not_table [] = {"tf", "ft", 0 }; list[0] = &foo; list[1] = not_table; if (dynamic_cast<LogicProcessor*>(list[0])) { //ERROR here ;( printf("Foo was found\n"); } if (dynamic_cast<char*> (list[0])) { //ERROR here ;( printf("char was found\n"); } but I get : error: cannot dynamic_cast '* list' (of type 'void*') to type 'class Foo*' (source is not a pointer to class) error: cannot dynamic_cast '* list' (of type 'void*') to type 'char*' (target is not pointer or reference to class) Why is this? what I am doing wrong here? Is dynamic_cast what I should use here? Thanks in advance EDIT: I know above code is much like plain C and surely sucks from the C++ point of view but is just I have the following situation and I was trying something before really implementing it: I have two arrays of length n but both arrays will never have an object at the same index. Hence, or I have array1[i]!=NULL or array2[i]!=NULL. This is obviously a waste of memory so I thought everything would be solved if I could have both kind of objects in a single array of length n. I am looking something like Cocoa's (Objective-C) NSArray where you don't care about the type of the object to be put in. Not knowing the type of the object is not a problem since you can use other method to get the class of a certain later. Is there something like it in c++ (preferably not third party C++ libraries) ? Thanks in advance ;)

    Read the article

  • Tidying up a list

    - by Jonas
    I'm fairly sure there should be an elegant solution to this (in Matlab), but I just can't think of it right now. I have a list with [classIndex, start, end], and I want to collapse consecutive class indices into one group like so: This 1 1 40 2 46 53 2 55 55 2 57 64 2 67 67 3 68 91 1 94 107 Should turn into this 1 1 40 2 46 67 3 68 91 1 94 107 How do I do that? EDIT Never mind, I think I got it - it's almost like fmarc's solution, but gets the indices right a=[ 1 1 40 2 46 53 2 55 55 2 57 64 2 67 67 3 68 91 1 94 107]; d = diff(a(:,1)); startIdx = logical([1;d]); endIdx = logical([d;1]); b = [a(startIdx,1),a(startIdx,2),a(endIdx,3)];

    Read the article

  • how to change picture using drop down list ?

    - by garcon1986
    Hello, I want to use a drop down list, every time i click the content in it, different pictures will show up. But i don't want to use the property 'value', because i want to use the values for other use. Example: <select name='test'> <option value='1'>1</option> <option value='2'>2</option> <option value='3'>3</option> <option value='4'>4</option> </select> How do i accomplish that? Thanks.

    Read the article

  • Cadr of a list involving assoc function

    - by user3619045
    I have looked around on the net and cant find an answer to my query. I would really appreciate if someone could provide a good answer without down rating this post. In Lisp car, cdr are used on data mode like '(whatever here) which makes sense to me. Now, in the book Land of Lisp the author is explaining how to build a text engine and suddenly he uses the following description to make a function. (defun describe-location (location nodes) (cadr (assoc location nodes))) Can I ask why is he doing a cadr on a list and how come it provides a response and not an error? shouldn't it be a data mode i.e with a quote in front of the opening bracket '(whatever here)? and also why is he using assoc as in (assoc location nodes) and not (assoc 'garden *nodes*) Isn't the second correct way to use assoc ? I may be missing the big picture and as such would really appreciate someone explaining these key points please. Many thanks!

    Read the article

  • C#, Using Custom Generic Collection faster with objects than List

    - by Kaminari
    Hello, I'm using for now List< to iterate through some object collection and find matching element, The problem is that object has only 2 significant values Name and Link (strings) but has some other values wich I dont want to compare. I'm thinkig about using something like HashSet (wich is exactly what I'm searching for - fast) from .NET 3.5 but target framework has to be 2.0. There is something called Power Collections here: http://powercollections.codeplex.com/ But maybe there is other way? If not, can you suggest me a suitable custom collection?

    Read the article

  • JQuery jCarousel - Disabling external controls

    - by user287212
    I'm using JQuery and jcarousel, using external navigation controls: http://sorgalla.com/projects/jcarousel/examples/static_controls.html The problem here is the navigation buttons no longer disable as shown here: sorgalla.com/projects/jcarousel/examples/static_simple.html Is there a callback I can use to allow me to swap the active image of a button with an inactive image?

    Read the article

  • Data structure name: combination array/linked list

    - by me_and
    I have come up with a data structure that combines some of the advantages of linked lists with some of the advantages of fixed-size arrays. It seems very obvious to me, and so I'd expect someone to have thought of it and named it already. Does anyone know what this is called: Take a small fixed-size array. If the number of elements you want to put in your array is greater than the size of the array, add a new array and whatever pointers you like between the old and the new. Thus you have: Static array ————————————————————————— |1|2|3|4|5|6|7|8|9|a|b|c| ————————————————————————— Linked list ———— ———— ———— ———— ———— |1|*->|2|*->|3|*->|4|*->|5|*->NULL ———— ———— ———— ———— ———— My thing: ———————————— ———————————— |1|2|3|4|5|*->|6|7|8|9|a|*->NULL ———————————— ————————————

    Read the article

  • Getting list of key values from app config with same name

    - by NoviceMe
    I have follwing in app.config file: <appSettings> <add key="Name" value="Office"/> ... <add key="Name" value="HotSpot"/> ... <add key="Name" value="Home"/> </appSettings> I tried ConfigurationManager.AppSettings["Name"] But it only gives me one Value? How can i get list of all values? I am using c# 3.5. Is there lambda expression or something i can use to get that?

    Read the article

< Previous Page | 134 135 136 137 138 139 140 141 142 143 144 145  | Next Page >