Search Results

Search found 47335 results on 1894 pages for 'find'.

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

• Find similar or "like" text and replace it with other in excel

  - by andreas

  Does anyone know how i can find similar descriptions in excel and replace them with 1 other description is there a wild card? i am. trying to make a pivot chart with a list of transactions and their descriptions and i want to group all my ATM withdrwls but i cant. On the pivot chart they appear as ATM Withdrwal-REF-1234 and each of these "withdrwls" have different reference and as a result they show up as individual items on the chart...how can i group say all my ATM withdrwals as 1 ATM Withrdawl item so that it shows a 1 atm withdrwl item on my pivot chart?

  Read the article

• Error: cant find main class

  - by Vurb

  ok so im a newbie java dev using netbeans IDE 7.1.1 and im watching this tutorial and right off the bat i get an error in my program even after 5 retypes to make sure its exactly the same as in the video so anyways this is the error Error: Could not find or load main class javagame.JavaGame Java Result: 1 and this is the code i have written package JavaGame; import javax.swing.JFrame; public class JavaGame extends JFrame { public JavaGame(){ setTitle("java game"); setSize(500, 500); setResizable(false); setVisible(true); //setDefaultCloseOperation(); } public static void main(String[] args){ } }

  Read the article

• Parsing HTML tags to find a specific Table Row

  - by moutonc

  Hello everyone I was set up with a Challenge where I must parse through an HTML page to find the end date of all the classes. I am using the HTMLAgilityPack but, this is the first time I have used it, also the webpage who ever set it up has no classes or Id's and the end dates are stored in a Tr H4 tag. I am not sure how to Parse through any hits? My Code: HtmlAgilityPack.HtmlDocument doc = new HtmlAgilityPack.HtmlDocument(); doc.Load(txtURL.Text); sw.WriteLine("GET /academics/academic-calendar/ HTTP/1.1"); sw.WriteLine(); String response = sr.ReadToEnd(); txtHTML.Text = response;

  Read the article

• need a code snippet to find all *.html under a folder in nodejs

  - by Nicolas S.Xu

  I'd like to find all *.html files in src folder and all its sub folders using nodejs. What is the best way to do it? var folder = '/project1/src'; var extension = 'html'; var cb = function(err, results) { // results is an array of the files with path relative to the folder console.log(results); } // This function is what I am looking for. It has to recursively traverse all sub folders. findFiles(folder, extension, cb); I think a lot developers should have great and tested solution and it is better to use it than writing one myself.

  Read the article

• Is the "==" operator required to be defined to use std::find

  - by user144182

  Let's say I have: class myClass std::list<myClass> myList where myClass does not define the == operator and only consists of public fields. In both VS2010 and VS2005 the following does not compile: myClass myClassVal = myList.front(); std::find( myList.begin(), myList.end(), myClassVal ) complaining about lack of == operator. I naively assumed it would do a value comparison of the myClass object's public members, but I am almost positive this is not correct. I assume if I define a == operator or perhaps use a functor instead, it will solve the problem. Alternatively, if my list was holding pointers instead of values, the comparison would work. Is this right or should I be doing something else?

  Read the article

• Where to find .NET version usage statistics?

  - by Mash

  There are some technologies like LINQ and WPF which are nice, but installation of .NET 3.5 is still slow procedure. It's important to understand - among Windows users how many of them have .NET 3.5 installed? Is there any good up to date stats gathered about .NET Version availability/usage? I've searched a lot, but can't find. Update: .NET version IS present in web-agent strings for FF and IE at least. So there SHOULD be somebody who have that information. Anyone with access to really large web-site logs? Update 2: I also understand Vista means that user have 3.5, but XP is still dominating the market.

  Read the article

• Why Java cannot find my constructor?

  - by Roman

  Well, maybe it is a stupid question, but I cannot resolve this problem. In my ServiceBrowser class I have this line: ServiceResolver serviceResolver = new ServiceResolver(ifIndex, serviceName, regType, domain); And compiler complains about it. It says: cannot find symbol symbol : constructor ServiceResolver(int,java.lang.String,java.lang.String,java.lang.String) This is strange, because I do have a constructor in the ServiceResolver: public void ServiceResolver(int ifIndex, String serviceName, String regType, String domain) { this.ifIndex = ifIndex; this.serviceName = serviceName; this.regType = regType; this.domain = domain; } ADDED: I removed void from the constructor and it works! Why?

  Read the article

• How to find which annotation send showDetails?

  - by Voloda2

  How to find which annotation send showDetails? MKPinAnnotationView* customPinView = [[[MKPinAnnotationView alloc] initWithAnnotation:annotation reuseIdentifier:BridgeAnnotationIdentifier] autorelease]; customPinView.pinColor = MKPinAnnotationColorPurple; customPinView.animatesDrop = YES; customPinView.canShowCallout = YES; // add a detail disclosure button to the callout which will open a new view controller page // // note: you can assign a specific call out accessory view, or as MKMapViewDelegate you can implement: // - (void)mapView:(MKMapView *)mapView annotationView:(MKAnnotationView *)view calloutAccessoryControlTapped:(UIControl *)control; // UIButton* rightButton = [UIButton buttonWithType:UIButtonTypeDetailDisclosure]; [rightButton addTarget:self action:@selector(showDetails:) forControlEvents:UIControlEventTouchUpInside]; customPinView.rightCalloutAccessoryView = rightButton; return customPinView; - (void)showDetails:(id)sender { some code }

  Read the article

• need to find differences between 2 identical sql tables

  - by balalakshmi

  I need to find differences between 2 identical sql tables Each table is being uploaded from a 3rd paty tool into sqlserver database. The table structure is: Issue ID-status-Who Issue ID will not repeated within a table, though its not defined explicitly as primary Key There could be additions/deletions/Updations between any 2 tables. What I need Number of rows added & their details Number of rows deleted & their details Number of rows deleted & their details How do I do this 1) is it better to use sql 2) or use datatables

  Read the article

