Search Results

Search found 8344 results on 334 pages for 'fast vector highlighter'.

Page 200/334 | < Previous Page | 196 197 198 199 200 201 202 203 204 205 206 207  | Next Page >

• Songbird very slow, freezes

  - by Cawas

  I've read on few places that Songbird is no good with more than some thousands of library items because it starts getting quite slow. Well, in my case (which is a clean install) I've imported 17k items (which I know is not that much) and instead of becoming just too slow it frequently gets to not responding for several minutes until getting back to its senses again. That's for whichever random operation such as deleting 1 item from library. I've also read on few more places that gives very little hope on fixing this issue, but I wonder... Is there any way to tweak it and make it work as fast as expected? Am I missing something or is the software just not intended for libraries with more than 10 thousand thingies?

  Read the article

• Why is the destructor of the class called twice ?

  - by dicaprio

  Apologies if the question sounds silly, I was following experts in SO and trying some examples myself, and this is one of them. I did try the search option but didn't find an answer for this kind. class A { public: A(){cout<<"A Contruction"<<endl;} ~A(){cout<<"A destruction"<<endl;} }; int main() { vector<A> t; t.push_back(A()); // After this line, when the scope of the object is lost. } Why is the destructor of the class called twice ?

  Read the article

• What happened to the ability to go back in a already-loaded YouTube video?

  - by Chelonian

  For many years, my experience with YouTube had been, consistently and on any computer/browser, that once a section of that video were loaded, or the whole video, if you wanted to see an earlier part of the video again, you could simply click on the loading bar to that area and you would instantly go to that part. More recently (6 months?) this has changed. Now, clicking in an earlier part of the video forces a reload of the whole video (that is, the grey bar goes back to 0) and you have to hope your loading will be fast enough to make waiting to watch it again even worth it. It is a huge regression in usability for me. Is there any way to watch YouTube videos in the "old way"? I use Firefox 17.0.1 at this point and have an updated (I think) Flash, but I'd be willing to try other browsers or versions if it made a difference.

  Read the article

• Create a table of Quantiles in R for multiple Subsets of Data

  - by user1489719

  I'm trying to create append a table of quantiles in R for multiple subsets of data. Right now, I have a vector of ids (p_ids) in table DATA, which are not consecutive. For each value in p_ids, I am looking to list the quantile. So far, I've tried variations of: i <- 1 n <- 1 for (i in p_ids) { while(n <= nrow(data)) { quantiles[n] <- quantile(subset(alldata$variableA, alldata$variableB == i),probs = c(0,1,2,3)/3) n <- n + 1 } } I know my issue lies somewhere in the index, but I can't seem to get where the index should go. Suggestions?

  Read the article

• inputMismatchException Java reading doubles from plain text file

  - by user939287

  Using double variable = inputFile.nextDouble(); Gives the mismatch error and I can't figure out why... Anyone know what's up? The input file is just a bunch of doubles like 5.0... Okay here is the code snippet String fileName; Scanner scanner = new Scanner(System.in); System.out.println("\nEnter file name that contains the matrix and vector: "); fileName = scanner.nextLine(); Scanner inputFile = new Scanner(fileName); double a1 = inputFile.nextDouble(); the input file is a plain text document .txt in this format 5.0 4.0 -3.0 4.0 2.0 5.0 6.0 5.0 -2.0 -13.0 4.0 12.0 I don't understand why it wouldn't take those as doubles... As far as what its expecting the format of the file to be... I suppose binary? isn't that the default? I didn't specify in the code...

  Read the article

