Search Results

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

Page 127/1894 | < Previous Page | 123 124 125 126 127 128 129 130 131 132 133 134  | Next Page >

  • Why did File::Find finish short of completely traversing a large directory?

    - by Stan
    A directory exists with a total of 2,153,425 items (according to Windows folder Properties). It contains .jpg and .gif image files located within a few subdirectories. The task was to move the images into a different location while querying each file's name to retrieve some relevant info and store it elsewhere. The script that used File::Find finished at 20462 files. Out of curiosity I wrote a tiny recursive function to count the items which returned a count of 1,734,802. I suppose the difference can be accounted for by the fact that it didn't count folders, only files that passed the -f test. The problem itself can be solved differently by querying for file names first instead of traversing the directory. I'm just wondering what could've caused File::Find to finish at a small fraction of all files. The data is stored on an NTFS file system. Here is the meat of the script; I don't think including DBI stuff would be relevant since I reran the script with nothing but a counter in process_img() which returned the same number. find(\&process_img, $path_from); sub process_img { eval { return if ($_ eq "." or $_ eq ".."); ## Omitted querying and composing new paths for brevity. make_path("$path_to\\img\\$dir_area\\$dir_address\\$type"); copy($File::Find::name, "$path_to\\img\\$dir_area\\$dir_address\\$type\\$new_name"); }; if ($@) { print STDERR "eval barks: $@\n"; return } } And here is another method I used to count files: count_images($path_from); sub count_images { my $path = shift; opendir my $images, $path or die "died opening $path"; while (my $item = readdir $images) { next if $item eq '.' or $item eq '..'; $img_counter++ && next if -f "$path/$item"; count_images("$path/$item") if -d "$path/$item"; } closedir $images or die "died closing $path"; } print $img_counter;

    Read the article

  • how can i find unused css in ajax app?

    - by Haroldo
    I've been searching and i can't find any ff addons or javascript for finding unused css in ajax apps. dust-me selectors can do a site-crawl, but i'm looking for something that examines loaded-in content... I'd like something where i can press 'record' and then make a load of clicks which will check off the used selectors, and hoping to find an existing one rather than try to write my own with jquery!

    Read the article

  • QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's

    - by Greg
    Hi, In QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's. In other words all vertex's which have somewhere under them (on the way to the leaf nodes) one or more of the vertexs input. So if the vertexs were Nodes, and the edges were a depends on relationship, find all nodes that would be impacted by a given set of nodes. If not how hard is it to write one's own algorithms?

    Read the article

  • where can I find a good ruby excel parser that also had good documentation?

    - by Chris Drappier
    Hi All, I've spent some time today looking for a pure ruby library that will parse an excel workbook. I could find the parseexcel gem in the repos, but the problem is that I can't find any documentation on it. and the rdoc is pitiful. so, my question is 1) is there good documentation out there for this gem? 2) if not, is there another gem that does the same thing that has good documentation? thx :) -C

    Read the article

  • How can I find the dimensions of a matrix in Python?

    - by PBD10017
    How can I find the dimensions of a matrix in Python. Len(A) returns only one variable. Edit: Hi Thanks. close = dataobj.get_data(timestamps, symbols, closefield) Is (I assume) generating a matrix of integers (less likely strings). I need to find the size of that matrix, so I can run some tests without having to iterate through all of the elements. As far as the data type goes, I assume it's an array of arrays (or list of lists).

    Read the article

  • QR code - where can I find (free) code to embed my own generator on a web page?

    - by Robbert Huisman
    Hi, couldn't find it exactly from earlier questions, but I am probably repeating an earlier question, so apologies upfront ;-) I am looking for a simple code to embed a QR 2D code generator on a website I am building. I assume their should be some free open source code for that but I could only find paid software. Can anyone point me in the right direction? would be mostly appreciated! best regards, Robbert

    Read the article

  • How to find what service running on background on Android?

    - by XC
    How to find what service running on background on Android? like input method service, .... Using adb or terminal on android device ? Could I use "top" or "ps" command? Maybe I have to ask in another way? Does the service be presented as one "process", then we can use "ps" or "top" command to find it?

    Read the article

  • How to find which existing .NET solutions contain a project?

    - by Daniel Daranas
    I am exploring a structure of folders with C# projects such as the following: Projects ProjectA ProjectB ProjectC ProjectD Scattered around in the same folders as the .csproj files, there are several solution (.sln) files. Is there a fast way to find all the solutions that contain ProjectD.vsproj? I can open them one by one and see what they contain, but I would like a feature such as "find all the solutions containing this project".

    Read the article

  • tool to find out distance in terms of no. of hops in unix

    - by mawia
    Hi! all, I am writing an application for video streaming.In the application server is required to know the distance of the client from it self in terms of hop number.My question is,is there any tool/method other than traceroute available in unix environment to find it? I also need to find out the geographical location of the client.So is their any tool/method for this as well? Any help in this regard will be highly appreciated. Thanks in advance. Mawia

    Read the article

  • How to find which existing .NET solutions contain a certain project?

    - by Daniel Daranas
    I am exploring a structure of folders with C# projects such as the following: Projects ProjectA ProjectB ProjectC ProjectD Scattered around in the same folders as the .csproj files, there are several solution (.sln) files. Is there a fast way to find all the solutions that contain ProjectD.csproj? I can open them one by one and see what they contain, but I would like a feature such as "find all the solutions containing this project".

    Read the article

  • Python - Find where in string regex match was found?

    - by nb
    I'm currently using regular expressions to search through RSS feeds to find if certain words and phrases are mentioned, and would then like to extract the text on either side of the match as well. For example: String = "This is an example sentence, it is for demonstration only" re.search("is", String) I'd like to know where the is was found so that I can extract and output something like this: 1 match found: "This is an example sentence" I know that it would be easy to do with splits, but I'd need to know what the index of first character of the match was in the string, which I don't know how to find

    Read the article

  • How can I find the boundaries of a subset of a sorted list?

    - by Alex
    I have the following dilemma: I have a list of strings, and I want to find the set of string which start with a certain prefix. The list is sorted, so the naive solution is this: Perform binary search on the prefixes of the set, and when you find an element that starts with the prefix, traverse up linearly until you hit the top of the subset. This runs in linear time, however, and I was wondering if anyone can suggest a more efficient way to do it.

    Read the article

< Previous Page | 123 124 125 126 127 128 129 130 131 132 133 134  | Next Page >