Search Results

Search found 4593 results on 184 pages for 'operator equal'.

Page 92/184 | < Previous Page | 88 89 90 91 92 93 94 95 96 97 98 99  | Next Page >

• C++ template instantiation with identity argument

  - by aaa

  hello. I have ran into yet another problem I do not understand. The following does not instantiate, why? template<class E> void operator[](typename boost::mpl::identity<E>::type e) const; thank you for your help

  Read the article

• Creating an instance within the Class itself

  - by didxga

  What's going on when the assignment statement executed at Line 4, does compiler ignore the new operator and keep the foo variable being null or something else happen to handle this awkward moment? public class Foo { // creating an instance before its constructor has been invoked, suppose the "initializing" // gets printed in constructor as a result of the next line, of course it will not print it private Foo foo = new Foo();//Line 4 public Foo() { System.out.println("initializing"); } }

  Read the article

• How to test my application With STL such as vector to make sure weather it works or not in c++?

  - by Sam

  *we release and the acquire the pointer with the Linked_ptr in parameter */ Linked_ptr& operator=(const Linked_ptr& r) { if (this != &r) { release(); acquire(r); } return *this; }

  Read the article

• Comparison of IPEndPoint objects not working

  - by Martin Mizzell

  I have an IPEndPoint a and b, whose IPAddress and Port are exactly the same, but the == operator is on the IPEndPoint not returning true. To make things even stranger, I tried to circumvent the problem by simply comparing the IPAddress and Port individually and it is STILL not returning true. Has anyone encountered this before? If so, I am all ears to performant solutions. We have collections of as many as 10k IPEndPoints and are querying into them via LINQ (PLINQ pretty soon).

  Read the article

• How to get a random node from a tree?

  - by ooboo

  It looks easy, but I found the implementation tricky. I need that for a simple genetic programming problem I'm trying to implement. The function should, given a node, return the node itself or any of its children such that the probability of choosing a node is normally distributed relative to its depth (so the function should return mostly middle nodes, but sometimes the root itself or the lowest ones - but that's not really necessary if that makes it significantly more complex, if all any node is chosen with equal probability, that's good enough). Thanks

  Read the article

• MySQL: SUM in WHERE clause

  - by checcco

  Hi guys, I've got this table CREATE TABLE `subevents` ( `id` int(11) NOT NULL AUTO_INCREMENT, `title` varchar(150) DEFAULT NULL, `content` text, `class` tinyint(4) NOT NULL DEFAULT '1', PRIMARY KEY (`id`) ) ENGINE=MyISAM Each row can have a different value in the 'class' field. I'd like to select any number of rows, ordered randomly, as long as the sum of the values in the 'class' field is equal to 100. How could I accomplish it directly in the MySQL query without doing it later in PHP? Thanks everybody!

  Read the article

• returning aligned memory with new?

  - by Steve

  I currently allocate my memory for arrays using the MS specific mm_malloc. I align the memory, as I'm doing some heavy duty math and the vectorization takes advantage of the alignment. I was wondering if anyone knows how to overload the new operator to do the same thing, as I feel dirty malloc'ing everywhere (and would eventually like to also compile on Linux)? Thanks for any help

  Read the article

• NULL value in :conditions =>

  - by Horace Ho

  Contract.all(:conditions => ['voided == ?', 0]).size => 364 Contract.all(:conditions => ['voided != ?', 0]).size => 8 Contract.all.size => 441 the 3 numbers does not added up (364 + 8 != 441). What's the proper way write the :conditions to count the rows which the voided column value is NULL or equal to zero?

  Read the article

• int ** vs int [ROWS][COLS]

  - by user355638

  I have a 2D array declared like this: int arr[2][2]={ {1,2},{3,4}}; Now if I do: int ** ptr=(int**) arr; and: cout<<**ptr; I am getting a segmentation fault (using g++-4.0). Why so? Shouldn't it be printing the value 1 (equal to arr[0][0])?

  Read the article

• Shift Operators in C++

  - by Codeguru

  If the value after the shift operator is greater than the number of bits in the left-hand operand, the result is undefined. If the left-hand operand is unsigned, the right shift is a logical shift so the upper bits will be filled with zeros. If the left-hand operand is signed, the right shift may or may not be a logical shift (that is, the behavior is undefined). Can somebody explain me what the above lines mean??

  Read the article

• From Now() to Current_timestamp in Postgresql

  - by xRobot

  In mysql I am able to do this: SELECT * FROM table WHERE auth_user.lastactivity > NOW() - 100 now in postgresql I am using this query: SELECT * FROM table WHERE auth_user.lastactivity > CURRENT_TIMESTAMP - 100 but I get this error: operator does not exist: timestamp with time zone - integer How can I resolve ?

  Read the article