• Twin edges - Half edge data structure

  - by Pradeep Kumar

  I have implemented a Half-edge data structure for loading 3d objects. I find that the part of assigning twin/pair edges takes the longest computation time (especially for objects which have hundreds of thousands half edges). The reason is that I use nested loops to accomplish this. Is there a simpler and efficient way of doing this? Below is the code which I've written. HE is the half-edge data structure. hearr is a vector containing all the half edges. vert is the starting vertex and end is the ending vertex. Thanks!! HE *e1,*e2; for(size_t i=0;i<hearr.size();i++){ e1=hearr[i]; for(size_t j=1;j<hearr.size();j++){ e2=hearr[j]; if((e1->vert==e2->end)&&(e2->vert==e1->end)){ e1->twin=e2; e2->twin=e1; } } }

  Read the article

• C++ Questions about vectors

  - by xbonez

  Hey guys, I have a CS exam tomorrow. Just want to get a few questions cleared up. Thanks a lot, and I really appreciate the help. Que 1. What are parallel vectors? Vectors of the same length that contain data that is meant to be processed together Vectors that are all of the same data type Vectors that are of the same length Any vector of data type parallel Que 2. Arrays are faster and more efficient than vectors. True False Que 3. Arrays can be a return type of a function call. True False Que 4. Vectors can be a return type of a function call. True False

  Read the article

• How to ignore hard drives size with Windows Server Backup (Win-2008) restore?

  - by Jason

  I used Windows Server Backup to backup my 640GB boot drive. Only about 30GB is used, and the backup was very fast. Now I am trying to restore the image to a 500GB hard drive but it is saying that the drive is too small... even though I only had 30GB on the original backup. How do I overide this and have the restore ignore that I only have a 500GB drive? If I can't, then I can't restore the hard drive with anything except one that is equal to or bigger than the original hard drive - which would be a real bummer.

  Read the article

• Why only random-access-iterator implements operator+ in C++?

  - by xopht

  I'd like get far next value for STL list iterator but it doesn't implement operator+, vector has it though. Why and how can I get the value where I want? I think I can do that if I call operator++ several times, but isn't that a little bit dirty? What I want to do is the following: list<int> l; ...omitted... list<int>::iterator itr = l.begin() + 3; // but, list iterator does not have // operator+ What is the best solution for what I want?

  Read the article

• IPSec 2 hosts (preshared key) - network shares very slow

  - by LxFlip

  I'm testing a IPSec config between 2 hosts, using ipsec auth with preshared key, very simple configuration. (I want to start with a IPSec simple preshared key config, and then step up to a Certificate or kerberos...) The problem is: The connection is working but when accessing network file shares the first time it's very slow. On the same host i'm testing the shares, i have an IIS site running, and the performance seems very normal, fast. Does anybody know why does SMB shares are soo slow? Is there any ipsec policy options that should be tweaked? Thanks

  Read the article

• C++: Copying to dereferenced pointer...

  - by bbb

  Hi. I currently have a weird problem with a program segfaulting but im not able to spot the error. I think the problem boils down to this. struct S {int a; vector<sometype> b;} S s1; // fill stuff into a and b S* s2 = new S(); *s2 = s1; Could it be that the final copying is illegal in some way? Im really confused right now... Thanks

  Read the article

• Error occurs while using SPADE method in R

  - by Yuwon Lee

  I'm currently mining sequence patterns using SPADE algorithm in R. SPADE is included in "arulesSequence" package of R. I'm running R on my CentOS 6.3 64bit. For an exercise, I've tried an example presented in http://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R/Sequence_Mining/SPADE When I tried to do "cspade(x, parameter = list(support = 0.4), control = list(verbose = TRUE))" R says: parameter specification: support : 0.4 maxsize : 10 maxlen : 10 algorithmic control: bfstype : FALSE verbose : TRUE summary : FALSE preprocessing ... 1 partition(s), 0 MB [0.096s] mining transactions ... 0 MB [0.066s] reading sequences ...Error in asMethod(object) : 's' is not an integer vector When I try to run SPADE on my Window 7 32bit, it runs well without any error. Does anybody know why such errors occur?

  Read the article