• How to find and update the next record in a linking table

  - by someoneinomaha

  I have a classifieds system I'm working on. People are able to add photos to a classified, but I only display one when displaying the list of classifieds. To do that, I have a linking table between classifieds and photos that has a "is_main" boolean field. When someone deletes one of their classified photos, I want to: 1) See if there is more than that photo tied to the classified. 2) If there is, update the next photo and set that "is_main" field to TRUE. Just trying to find out the most efficient way to do this.

  Read the article

• PHP find if file data is an image

  - by Christian Sciberras

  Imagine I have some file data in a variable $data. I need to determine whether it is an image or not. No need for details such as corrupt images etc. Firs thought would be getting the file mime type by looking at the magic number and then see whether "image" is in the mime type. No such luck, even if I have a "file extension to mime type" script, I don't have a reliable way to get mime from magic number. My next option was to have a reasonable list of image file magic numbers and consult them. However, it relatively difficult to find such magic numbers (gif for instance has different magic numbers, some of which could pretty rare - if memory serves me right). A better idea would be some linux program which can do this kind of thing. Any ideas? I'm running RHEL and PHP 5.3. I've got root access - ie able to install stuff if needed. - Chris.

  Read the article

• R: Given a set of random numbers drawn from a continuous univariate distribution, find the distribut

  - by knorv

  Given a set of real numbers drawn from a unknown continuous univariate distribution (let's say is is one of beta, Cauchy, chi-square, exponential, F, gamma, Laplace, log-normal, normal, Pareto, Student's t, uniform and Weibull).. x <- c(15.771062,14.741310,9.081269,11.276436,11.534672,17.980860,13.550017,13.853336,11.262280,11.049087,14.752701,4.481159,11.680758,11.451909,10.001488,11.106817,7.999088,10.591574,8.141551,12.401899,11.215275,13.358770,8.388508,11.875838,3.137448,8.675275,17.381322,12.362328,10.987731,7.600881,14.360674,5.443649,16.024247,11.247233,9.549301,9.709091,13.642511,10.892652,11.760685,11.717966,11.373979,10.543105,10.230631,9.918293,10.565087,8.891209,10.021141,9.152660,10.384917,8.739189,5.554605,8.575793,12.016232,10.862214,4.938752,14.046626,5.279255,11.907347,8.621476,7.933702,10.799049,8.567466,9.914821,7.483575,11.098477,8.033768,10.954300,8.031797,14.288100,9.813787,5.883826,7.829455,9.462013,9.176897,10.153627,4.922607,6.818439,9.480758,8.166601,12.017158,13.279630,14.464876,13.319124,12.331335,3.194438,9.866487,11.337083,8.958164,8.241395,4.289313,5.508243,4.737891,7.577698,9.626720,16.558392,10.309173,11.740863,8.761573,7.099866,10.032640) .. is there some easy way in R to programmatically and automatically find the most likely distribution and the estimated distribution parameters?

  Read the article