• pls give reason why this java program always comes to the else part

  - by Anbu

  public class Test { public static void main(String[] args){ if (5.0 5) // (5.0<5) for both case it is going to else System.out.println("5.0 is greater than 5"); else System.out.println("else part always comes here"); /another sample/ if (5.0 == 5) System.out.println("equals"); else System.out.println("not equal"); } } can any one explain the first "if statement" why it always come to else part

  Read the article

• MATLAB: comparing 2 columns content

  - by Patrick

  hi, I need to compare the content of 2 tables, more exactly 2 columns (1 column per table) in Matlab to see, for each element of the firsts column, there is an equal element in the second column. Should I use a for loop or is there any MATLAB function doing this ? thanks

  Read the article

• Comparing the values of two generic Numbers

  - by PartlyCloudy

  I want to compare to variables, both of type T extends Number. Now I want to know which of the two variables is greater than the other or equal. Unfortunately I don't know the exact type yet, I only know that it will be a subtype of java.lang.Number. How can I do that? Thanks!

  Read the article

• Should I always include stddef.h if I use sizeof and size_t

  - by yCalleecharan

  Hi, if I'm using the sizeof operator and making use of size_t in my code, do I have necessarily have to include stddef.h? I haven't included stddef.h, and my code compiles without warning with both MVS2008 and with Borland C++ BuilderX. Thanks a lot...

  Read the article

• Howto get Autocomplete for the Propertys in Eclipse

  - by mobbek_hobbeb

  Is it possible to get Autocomplete or Something when i work with the eclipse form editor? I write a color in the strings.xml and then i want to select it by the propertys for the text color, but there is no autocomplete or something equal

  Read the article

• Why is T() = T() allowed in C++?

  - by Rimo

  I believe the expression T() creates an rvalue (by the Standard) However the following code compiles (at least on gcc4.0) class T {... }; int main() { T() = T(); } I know technically this is possible because member functions can be invoked on temporaries and the above is just invoking the operator= on the r-value temporary created from T(). But conceptually this is like assigning a new value to an r-value. Is there a good reason why this is allowed?

  Read the article

• How to make NOT IN statement via Restrictions

  - by slavig

  I used this trick: List statuses = new ArrayList(); Criteria criteria = session.createCriteria(MessageQueue.class); criteria.add(Restrictions.not(Restrictions.in("message_status", statuses))); and this code creates: ...from MESSAGE_QUEUE mq where not (mq.message_status in (?, ?, ?, ?))... but I need: ...from MESSAGE_QUEUE mq where mq.message_status NOT IN (?, ?, ?, ?) Du you think they are equal statements?

  Read the article

• How to set the size of multiple buttons on content

  - by rob

  I am using three buttons along with the list view.These three buttons are added to the layout using the TableLayout and TableRow.The first button takes more space on content, so the other two becomes smaller in size than first one. When the application runs, it doesn't even show the two other buttons. How can I make the size of three buttons equal and display all of them when application runs?Give me some example please. Thanks

  Read the article

• ActionScript Reading Static Const Array

  - by TheDarkIn1978

  how can i evaluate weather my test array is equal to my static constant DEFAULT_ARRAY? shouldn't my output be returning true? public class myClass extends Sprite { private static const DEFAULT_ARRAY:Array = new Array(1, 2, 3); public function myClass() { var test:Array = new Array(1, 2, 3); trace (test == DEFAULT_ARRAY); } //traces false

  Read the article

• testing if a register equals itself in ia32

  - by hatorade

  (ia32) for example, test $eax, $eax why would you ever want to do that? it does $eax & $eax, right? shouldn't this always set the flag register to say that they are equal..?

  Read the article

• How can i convert from wostream to ostream

  - by Avishay

  i am using a function that receives ostream but i have wostream is there a way to convert one to the other? in particular i want to use boost::write_graphviz which takes ostream but i currently in << operator for wostream.

  Read the article

• help with sql query - in access 2007

  - by Gold

  hi i have 2 tables table items has 144602 records table A has 27721 records code in items = BAR8 in A i want to show all records that equal i try this: SELECT Items.Code, A.BAR8 FROM Items INNER JOIN A ON Items.Code = A.BAR8; and i get 28048 records !!! i need to get 27721 , how to do it ? thank's in advance

  Read the article

• C++ struct sorting

  - by Betamoo

  I have a vector of custom Struct that needs to be sorted on different criteria each time Implementing operator < will allow only one criteria But I want to be able to specify sorting criteria each time I call C++ standard sort. How to do that? Please note it is better to be efficient in running time.. Thanks

  Read the article

• How allocate or free only parts of an array?

  - by drigoSkalWalker

  see this example: int *array = malloc (10 * sizeof(int)) Then free only the first 3 blocks? Or make equal java, have an array with negative index, or an index that not began with 0. Thanks a lot.

  Read the article

< Previous Page | 88 89 90 91 92 93 94 95 96 97 98 99  | Next Page >