• Computers with Small Capacity SSD - For caching?

  - by RXC

  Recently, in newsletters from websites, I have been seeing computers for sale from manufacturers that include an HDD and an SSD but the SSD has a small capacity like 24 GBs. I don't know if this still holds true, but I learned that when building a computer, you would want to install your OS on your fastest hard drive. I do a lot of PC gaming, so I install my OS and games on my SSD, because I learned that games and many applications make lots of system calls to the OS and performance can only be as fast as the slowest piece. Why these computers come with small capacity SSDs? Most OS's take up around 20 to 30 GBs of space, so what are the benefits of such a small SSD? Are these small size SSDs for caching? and what exactly does caching mean (what does it do and how does it help)?

  Read the article

• Can anyone suggest me game recorder software for Youtube Video? [closed]

  - by Sukhdev Taneja

  I am looking for game recorder software to capture movies of PC games (with sound) so that I can upload to YouTube Videos. I have recorded some games on my computer. But they run so quickly and fast. Can anybody suggest me any computer screen recorder (with sound) so that I can make my own computer gameplay trailer for Youtube. Is it possible to record PS2 games too without using any TV Tuner Card on computer. Please suggest any freeware software if possible for my purpose. Thanks.

  Read the article

• what to use in place of std::map::emplace?

  - by kfmfe04

  For containers such as std::map< std::string, std::unique_ptr< Foo >>, it looks like emplace() has yet to be implemented in stdc++ as of gcc 4.7.2. Unfortunately, I can't store Foo directly by value as it is an abstract super-class. As a simple, but inefficient, place-holder, I've just been using std::map< std::string, Foo* > in conjunction with a std::vector< std::unique_ptr< Foo >> for garbage collection. Do you have a interim solution that is more efficient and more easily replaced once emplace() is available?

  Read the article

