Search Results

Search found 33439 results on 1338 pages for 'distribution list'.

Page 80/1338 | < Previous Page | 76 77 78 79 80 81 82 83 84 85 86 87  | Next Page >

  • Are these libraries okay to distribute with my C# application?

    - by HoNgOuRu
    I included these libraries or namespaces in my C# application and published the solution as freeware. I used Visual C# Express 2008. using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Windows.Forms; using System.Media; using System.Management; using System.Diagnostics; using System.Runtime.InteropServices; using System.Drawing.Text; Is it okay to give the application as freeware or am I violating any license here???

    Read the article

  • !Contains() of List object doesnt work

    - by Tony
    I am using Contains() to identify something that NOT contain in the list. So something like, if(!list.Contains(MyObject)) { //do something } but, the whole if statment goes to true even though MyObject is already in the list. Anybody what I am doing wrong? Thank you

    Read the article

  • cakePHP: Filter selected list by variable

    - by gonzela2006
    I'm on cakePHP 2. I have a problem and I need your help. Here is some code of my controller(StudentsController.php) specifically "edit" function: $students = $this -> Student -> find('list', array( 'order' => 'Student.name ASC' )); $this -> set('students', $students); How can I filter the list by the current student's class?? so the list will contain all students that has the same student's class I need some code like this $students = $this -> Student -> find('list', array( 'conditions' => array('Student.class_id' => CURRENT-STUDENT'S-CLASS), 'order' => 'Student.name ASC' )); $this -> set('students', $students); Please Advise Thanks, gonzela2006

    Read the article

  • What Database to distribute as part of a C# app backend

    - by jez
    I am planning on writing and commercialising a C# app which will store data in an underlying database I use MySQL on my environment for my own development and this is what I would have used to write the application for myself (no need to use FK - MyISAM engine would be fine). I am concerned about how easy it will be to distribute the app together with the database engine. Would using MySQL allow me for easy packaging of the app for a "one-click" install on the client side? (ie I do not want them to have to install MySQL by themselves) and also is it feasible from a licensing point of view? Are there other Database systems which would make the process more straight-forward

    Read the article

  • How does PHP's list function work?

    - by Jacob Relkin
    After recently answering a couple of questions here on SO that involved utilizing PHP's list function, I wondered, "how in the world does that function actually work under the hood?". I was thinking about something like using func_get_args() and then iterating through the argument list, and that's all nice and peachy, but then how in the world does the assignment part work? list(...) = array($x, $y, $z); isn't this ^ evaluated first? So to be precise, my question is how is the list function able to create scoped variables which get assigned to the not-yet evaluated array?

    Read the article

  • Combine Lists with Same Heads in a 2D List (OCaml)

    - by Atticus
    Hi guys, I'm working with a list of lists in OCaml, and I'm trying to write a function that combines all of the lists that share the same head. This is what I have so far, and I make use of the List.hd built-in function, but not surprisingly, I'm getting the failure "hd" error: let rec combineSameHead list nlist = match list with | [] -> []@nlist | h::t -> if List.hd h = List.hd (List.hd t) then combineSameHead t nlist@uniq(h@(List.hd t)) else combineSameHead t nlist@h;; So for example, if I have this list: [[Sentence; Quiet]; [Sentence; Grunt]; [Sentence; Shout]] I want to combine it into: [[Sentence; Quiet; Grunt; Shout]] The function uniq I wrote just removes all duplicates within a list. Please let me know how I would go about completing this. Thanks in advance!

    Read the article

  • SQL query to translate a list of numbers matched against several ranges, to a list of values

    - by Claes Mogren
    I need to convert a list of numbers that fall within certain ranges into a list of values, ordered by a priority column. The table has the following values: | YEAR | R_MIN | R_MAX | VAL | PRIO | ------------------------------------ 2010 18000 90100 52 6 2010 240000 240099 82 3 2010 250000 259999 50 5 2010 260000 260010 92 1 2010 330000 330010 73 4 2010 330011 370020 50 5 2010 380000 380050 84 2 The ranges will be different for different years. The ranges within one year will never overlap. The input will be a year and a list of numbers that might fall within one these ranges. The list of input number will be small, 1 to 10 numbers. Example of input numbers: (20000, 240004, 375000, 255000) With that input I would like to get a list ordered by the priority column, or a single value: 82 50 52 The only value I'm interested in here is 82, so UNIQUE and MAX_RESULTS=1 would do. It can easily be done with one query per number, and then sorting it in the Java code, but I would prefer to do it in a single SQL query. What SQL query, to be run in an Oracle database, would give me the desired result?

    Read the article

  • Using rendrer in list in flex

    - by Anshuman Jaiswal
    Hi all I am using list component in flex & using custom itemRenderer i.e I have made a component named frameRenrer(there are two controls ImageControl and label control) where I set the image source and label text on creationComplete event.And I providing the data using dataProvider function in List component.But actually problem is that when I scroll this list only 4 items are displayed repeatedly and to check it I make a function on mouseOver of image control in this I am using Alert.show(data.label); then it shows the correct data but it is not displayed in the list.In data provider I am using ArrayCollection. What is the problem anyone????

    Read the article

  • LINQ Equivalent query

    - by GilliVilla
    I have a List<string> List<string> students; students.Add("123Rob"); students.Add("234Schulz"); and a Dictionary<string,string> Dictionary<string, string> courses = new Dictionary<string, string>(); courses .Add("Rob", "Chemistry"); courses .Add("Bob", "Math"); courses .Add("Holly", "Physics"); courses .Add("Schulz", "Botany"); My objective now is to get a List with the values - {Chemistry,Botany} . In other words, I am trying to get the LINQ equivalent of select value from [courses] where [courses].key in ( select [courses].key from courses,students where [students].id LIKE '%courses.key%' ) How should the LINQ query be framed?

    Read the article

  • Scala 2.8.1 implicitly convert to java.util.List<java.util.Map<String, Object>>

    - by Ralph
    I have a Scala data structure created with the following: List(Map[String, Anyref]("a" -> someFoo, "b" -> someBar)) I would like to implicitly convert it (using scala.collection.JavaConversions or scala.collection.JavaConverters) to a java.util.List<java.util.Map<String, Object>> to be passed the a Java method that expects the latter. Is this possible? I have already created the following method that does it, but was wondering if it can be done automatically by the compiler? import scala.collection.JavaConversions._ def convertToJava(listOfMaps: List[Map[String, AnyRef]]): java.util.List[java.util.Map[String, Object]] = { asJavaList(listOfMaps.map(asJavaMap(_))) }

    Read the article

  • Organizing a random list of objects in Python.

    - by Saebin
    So I have a list that I want to convert to a list that contains a list for each group of objects. ie ['objA.attr1', 'objC', 'objA.attr55', 'objB.attr4'] would return [['objA.attr1', 'objA.attr55'], ['objC'], ['objB.attr4']] currently this is what I use: givenList = ['a.attr1', 'b', 'a.attr55', 'c.attr4'] trgList = [] objNames = [] for val in givenList: obj = val.split('.')[0] if obj in objNames: id = objNames.index(obj) trgList[id].append(val) else: objNames.append(obj) trgList.append([val]) #print trgList It seems to run a decent speed when the original list has around 100,000 ids... but I am curious if there is a better way to do this. Order of the objects or attributes does not matter. Any ideas?

    Read the article

  • In JSF, how to handle repeating over a list that mutates

    - by Jon
    Hello, In a JSF page, I am iterating over a list of items provided by a session-scoped backing bean. The list needs to be kept up-to-date, so it is replaced with a fresh list every X minutes by a thread (in a thread-safe way). On my page, for each item I provide some text inputs and an "Update" button. If the list is refreshed before I hit "Update", the update does not happen (which is my problem). I happen to be using a4j:repeat, but I think this could also apply to other methods of iteration, including using dataTables. Any thoughts on how I can do this in a non-hackish way? Thanks!

    Read the article

  • List overwriting data on all positions

    - by elvispt
    I created a class with 3 fields: class Gente { int _ID; string _nome, _sexo; public Gente() { _ID = 0; _nome = ""; _sexo = ""; } public int ID { set { _ID = value; } get { return _ID; } } public string Nome { set { _nome = value; } get { return _nome; } } public string Sexo { set { _sexo = value; } get { return _sexo; } } } Then I declared a List from that class and an object from that class so that I can be able to add to the List. List<Gente> Alunos = new List<Gente>(); Gente professor = new Gente(); The first time I do the Alunos.Add(professor); to the list it correctly sends the information to the 0 position. But when I do it second time it overwrites everything on position 0 with the new data besides adding the new data to a new position, 1.

    Read the article

  • how to solve nested list programs [closed]

    - by riya
    write a function to get most popular car that accepts a car detail as input and returns the most popular car name along with its average rating .Each element of car details list is a sublist that provides the below information about a car (a)name of a car(b)car price (c) list of ratings obtained by car from various agencies.Incase two cars have the same average rating then the car with the lesser price qualifies as most popular car? here's my solution-: (define-struct cardetails ("name" price list of '(ratings)) (define car1 (make-cardetails "toyota" 123 '( 1 2 3))) (define car2 (make-cardetails "santro" 321 '( 2 2 3))) (define car3 (make-cardetails "toyota" 100 '( 1 2 3))) (define cardetailslist(list(car1) (car2)(car 3))) (let loop ((count 0)) (let (len (length cardetailslist)) (if(< count len) (string-ref (string-ref n)0) now please tell me how to find maximum average and display car name.it's not a homework question tomorrow is my test and we have not been taught this concept in class although it is very important from test point of view

    Read the article

  • Redirect Entry form in SharePoint back to itself once entry submitted?

    - by Marius
    The issue I have is that people in my group are using a link to an Entry Form to post new itmes to a SharePoint list. Everytime they click 'submit' to post new item, SharPoint redirects them to the list. I need a solution for SharePoint to direct them to the empty Entry form instead, no matter how many times they need to use it. Is there such solution? Thanks, I already have this "/EntryForm.aspx?Source=http://" in the link to the Entry form, but works only 2 times, after that will direct to the list.

    Read the article

  • Merge two lists of objects which hold different data

    - by C.McAtackney
    I have an object "Project" which has a number of fields, one of which is "Name". I have one spreadsheet of projects which contains some of these fields, and another which contains the rest. However, Both spreadsheets have the "Name" field. I've read them in and populated two List, only populating the available fields from that particular source. E.g. a Project from List 1 looks like; {Name="MyProj", Type="Form", Priority=NULL}, whereas a Project from List 2 {Name="MyProj", Type=NULL, Priority="High"}. Now, I want to merge these two lists into one in which each Project object has all of its fields populated, with the Name field being used to match the elements. How can I achieve this? Are there any nice ways of doing this concisely? Thanks

    Read the article

  • A good Sorted List for Java

    - by Phuong Nguyen de ManCity fan
    I'm looking for a good sorted list for java. Googling around give me some hints about using TreeSet/TreeMap. But these components is lack of one thing: random access to an element in the set. For example, I want to access nth element in the sorted set, but with TreeSet, I must iterate over other n-1 elements before I can get there. It would be a waste since I would have upto several thousands elements in my Set. Basically, I'm looking for some thing similar to a sorted list in .NET, with ability to add element fast, remove element fast, and have random access to any element in the list. Has this kind of sorted list implemented somewhere? Thanks.

    Read the article

  • Generic List .First not working LINQ

    - by Hurricanepkt
    var stuff = ctx.spReport(); var StuffAssembled = new List<ReportCLS>(); var val = new List<ReportCLS>(); foreach (var item in stuff) { StuffAssembled.Add(new ReportCLS(item)); } val.Add(StuffAssembled.First()); Keeps throwing System.Collections.Generic.List' does not contain a definition for 'First' and no extension method 'First' accepting a first argument of type 'System.Collections.Generic.List' could be found (are you missing a using directive or an assembly reference?) what is going wrong ? moreover how do i fix it? Thanks

    Read the article

  • Efficient algorithm to distribute work?

    - by Zwei Steinen
    It's a bit complicated to explain but here we go. We have problems like this (code is pseudo-code, and is only for illustrating the problem. Sorry it's in java. If you don't understand, I'd be glad to explain.). class Problem { final Set<Integer> allSectionIds = { 1,2,4,6,7,8,10 }; final Data data = //Some data } And a subproblem is: class SubProblem { final Set<Integer> targetedSectionIds; final Data data; SubProblem(Set<Integer> targetedSectionsIds, Data data){ this.targetedSectionIds = targetedSectionIds; this.data = data; } } Work will look like this, then. class Work implements Runnable { final Set<Section> subSections; final Data data; final Result result; Work(Set<Section> subSections, Data data) { this.sections = SubSections; this.data = data; } @Override public void run(){ for(Section section : subSections){ result.addUp(compute(data, section)); } } } Now we have instances of 'Worker', that have their own state sections I have. class Worker implements ExecutorService { final Map<Integer,Section> sectionsIHave; { sectionsIHave = {1:section1, 5:section5, 8:section8 }; } final ExecutorService executor = //some executor. @Override public void execute(SubProblem problem){ Set<Section> sectionsNeeded = fetchSections(problem.targetedSectionIds); super.execute(new Work(sectionsNeeded, problem.data); } } phew. So, we have a lot of Problems and Workers are constantly asking for more SubProblems. My task is to break up Problems into SubProblem and give it to them. The difficulty is however, that I have to later collect all the results for the SubProblems and merge (reduce) them into a Result for the whole Problem. This is however, costly, so I want to give the workers "chunks" that are as big as possible (has as many targetedSections as possible). It doesn't have to be perfect (mathematically as efficient as possible or something). I mean, I guess that it is impossible to have a perfect solution, because you can't predict how long each computation will take, etc.. But is there a good heuristic solution for this? Or maybe some resources I can read up before I go into designing? Any advice is highly appreciated!

    Read the article

  • How to add separator between items in a Spark List control

    - by simms2k
    I have a s:List where I've defined my own itemRenderer, and would like to insert a horizontal line separating items, similar to the way the mx:LinkBar works. I don't want to have a line at the top or bottom of the list, so I can't just include an upper or lower border in the itemRenderer. I was hoping the itemRenderer could be made aware of its index in the list, but I don't see how. Is there a way to do this?

    Read the article

  • how to add a new value to a dropdown list in Rails

    - by LearnRails
    In my item table, I have a itemname column which is currently a dropdown list taking values from DB. <%= select 'item','itemname' , Item.find(:all).collect{|c| [c.itemname]},{:include_blank = 'Select Name'} How can I add a new value to this dropdown list through the application. Is there a provision to directly add value to the list? Thanks

    Read the article

  • populate a list dynamically in ant build script

    - by user1164061
    I have the following directory structure: vardir1 vardir2 vardir3 vardir4 constantdir1 Inside constantdir1, i have an ant build script which takes the list of vardir1 to vardir4 and compiles them sequentially. The situation is, vardir1 to vardir4 may or may not exist all the time. Right now I have hard coded the values in the list and checking to see if the vardir is available before I kick off its compilation. Is there any way I can dynamically populate this list in my ant build script?

    Read the article

< Previous Page | 76 77 78 79 80 81 82 83 84 85 86 87  | Next Page >