Search Results

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

Page 123/184 | < Previous Page | 119 120 121 122 123 124 125 126 127 128 129 130  | Next Page >

• Puzzle related to cake [closed]

  - by Abhi

  Dear All While having tea with one of my colleague at evening time yesterday. He asked me one puzzle related to cake. The puzzle goes this way: Suppose i have a circular cake. And to that cake, I have to cut three times anywhere with maximum number of pieces without bothering abt the equal segment So how many maximum number of pieces it will make? A/c to me, the maximum number of pieces will be 7. But i am not sure. So please can u all tell me how many maximum number of pieces it will make & how? Please answer one at a time..... Thanks in advance...

  Read the article

• CUDA & VS2010 problem

  - by Kristian D'Amato

  I have scoured the internets looking for an answer to this one, but couldn't find any. I've installed the CUDA 3.2 SDK (and, just now, CUDA 4.0 RC) and everything seems to work fine after long hours of fooling around with include directories, NSight, and all the rest. Well, except this one thing: it keeps highlighting the <<< >>> operator as a mistake. Only on VS2010--not on VS2008. On VS2010 I also get several warnings of the following sort: C:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\include\xdebug(109): warning C4251: 'std::_String_val<_Ty,_Alloc>::_Alval' : class 'std::_DebugHeapAllocator<_Ty>' needs to have dll-interface to be used by clients of class 'std::_String_val<_Ty,_Alloc>' Anyone know how this can be fixed?

  Read the article

• How to connect to the process

  - by Polaris

  I have WPF Application. My Application consist of 2 exe files: Notifier.exe and MainApp.exe. Notifier is system tray popup application which check the remote server in equal intervals and get the list of current documents of user. When user click on one of the documents in list in Notification popup I open MainApp.exe and show required document in new tab. But When user click on another document in list it open new MainApp.exe process. Question: How Can I connect specific (already opened) process in the operating system and create some object in it?

  Read the article

• AspectJ join point with simple types

  - by Jon

  Hi! Are there defined join points in arithmetics that I can catch? Something like: int a = 4; int b = 2; int c = a + b; Can I make a pointcut that catches any one of those lines? And what context will I be able to get? I would like to add a before() to all int/float/double manipulation done in a particular method on a class, is that possible. I see in the AspectJ docs that there are defined join points for object initialization and method calls. Is declaring an int an object initialization and does the + operator count as a method call? Thanks!

  Read the article