• C++ setting up "flags"

  - by sub

  Example: enum Flags { A, B, C, D }; class MyClass { std::string data; int foo; // Flags theFlags; (???) } How can I achieve that it is possible to set any number of the "flags" A,B,C and D in the enum above in an instance of MyClass? My goal would be something like this: if ( MyClassInst.IsFlagSet( A ) ) // ... MyClassInst.SetFlag( A ); //... Do I have to use some array or vector? If yes, how? Are enums a good idea in this case?

  Read the article

• What could slow Excel on one PC but not another?

  - by zrz

  I have 2 PC with the same configuration. I open an Excel File (~5M) on the network from both PC. The opening is not the fastest but that's ok. The problem is that on one PC, Excel is really slow. I mean if I hit the left arrow 10 times, I will have finished hitting like 3 seconds before the active cell is the next 10th one. The file contains graphics that takes time to initialize on the slowed computer. Both PC have the same graphic cards, same driver version; both remote access to the file on a local network. Both configured to perform calculations automatically. Both Excel 2007. Both Windows 32bit. On the other PC it runs really fast. I really don't know what to check next. Any suggestions ?

  Read the article

• Do I really need to return Type::size_type?

  - by dehmann

  I often have classes that are mostly just wrappers around some STL container, like this: class Foo { public: typedef std::vector<whatever> Vec; typedef Vec::size_type; const Vec& GetVec() { return vec_; } size_type size() { return vec_.size() } private: Vec vec_; }; I am not so sure about returning size_type. Often, some function will call size() and pass that value on to another function and that one will use it and maybe pass it on. Now everyone has to include that Foo header, although I'm really just passing some size value around, which should just be unsigned int anyway ...? What is the right thing to do here? Is it best practice to really use size_type everywhere?

  Read the article

• What is most efficient way of setting row to zeros for a sparce scipy matrix?

  - by Alex Reinking

  I'm trying to convert the following MATLAB code to Python and am having trouble finding a solution that works in any reasonable amount of time. M = diag(sum(a)) - a; where = vertcat(in, out); M(where,:) = 0; M(where,where) = 1; Here, a is a sparse matrix and where is a vector (as are in/out). The solution I have using Python is: M = scipy.sparse.diags([degs], [0]) - A where = numpy.hstack((inVs, outVs)).astype(int) M = scipy.sparse.lil_matrix(M) M[where, :] = 0 # This is the slowest line M[where, where] = 1 M = scipy.sparse.csc_matrix(M) But since A is 334863x334863, this takes like three minutes. If anyone has any suggestions on how to make this faster, please contribute them! For comparison, MATLAB does this same step imperceptibly fast. Thanks!

  Read the article

• C++: String and unions

  - by sub

  I'm having a (design) problem: I'm building an interpreter and I need some storage for variables. There are basically two types of content a variable here can have: string or int. I'm using a simple class for the variables, all variables are then stored in a vector. However, as a variable can hold a number or a string, I don't want C++ to allocate both and consume memory for no reason. That's why I wanted to use unions: union { string StringValue; int IntValue; } However, strings don't work with unions. Is there any workaround so no memory gets eaten for no reason?

  Read the article

• C++ template + typedef

  - by MMS

  What is wrong in the following code: Point2D.h template <class T> class Point2D { private: T x; T y; ... }; PointsList.h template <class T> class Point2D; template <class T> struct TPointsList { typedef std::vector <Point2D <T> > Type; }; template <class T> class PointsList { private: TPointsList <T>::Type points; //Compiler error ... }; I would like to create new user type TPointsList without direct type specification...

  Read the article

• What is wrong with my loop?

  - by user3966541

  I have the following loop and don't understand why it only runs once: std::vector<sf::RectangleShape> shapes; const int res_width = 640; const int res_height = 480; for (int x = 0; x < res_width / 50; x += 50) { for (int y = 0; y < res_height / 50; y += 50) { sf::RectangleShape shape(sf::Vector2f(50, 50)); shape.setPosition(x * 50, y * 50); sf::Color color = (x % 2 == 0) ? sf::Color::Green : sf::Color::Red; shape.setFillColor(sf::Color::Green); shapes.push_back(shape); } }

  Read the article

• Subtle C++ mistake, can you spot it?

  - by aaa

  I ran into a subtle C++ gotcha, took me while to resolve it. Can you spot it? class synchronized_container { boost::mutex mutex_; std::vector <T> container_; void push_back(const T &value) { boost::scoped_lock(mutex_); // raii mutex lock container_.push_back(value); } ... }; scoped lock is a raii mutex lock, obtains lock on constructor, release lock in destructor. The program will work as expected in serial, but will may occasionally produce weird stuff with more than one thread.

  Read the article

• Pointers and collection of pointers in C++. How to properly delete.

  - by Julen

  Hello, This is a newbe question but I have alwasy doubts with pointers in C++. This is the situation. I have a class A which as a collection (a vector actually) of pointers of class B. This same class A has another collection of pointers to class C. Finally the objects of class B have also a collection to pointers to class C which point to the same instances the class A points to. My question is, if I delete a member of class-C-type pointer in class B, what happens to the pointer in class A that points to the deleted instance of class C? How this situation has to be treated? Thanks a lot in advance! Julen.

  Read the article

• Clojure: find repetition

  - by demi

  Let we have a list of integers: 1, 2, 5, 13, 6, 5, 7 and I want to find the first number has a duplicate before it and return a vector of two indices, In my sample, it's 5 at [2, 5]. What I did so far is loop, but can I do it more elegant, short way? (defn get-cycle [xs] (loop [[x & xs_rest] xs, indices {}, i 0] (if (nil? x) [0 i] ; Sequence is over before we found a duplicate. (if-let [x_index (indices x)] [x_index i] (recur xs_rest (assoc indices x i) (inc i)))))) No need to return number itself, because I can get it by index and, second, it may be not always there.

  Read the article

< Previous Page | 196 197 198 199 200 201 202 203 204 205 206 207  | Next Page >