• question on find value in array

  - by davit-datuashvili

  i have seen a few days ago such problem there is given two array find elements which are common of these array one of the solution was sort big array and then use binary search algorithm and also there is another algorithm- brute-force algorithm for (int i=0;i<array1.length;i++){ for (int j=0;j<array2.length;j++){ if (array1[i]==array2[j]){ //code here } } it's complexity is O(array1.length*array2.length); and i am interested the first method's complexity is also same yes? because we should sort array first and then use search method binary search algorithm's complexity is log_2(n) so it means that total time will be array.length*log_2(n) and about sort? please explain me which is better

  Read the article

• Cannot find the certificate

  - by user409756

  We get a T-SQL (SQL Server 2008 R2) error on BACKUP CERTIFICATE: ERROR_NUMBER 15151, SEVERITY 16, STATE 1, PROCEDURE -, LINE 8, MESSAGE: Cannot find the certificate 'certificate1', because it does not exist or you do not have permission. We can see the certificate in master.sys.certificates. Our pseudo-code: copy an unattached template_db to db1 attach db1 create certificate1 (in stored procedure in master db) generate @password CREATE DATABASE ENCRYPTION KEY … ENCRYPTION BY SERVER CERTIFICATE '+@certificate_name +… (in stored procedure in db1) turn on Transparent Database Encryption for db1 using certificate1. (N'ALTER DATABASE '+@db_name+N' SET ENCRYPTION ON') N’BACKUP CERTIFICATE '+@certificate_name+N' TO FILE = '''+@certificate_file_path+N''' WITH PRIVATE KEY ( FILE = '''+@private_key_file_path+N''', ENCRYPTION BY PASSWORD = '''+@password+N'''' To try to work-around the error, we tested three ways with the BACKUP CERTIFICATE code in a different databases each time, including db1 and master. All get the same error. Any ideas? Thanks.

  Read the article

• Find and sort by number of ocurrences of tag with Active Admin and act_as_taggable_on

  - by nunopolonia

  I'm using act_as_taggable_on and Active Admin on a Rails project. In that project there are Posts and each Post has Tags. I want to show a list of Tags in Active Admin and the number of ocurrences of each one. The way I found to do this was: index do column :name column :ocurrences do |tag| ocurrences = Post.tag_counts.find(tag.id).count end default_actions end Which will search the Tag List every time for every Post, which performance wise looks really bad. I would also like to be able to sort the tags by ocurrence. Any idea of how I can do it?

  Read the article

• Find record whose field 'name' not contained within any other record

  - by charlie

  I have a model Foo with a String bar and a String name. Some records' bar contain the name of other records in them. This is intentional. I want to find the "root Foo" records - that is, the ones where their name do not appear in the bar records of any other Foo records. Example: Foo id: 1 name: 'foo1' bar: 'something something' id: 2 name: 'foo2' bar: 'foo1 something' id: 3 name: 'foo3' bar: 'foo1, foo4' My method root_foos would return foo2 and foo3 since their names do not appear in any bar string. edit: I don't want to use a relation or foreign key here - just this method.

  Read the article

• Find the period of over speed ?

  - by Vimvq1987

  Just something interesting come in my mind. Assume that we have a table (in SQL Server) like this: Location Velocity Time What is the best way to determine over speed periods (speed barrier is defined) ? My first idea was loading the table into an array, and then iterate over array to find these periods: (Pseudo C# code) bool isOverSpeed = false; for (int i =0;i<arr.Length;i++) { if (!isOverSpeed) if (arr[i].Velocity > speedBarrier) { #insert the first record into another array. isOverSpeed = true; } if(isOverSpeed) if (arr[i].Velocity < speedBarrier) { #insert the record into that array isOverSpeed = false; } } It works, but somewhat "not very effectively". Is there a "smarter" way, such as a T-SQL query or another algorithm to do this?

  Read the article

• To find busstop with timetable data and more near me(current postion)

  - by Sabby

  I am developing an application which helps the user to find the bus stops near him through his current latitude and longitude. This will also give the time table of the bus, route direction, bus name etc. I searched over the google but didn't get success. I tried the trimet api, but that was also not much helpful as it only works for Portland area and the pin is always dropped on the map on Portland. Please help me! Is there any api to do this? This app is for our client. User will input the route id, loc id or what and will get all the detail of near by bus stops and their lat,long.

  Read the article

• Find the clicked li number

  - by fire

  I have a standard list... <ul> <li><a href="#">blah 1</a></li> <li><a href="#">blah 2</a></li> <li><a href="#">blah 3</a></li> <li><a href="#">blah 4</a></li> </ul> And my jQuery: $('ul li a').live('click', function() { var parent = $(this).parent('li'); }); What I want to find out is the parent li's position in the list of the clicked link e.g. clicking on blah 3 would give me 2, blah 4 would give 3 etc. Any ideas?

  Read the article

• PDOException “could not find driver”

  - by Mike

  I have just installed Debian Lenny with Apache, MySQL, and PHP and I am receiving a PDOException could not find driver. This is the specific line of code it is referring to: $dbh = new PDO('mysql:host=' . DB_HOST . ';dbname=' . DB_NAME, DB_USER, DB_PASS) DB_HOST, DB_NAME, DB_USER, and DB_PASS are constants that I have defined. It works fine on the production server (and on my previous Ubuntu Server setup). Is this something to do with my PHP installation? Searching the internet has not helped, all I get is experts-exchange and examples, but no solutions.

  Read the article

• c# project cannot find c++ .dll?

  - by flavour404

  I have a working c++ dll that works in one c# project that I am calling via the interop service. I have created another c# project and am trying to call the same .dll but keep getting a generic error message stating that the .dll cannot be found, both project are .net 2.0. What folder, and where do I specify in the project, should I put the .dll file in so that the project can find it? Think of it as a reminder for me... In the previous project I did not have a reference to it, I just had it in the /bin folder and doing the same thing for this project does not work. Thanks R.

  Read the article

• Find and list all functions/methods in a set of JavaScript files

  - by Dan Milstein

  Is there a way to read a set of JavaScript files, and output a description of where every function/method is defined? I realize that this is likely impossible in full generality, due to the extreme dynamic nature of the language. What I'm imagining is something which gets the (relatively) straightforward cases. Ideally, I'd want it figure out where, e.g. some method got attached to string or hash or some other fundamental class (and also just let you find all the classes/functions that get defined once in one place). Does such a tool exist?

  Read the article

• ActiveRecord find all parents that have associated children

  - by brad

  I don't know why I can't figure this out, I think it should be fairly simple. I have two models (see below). I'm trying to come up with a named scope for SupplierCategory that would find all SupplierCategory(s) (including :suppliers) who's associated Supplier(s) are not empty. I tried a straight up join, named_scope :with_suppliers, :joins => :suppliers which gives me only categories with suppliers, but it gives me each category listed separately, so if a category has 2 suppliers, i get the category twice in the returned array: Currently I'm using: named_scope :with_suppliers, :include => :suppliers and then in my view I'm using: <%= render :partial => 'category', :collection => @categories.find_all{|c| !c.suppliers.empty? } %> Not exactly eloquent but illustrates what I'm trying to achieve. Class Definitions class SupplierCategory < AR has_many :suppliers, :order => "name" end class Supplier < AR belongs_to :supplier end

  Read the article

• jQuery find not working

  - by fire

  This is my HTML: <p class="first">blah blah <a href="" class="more">read more</a></p> <div class="read_more"> <p>more text</p> </div> And javascript: $(document).ready(function(){ $('a.more').click(function(){ $(this).find('.read_more').slideDown(); return false; }); }); Doesn't seem to do anything (read_more is set to display: none) any ideas?

  Read the article

• algorithm to find the three majority elements in an array

  - by Qiang Li

  Let's say there are three elements in a non-sorted array all of which appear more than one-fourth times of the total number of elements. What is the most efficient way to find these elements? Both for non-online and online versions of this question. Thank you! Edit The non-online version I was referring to is: this array is specified in full. The online version means the array elements are coming one at a time. I require the space in addition to time complexity to be tight. disclaimer: THIS IS NOT HOMEWORK! I consider this as research-level question.

  Read the article

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