• Add the "selected" attribute to a drop down option with jQuery

  - by gaoshan88

  How do I add the attribute "selected" to a drop down menu option based on that option matching some variable? Here is how the dropdown is populated... loginOptions = ["First", "Second", "Third]; var Login = $( '#Login' ); for ( var i = 0; i < loginOptions.length; i++ ) { Login.append('<option value="'+ loginOptions[i] +'">'+ loginOptions[i] +'</option>'); } I want to mark one option as "selected" based on whether or not its value matches another variable. so if loginOption[i] is equal to var existingLoginValue then set that option to 'selected' Something that would do if(loginOptions[i] === existingLoginValue){ print 'selected'; }; Thanks!

  Read the article

• how to interleaving lists

  - by user2829177

  I have two lists that could be not equal in lengths and I want to be able to interleave them. I want to be able to append the extra values in the longer list at the end of my interleaved list.I have this: a=xs b=ys minlength=[len(a),len(b)] extralist= list() interleave= list() for i in range((minval(minlength))): pair=a[i],b[i] interleave.append(pair) flat=flatten(interleave) c=a+b if len(b)>len(a): remainder=len(c)-len(a) for j in range(-remainder): extra=remainder[j] extralist.append(extra) if len(a)>len(b): remainder=len(c)-len(b) for j in range(-remainder): extra=remainder[j] final=flat+extralist return final but if I test it: >>> interleave([1,2,3], ["hi", "bye",True, False, 33]) [1, 'hi', 2, 'bye', 3, True] >>> The False and 33 don't appear. What is it that Im doing wrong?

  Read the article

• Find top N elements in a Multiset from Google Collections?

  - by dfrankow

  A Google Collections Multiset is a set of elements each of which has a count (i.e. may be present multiple times). I can't tell you how many times I want to do the following Make a histogram (exactly Multiset) Get the top N values from the histogram Examples: top 10 URLs, top 10 tags, ... What is the canonical way to do #2 given a Multiset? Here is a blog post about it, but that code is not quite what I want. First, it returns everything, not just top N. Second, it copies (is it possible to avoid a copy?). Third, I usually want a deterministic sort, i.e. tiebreak if counts are equal.

  Read the article

• Why increase pointer by two while finding loop in linked list, why not 3,4,5?

  - by GG

  I had a look at question already which talk about algorithm to find loop in a linked list. I have read Floyd's cycle-finding algorithm solution, mentioned at lot of places that we have to take two pointers. One pointer( slower/tortoise ) is increased by one and other pointer( faster/hare ) is increased by 2. When they are equal we find the loop and if faster pointer reaches null there is no loop in the linked list. Now my question is why we increase faster pointer by 2. Why not something else? Increasing by 2 is necessary or we can increase it by X to get the result. Is it necessary that we will find a loop if we increment faster pointer by 2 or there can be the case where we need to increment by 3 or 5 or x.

  Read the article

• If-statement with logical OR

  - by exiter2000

  public class Test{ public static void main(String args[]){ int a = 0; int b = 1; int c = 10; if ( a == 0 || b++ == c ){ a = b + c; }else{ b = a + c; } System.out.println("a: " + a + ",b: " + b + ",c: " + c); } } Ok, this is Java code and the output is a: 11,b: 1,c: 10 And I believe the C acts same as Java in this case That is because second condition(b++ == c) would never executed if the first condition is true in 'OR' operator. There is a "NAME" for this. I just don't remember what it is. Does anyone know what this is called?? Thanks in advance

  Read the article

• Is this a correct implementation of singleton C++?

  - by Kamal

  class A{ static boost::shared_ptr<A> getInstance(){ if(pA==NULL){ pA = new A(); } return boost::shared_ptr(pA); } //destructor ~A(){ delete pA; pA=NULL; } private: A(){ //some initialization code } //private assigment and copy constructors A(A const& copy); // Not Implemented A& operator=(A const& copy); // Not Implemented static A* pA; }; A* A::pA = NULL;

  Read the article

• CompareValidator works in listview's editItemTemplate but not in insertitemtemplate

  - by Sam

  Hi, I have a validation problem I have a listview, in the edit item template I have two composite controls with a textbox inside I put a comparevalidator on it <asp:CompareValidator ID="myCompareValidator" runat="server" ControlToValidate="mycompositecontrol1" ControlToCompare="mycompositecontrol2" Operator="GreaterThanEqual" Type="Date" Display="Dynamic" ErrorMessage="there is an error !" Text="!" ValidationGroup="myValidationGroup" /> It works great ! so I do exactly the same operation in the InserItemTemplate (It's a copy/paste) but this time, it doesn't work, I have no error message in my validationsummary and near my control to validate! If you know that problem, help me please thanks in advance

  Read the article

• Unreachable code detected in case statement

  - by alex

  I have a code: protected override bool ProcessCmdKey(ref Message msg, Keys keyData) { switch (keyData) { case Keys.Alt|Keys.D1: if (this._condition1) { return true; } else { return base.ProcessCmdKey(ref msg, keyData); } break; case Keys.Control |Keys.U: if (this._condition2) { return true; } else { return base.ProcessCmdKey(ref msg, keyData); } break; default: return base.ProcessCmdKey(ref msg, keyData); } return true; It gives me "unreachable code detected" warning on breaks. Is it good practice not to use break operator here ? I don't want to turn off "unreachable code detected" warning. PS: There are many case in my ProcessCmdKey method.

  Read the article

• C++ Word-Number to int

  - by Andrew

  I'm developing a program that makes basic calculations using words instead of numbers. E.g. five + two would output seven. The program becomes more complex, taking input such as two_hundred_one + five_thousand_six (201 + 5006) Through operator overloading methods, I split each number and assign it to it's own array index. two would be [0], hundred is [1], and one is [2]. Then the array recycles for 5006. My problem is, to perform the actual calculation, I need to convert the words stored in the array to actual integers. I have const string arrays such as this as a library of the words: const string units[] = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" }; const string teens[] = { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" }; const string tens[] = { "", "", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" }; If my 'token' array has stored in it two hundred one in index 0, 1, and 2, I'm not sure what the best way to convert these to ints would involve.

  Read the article

• What is the effect on record size of reordering columns in PostgreSQL?

  - by Summer

  Since Postgres can only add columns at the end of tables, I end up re-ordering by adding new columns at the end of the table, setting them equal to existing columns, and then dropping the original columns. So, what does PostgreSQL do with the memory that's freed by dropped columns? Does it automatically re-use the memory, so a single record consumes the same amount of space as it did before? But that would require a re-write of the whole table, so to avoid that, does it just keep a bunch of blank space around in each record? Thanks! ~S

  Read the article

• How do I handle editing of custom types in a C# datagridview?

  - by Ian Hopkinson

  I have a datagridview in which one column contains a custom class, which I have set using: dgvPeriods.Columns[1].ValueType = typeof(ExDateTime); It is rigged up to display correctly by handling the CellFormatting event, but I'm unsure what event to handle for cell editing. In the absence of doing anything I get a FormatException as the datagridview tries to convert String to ExDateTime as I try to move focus out of the edited cell. I tried adding type conversion to my ExDateTime custom class: public static implicit operator ExDateTime(string b) { return new ExDateTime(b); } But this this didn't work. I also tried handling the DataError event, but this seems to fire too late. The datagridview is not databound.

  Read the article

• What is Ruby's double-colon (::) all about?

  - by Meltemi

  I'd probably be able to answer this for myself if "::" wasn't so hard to Google. Didn't see anything on SO so thought I'd try my luck. What is this double-colon :: all about? I see it everywhere in Rails: class User < ActiveRecord::Base or… ActionController::Routing::Routes.draw do |map| I found a definition from this guy: The :: is a unary operator that allows: constants, instance methods and class methods defined within a class or module, to be accessed from anywhere outside the class or module. but that just leads to more questions. What good is scope (private, protected) if you can just use :: to expose anything?

  Read the article

• How do I do proximity search in Oracle right?

  - by hko19

  Oracle's NEAR operator for full text search returns a score based on the proximity of two or more query terms. For example: near((dog, bite), 6) matches if 'dog' and 'bite' occurs within 6 words. What if I'd like it to match if either 'dog' or 'cat' or any other type of animal occurs within 6 words of the word 'bite'? I tried: near(((dog OR cat OR animal), bite), 6) but I got: NEAR operand not a phrase, equivalence or another NEAR expression Rather than expanding all possible combination into multiple NEAR and 'or' them together, what is the proper way to write such query?

  Read the article

• Why do the following expanded if shorthand statements not work in javascript?

  - by PeanutsMonkey

  This is my first attempt to write shorthand if statements however am befuddled by why the expanded versions don't work quite the way I imagined they would. Code 1 - Does not work if(document.getElementById == true) { alert("The document object model is supported by: " + navigator.appName); } Code 2 - Does work if(document.getElementById != false) { alert("The document object model is supported by: " + navigator.appName); } Code 3 - The shorthand that does work if(document.getElementById) { alert("The document object model is supported by: " + navigator.appName); } Why is that if I expand the shorthand in 3 to the first code sample not work and why does it work if I have it equal to != false?

  Read the article

• MySQL Join Comma Separated Field

  - by neeraj

  I have two tables. First Table is a batch table that contain comma separated student id in field "batch" batch -------------- id batch -------------- 1 1,2 2 3,4 Second Table is marks marks ---------------------- id studentid subject marks 1 1 English 50 2 2 English 40 3 3 English 70 4 1 Math 65 5 4 English 66 6 5 English 75 7 2 Math 55 How we can find those students of first batch id =1 who have scored more than 45 marks in English without using sub query. Problem i found to get this done using a single query is that we can not use IN as an association operator in JOIN statement What changes are required in below query to make it work? SELECT * FROM batch INNER JOIN marks ON marks.studentid IN(batch.batch) where batch.id = 1

  Read the article

• How to display Preferences in a View

  - by Sybiam

  I'm building some sort of wizard to create user accounts in Sync and Manage account. I use a ViewFlipper my activity has to be an AccountAuthenticatorActivity. That said it also means I can't inherit PreferenceActivity. So I looked up in the code of PreferenceActivity and I believe it should be possible to have a PreferenceView that inherit from ListView. The Activity part of PreferenceActivity isn't really needed as far as I know. Though the PreferenceManager is what really blocks me. private PreferenceManager onCreatePreferenceManager() { PreferenceManager preferenceManager = new PreferenceManager(this, FIRST_REQUEST_CODE); preferenceManager.setOnPreferenceTreeClickListener(this); return preferenceManager; } This function imply that we can instatiate PreferenceManager using the operator new. Apparently, the sdk hide the constructor of the PreferenceManager. I'm kind of confused. Is there a way to inflate my preferences and display them without PreferenceActivity?

  Read the article

• Plotting a cumulative graph of python datetimes

  - by ventolin

  Say I have a list of datetimes, and we know each datetime to be the recorded time of an event happening. Is it possible in matplotlib to graph the frequency of this event occuring over time, showing this data in a cumulative graph (so that each point is greater or equal to all of the points that went before it), without preprocessing this list? (e.g. passing datetime objects directly to some wonderful matplotlib function) Or do I need to turn this list of datetimes into a list of dictionary items, such as: {"year": 1998, "month": 12, "date": 15, "events": 92} and then generate a graph from this list? Sorry if this seems like a silly question - I'm not all too familiar with matplotlib, and would like to save myself the effort of doing this the latter way if matplotlib can already deal with datetime objects itself.

  Read the article

• Forcing a templated object to construct from a pointer

  - by SalamiArmi

  I have a fictional class: template<typename T> class demonstration { public: demonstration(){} ... T *m_data; } At some point in the program's execution, I want to set m_data to a big block of allocated memory and construct an object T there. At the moment, I've been using this code: void construct() { *m_data = T(); } Which I've now realised is probably not the best idea... wont work under certain cirumstances, if T has a private assignment operator for example. Is there a normal/better way to do what I'm attempting here?

  Read the article

• Finding greatest product of two lists, but keep getting #unspecific

  - by user1787030

  (define (greatest-product lst1 lst2) (define (helper lst addtimes total toacc) (cond ((null? lst) '()) ((= (countatoms lst) 1) (display total)) ((= addtimes (cadr lst)) (helper (cdr lst) 1 total total)) (else (helper lst (+ 1 addtimes) (+ toacc total) toacc)))) (cond ((> (helper lst1 0 0 (car lst1)) (helper lst2 0 0 (car lst2))) (helper lst1 0 0 (car lst1))) ((< (helper lst1 0 0 (car lst1)) (helper lst2 0 0 (car lst2))) (helper lst2 0 0 (car lst2))) ((= (helper lst1 0 0 (car lst1)) (helper lst2 0 0 (car lst2))) (display 'equal)))) Scheme keeps returning back that it cannot perform the procedure with #unspecific Im running it with (display (greatest-product '(1 2 3) '(4 5 6))) (display (greatest-product '(1 2 3) '(1 2 3))) (display (greatest-product '(1 2 3) '())) what is wrong with it? the problem seems to be occurring

  Read the article

• C++'s std::string pools, debug builds? std::string and valgrind problems

  - by Den.Jekk

  Hello, I have a problem with many valgrind warnings about possible memory leaks in std::string, like this one: 120 bytes in 4 blocks are possibly lost in loss record 4,192 of 4,687 at 0x4A06819: operator new(unsigned long) (vg_replace_malloc.c:230) by 0x383B89B8B0: std::string::_Rep::_S_create(unsigned long, unsigned long, std::allocator<char> const&) (in /usr/lib64/libstdc++.so.6.0.8) by 0x383B89C3B4: (within /usr/lib64/libstdc++.so.6.0.8) by 0x383B89C4A9: std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string(char const*, unsigned long, std::allocator<char> const&) (in /usr/lib64/libstdc++.so.6.0.8) I'm wondering: does std::string (GCC 4.1.2) use any memory pools? if so, is there any way to disable the pools (in form of a debug build etc.)? Regards, Den

  Read the article

• Get the affinity of a SQLite column on Android

  - by Neil Traft

  The SQLite C library has a method, sqlite3_column_decltype(). But I cannot find any place where the Android SQLite API makes this method available. Is there any way to get the declared type of a column without running any SQL (i.e. can I avoid using PRAGMA table_info)? I could have used AbstractWindowedCursor.isBlob(), but it says that it will also return true if the field is NULL. I need something that will guarantee me a value equal to the column's declared type.

  Read the article

< Previous Page | 119 120 121 122 123 124 125 126 127 128 129 130  | Next Page >