Search Results

Search found 21748 results on 870 pages for 'search engine'.

Page 696/870 | < Previous Page | 692 693 694 695 696 697 698 699 700 701 702 703  | Next Page >

• How to make use of c++ xpcom component from javascript xpcom component.

  - by Prashant

  I have developed a xpcom component using c++. I have GetHWND() method in my component. I have also developed another xpcom component using javascript. I want to make use of GetHWND function in javascript xpcom component. I am using following code to do so. netscape.security.PrivilegeManager.enablePrivilege("UniversalBrowserRead"); netscape.security.PrivilegeManager.enablePrivilege("UniversalXPConnect"); var myComponent = Components.classes['@dougt/WebLock'].createInstance(Components.interfaces.IWebLock); myComponent = myComponent.QueryInterface(Components.interfaces.IWebLock); var res = myComponent.GetHWND(mainWindow.content.document); But it is giving error as "ReferenceError: netscape is not defined". I did google search but did not find the solution to it. I am using Mozilla Firefox and I want it to get worked for the same. Please help me to come out of this problem. Thanks in advance.

  Read the article

• Programming Environment that runs directly on the iPhone or iPad?

  - by lexu

  Is there a development environment that runs directly on an the iPhone OS? I will be without access to a computer/internet for some time, but will have the use of an iPad (WiFi, jailbroken). Do you know of any way to dabble with programming directly on the device. Since apple is commit to not let it happen, I assume I will have to find such an environment on cydia (or a 'similar' site). I don't seem to be able to find the correct google incantations (search terms) to locate such a package.

  Read the article

• What to do with syncobj in SQL Server

  - by hgulyan

  Hi. I run this script to search particular text in sys.columns and I get a lot of "dbo.syncobj_0x3934443438443332" this kind of result. SELECT c.name, s.name + '.' + o.name FROM sys.columns c INNER JOIN sys.objects o ON c.object_id=o.object_id INNER JOIN sys.schemas s ON o.schema_id=s.schema_id WHERE c.name LIKE '%text%' If I get it right, they are replication objects. Is it so? Can i just throw them away from my query just like o.name NOT LIKE '%syncobj%' or there's another way? Thank you.

  Read the article

• Transportation Web App - utilizing google or bing map api

  - by BillS

  I am working on a transportation web app and I am having a bit of a problem. First, I want to be able to define a shipping corridor, say like I-95 between Baltimore MD and Richmond VA. And store what parameters I need to define this route. Users will then use a web interface and can select various routes, in this case, I-95. Vendors will be posting constantly changing pickup locations in the application database which have a shelf life of about 2 days. Some of these locations maybe along this route. I am storing the LAT and LONG for the specific location right now. If any of these points ARE along or within 2 mile of the route (just off the highway basically - the ideal check would based on an actual highway exit but at this point anything would work), I want them to show up in my search results. Any ideas or suggestions?

  Read the article

• Finding the longest road in a Settlers of Catan game algorithmically

  - by Jay

  I'm writing a Settlers of Catan clone for a class. One of the extra credit features is automatically determining which player has the longest road. I've thought about it, and it seems like some slight variation on depth-first search could work, but I'm having trouble figuring out what to do with cycle detection, how to handle the joining of a player's two initial road networks, and a few other minutiae. How could I do this algorithmically? For those unfamiliar with the game, I'll try to describe the problem concisely and abstractly: I need to find the longest possible path in an undirected cyclic graph.

  Read the article

• Using COALESCE to avoid dynamic SQL ?

  - by krul

  I would like to use following sql to avoid constructing sql dynamically: SELECT CommentID, Comment, FROM Comments --if Author id is not null then filter upon author id otherwise get all comments (ignore author id) WHERE AuthorID LIKE COALESCE(@AuthorId, '%') --if comment type is present filter upon it, otherwise get all comments (ignore comment type condition) AND CommentType LIKE COALESCE(@CommentType, '%') I want to know is that safe way to approach this problem? EDIT: Here is final code that satisfy my need to ignore search parameter if is null and applied it if is present: SELECT CommentID, Comment, FROM Comments --if @AuthorId is not null then filter upon @AuthorId otherwise get all comments (ignore author id) WHERE AuthorID = COALESCE(@AuthorId, AuthorID) --if @CommentType is present filter upon it, otherwise get all comments (ignore comment type condition) AND CommentType = COALESCE(@CommentType, CommentType)

  Read the article

• const TypedeffedIntPointer not equal to const int *

  - by dirk

  I have the following C++ code: typedef int* IntPtr; const int* cip = new int; const IntPtr ctip4 = cip; I compile this with Visual Studio 2008 and get the following error: error C2440: 'initializing' : cannot convert from 'const int *' to 'const IntPtr' Clearly my understanding of typedefs is not what is should be. The reason I'm asking, I'm storing a pointer type in a STL map. I have a function that returns a const pointer which I would like to use to search in the map (using map::find(const key_type&). Since const MyType* and const map<MyType*, somedata>::key_type is incompatible, I'm having problems. Regards Dirk

  Read the article

• How can web form content be preserved for the back button

  - by Peter Howe

  When a web form is submitted and takes the user to another page, it is quite often the case that the user will click the Back button in order to submit the form again (the form is an advanced search in my case.) How can I reliably preserve the form options selected by the user when they click Back (so they don't have to start from scratch with filling the form in again if they are only changing one of many form elements?) Do I have to go down the route of storing the form options in session data (cookies or server-side) or is there a way to get the browser to handle this for me? (Environment is PHP/JavaScript - and the site must work on IE6+ and Firefox2+)

  Read the article

• Solving the water jug problem

  - by Amit

  While reading through some lecture notes on preliminary number theory, I came across the solution to water jug problem (with two jugs) which is summed as thus: Using the property of the G.C.D of two numbers that GCD(a,b) is the smallest possible linear combination of a and b, and hence a certain quantity Q is only measurable by the 2 jugs, iff Q is a n*GCD(a,b), since Q=sA + tB, where: n = a positive integer A = capacity of jug A B= capacity of jug B And, then the method to the solution is discussed Another model of the solution is to model the various states as a state-space search problem as often resorted to in Artificial Intelligence. My question is: What other known methods exist which models the solution, and how? Google didn't throw up much.

  Read the article

• Fast rectangle to rectangle intersection

  - by Jeremy Rudd

  What's a fast way to test if 2 rectangles are intersecting? A search on the internet came up with this one-liner (WOOT!), but I don't understand how to write it in Javascript, it seems to be written in an ancient form of C++. struct { LONG left; LONG top; LONG right; LONG bottom; } RECT; bool IntersectRect(const RECT * r1, const RECT * r2) { return ! ( r2->left > r1->right || r2->right left || r2->top > r1->bottom || r2->bottom top ); }

  Read the article

• Visual Studio bug ~ can anyone duplicate?

  - by drachenstern

  In Visual Studio 2010 Pro (Version 10.0.30319.1 RTMRel), I noticed tonight that for some reason I kept getting a wider window for quick find, but thought I was losing my mind. So I exited, restarted, etc to verify. Here's my repro steps Open existing project (I don't think it matters which one) Press ctrlf and give it something to search for (?) Press enter Press ctrlf Press enter goto 4 Can you reproduce a slowly expanding quick find window? Do I have some sort of wacky bugged out system? I'ld obviously like to submit a bug report to MS if this is indeed a viable repro.

  Read the article

• Office Interop addins installer?

  - by jimbojw

  I have three C# Solutions in Visual Stuido 2008, one each for Word, Excel and PowerPoint using interop to hook various events. In each Solution, I have exactly one class, the one created by default when using File - New - Project - Visual C# - Office - 2007. Now that I have my addins working properly, it's time to create an installer. I understand that I may also have to distribute the PIAs. I would like my installer to register itself such that it can be uninstalled via the normal Add/Remove Programs mechanism. My organization is somewhat standardized around WiX for creating installers, but I'm open to any suggestions. How do I produce an MSI or EXE capable of installing my addins? GUI/wizard for the installer is not necessary. I'm happy to RTFM - so far all the tutorials I've found only explain how to create the project and do some of the coding. Maybe I'm using the wrong search terms? Thanks in advance for any help!

  Read the article

• Visual Studio 2008 - formatting/control characters/marks

  - by AL

  Hi, I don't know what I did but somehow the IDE has started displaying a green dot whenever I press spacebar and a green arrowhead whenever I press TAB. The source has become littered with these characters all over and I am finding it very difficult to code in the presence of so many formatting marks. I have tried to search a solution on Google but couldn't perhaps enter the right keywords so haven't been able to fix the behavior. Is there any way I can stop VS2008 IDE from littering my source code with these green dots and arrowheads whenever I press spacebar/tab? I would be really thankful for this help. Thanks, -AL PS: Re-posting the question as I am new to this forum and probably couldn't see the email notification option earlier. My apologies for this inconvenience.

  Read the article

• BeautifulSoup, but for CSS?

  - by MTsoul

  BeautifulSoup parses HTML and offers various ways to manipulate and search within HTML. Is there something similar for CSS? Specifically, I'd like to know if a given HTML text is rendered as bold. Either it has an ancestor that is the <strong> or the <bold> tag (which can be done with BeautifulSoup), or it has an ancestor (or itself) that has CSS attributes with font-weight: bold. Is this possible without resulting to writing my own library?

  Read the article

• Excel VBA to check autofilter for data

  - by cav719

  I need help checking for autofiltered rows not including the header. I want it to give a message box "No records found." then exit sub or continue with copy paste if there are rows beyond the header row. I know I need an If/Else entry after the filter to check for data but I'm having trouble figuring how to check. This code is being done from a UserForm I created. Here is my script: Private Sub Searchbycompanyfield_Click() If CompanyComboBox1.Value = "" Then MsgBox "Please enter a Company to begin search." Exit Sub End If ActiveSheet.Range("$A:$H").AutoFilter Field:=1, Criteria1:=EQDataEntry.CompanyComboBox1.Value, Operator:=xlOr Cells.Select Selection.Copy Sheets("Sheet2").Select Range("A5").Select ActiveSheet.Paste Call MessageBoxYesOrNoMsgBox End Sub Any help would be greatly appreciated.

  Read the article

• How do I use timezones with a datetime object in python?

  - by jidar

  How do I properly represent a different timezone in my timezone? The below example only works because I know that EDT is one hour ahead of me, so I can uncomment the subtraction of myTimeZone() import datetime, re from datetime import tzinfo class myTimeZone(tzinfo): """docstring for myTimeZone""" def utfoffset(self, dt): return timedelta(hours=1) def myDateHandler(aDateString): """u'Sat, 6 Sep 2008 21:16:33 EDT'""" _my_date_pattern = re.compile(r'\w+\,\s+(\d+)\s+(\w+)\s+(\d+)\s+(\d+)\:(\d+)\:(\d+)') day, month, year, hour, minute, second = _my_date_pattern.search(aDateString).groups() month = [ 'JAN', 'FEB', 'MAR', 'APR', 'MAY', 'JUN', 'JUL', 'AUG', 'SEP', 'OCT', 'NOV', 'DEC' ].index(month.upper()) + 1 dt = datetime.datetime( int(year), int(month), int(day), int(hour), int(minute), int(second) ) # dt = dt - datetime.timedelta(hours=1) # dt = dt - dt.tzinfo.utfoffset(myTimeZone()) return (dt.year, dt.month, dt.day, dt.hour, dt.minute, dt.second, 0, 0, 0) def main(): print myDateHandler("Sat, 6 Sep 2008 21:16:33 EDT") if __name__ == '__main__': main()

  Read the article

• Encode URL while send ajax

  - by meotimdihia

  I use cakePHP and it generate ajax /animemanga/animes/search/page:1?type%5B0%5D=3&amp;genre%5B0%5D=20&amp;genre%5B1%5D=4&amp;info%5B0%5D=episodes&amp;info%5B1%5D=released&amp;info%5B2%5D=rating&amp;info%5B3%5D=synopsis&amp;info%5B4%5D=completed&amp;info%5B5%5D=rating_count&amp;info%5B6%5D=name&amp;info%5B7%5D=id&amp;info%5B8%5D=name&amp;info%5B9%5D=id cakePHP encoded: & = &apm; will create error while use with Ajax. I use Jquery, browser Opera. how can this solve ?

  Read the article

• trying to find if a file exists in a given path

  - by Yeshwanth Venkatesh

  I am fairly new to java and I am trying to find if the file specified in the LINUX path exists. private void validateFilePath(String filePath) { File dir = new File(filePath); if(dir.exists()){ System.out.println("File exists in the path " + dir); setTARGET_IMG_DIR("filePath"); return; }else{ System.out.println("File does not exists in the path: " + dir); return; } } The dir.exists works fine if I give a absolute path from my root like this /Users/yv/Documents/Eclipse-workspace/InputParser/bin/test.txt but if I give a relative path like test.txt or /InputParser/bin/test.txt it says files does not exists. I am planing on creating a jar of this projects and hence this should work with both relative path(files in the same directory) and absolute path from the root. How can I handle this ? Is it possible to search for the absolute path of that file from the root and append it to the file name ?

  Read the article

• what is this called? and how to achieve it?

  - by user287745

  i would like to make a WRITE A NEW POST page similar to asp.net or how to make a page similar to http://stackoverflow.com/questions/ask please note, i do not want reference to already made controls like free rich text editor etc i would like to do the required coding my self any guidance will be appreciated i would also like to know what is the name given to this kind of page? as i search google for how to make a post and it comes up with et and post methods of html initial attempt:- on button click post back event within the update plane, literal1.text=textbox1.text assuming that user will provide formats like bold, but the textbox is not taking any such input.

  Read the article

• doubt about radio button mysql php beginner

  - by Marcelo

  Hi, i'm an engineering student and i'm developing a simple software based on html,php and mysql. I learned this topics on w3schools, i know only the basics. I tired to search about this in this website but I thought the doubts about php,mysql, radio buttons but they were much more complex than I need, and that i could understand. Sorry for the english. (Q1)Ex: $email=$_REQUEST['email'] , in this case the input is text, if it where like a radio button for ex: sex: male or female, how would it be? (Q2) what would be the type of this field (for exemple sex in question 1) in the database: text, int, varchar ? thanks for the attention

  Read the article

• MySQL, how can I SELECT WHERE one field value doesn't occurs in another?

  - by Jules

  I'm trying to do a search on my test server, speed isn't so important. I want to find if a phrase, the whole contents of one field, occurs in any part (as a whole) doesn't occur in another field. Heres my current query which finds if the phrase does occur SELECT pads.padid, pads.programname, keywords.word FROM Pads JOIN keywords ON Pads.Padid = keywords.Padid WHERE pads.Programname = keywords.word AND RemoveMeDate = '2001-01-01 00:00:00' My problem is that the field word contains other words too. I need to produce a count of where there isn't a keywords record with keywords.word equal to pads.programname ? EDIT: So if I have these records Pads: PadID=3 ProgramName=my prog PadID=4 ProgramName=Bad prog PadID=5 ProgramName=Good prog PadID=6 ProgramName=other prog Keywords: PadID=3 word=fox prog PadID=3 word=pig prog PadID=4 word=big prog PadID=4 word=nice prog PadID=5 word=fox prog PadID=6 word=bad prog PadID=6 word=fox prog The query I want would retun a count of 3 and record 6 has bad prog

  Read the article

• 3 hash functions to best hash sliding window strings for a bloom filter with minimum collisions

  - by Duaa

  Hi all: I need 3 hash functions to hash strings of a sliding window moving over a text, to be used later to search within a bloom vector. I'm using C# in my programming I read something about rolling hash functions and cyclic polynomials, they are used for sliding window applications. But really, I did not find any codes, they are just descriptions So please, if anyone have any idea about 3 best C# hash functions to use with sliding window strings of fixed size (5-char), that consume less time and have minimum number of collisions, either they are rolling hash functions or others, please help me with some C# codes or links to hash functions names Duaa

  Read the article

• Regular Expression Help - Brackets within brackets

  - by adbox

  Hello I'm trying to develop a function that can sort through a string that looks like this: Donny went to the {park|store|{beach with friends|beach alone}} so he could get a breath of freash air. What I intend to do is search the text recursively for {} patterns where there is no { or } inside the {}, so only the innermost sandwiched text is selected, where I will then run a php to array the contents and select one at random, repeating process until the whole string has been parsed, showing a complete sentence. I just cannot wrap my head around regular expressions though. Appreciate any help!

  Read the article

• ldapsearch and vcard creation

  - by Aaron Hoffman

  I'm using openldap on Mac OS X Server 10.6 and need to generate a vcard for all the users in a given group. By using the ldapsearch I can list all the memberUid's for all users in that group. I found a perl script (Advanced LDAP Search or ALS) that was written by someone that will generate the vcard easily. ALS can be found here http://www.ldapman.org/tools/als.gz So what I need to do is create a wrapper script (in python or perl) that will effectively loop through the memberUid's and run the ALS command to create the vcard and append it to the file. This command provides the memberUid's: ldapsearch -x -b 'dc=ldap,dc=server,dc=com' '(cn=testgroup)' Then running ALS gives the vcard: als -b dc=ldap,dc=server,dc=com -V uid=aaronh > vcardlist.vcf If it's easier to do this using Perl since ALS is already using it that would be fine. I've done more work in python but I'm open to suggestions. Thanks in advance, Aaron

  Read the article

• Custom Validator with an OR Condition

  - by zSysop

  Hi all, Right now i have an asp.net 2.0 app which allows a user to search by the following fields Location (Required if there is nothing in idnumber field) Address (Required if there is nothing in idnumber field) Zip (Required if there is nothing in idnumber field) **OR** IDNumber. (Required if there is nothing in any of the other fields) What i'd like to be able to do is validate this client side on button click and display a summary of errors. i.e. if a user leaves every criteria blank. I'd like to display "You must enter a IDNumber or "Location, Address, and Zip to continue" I've never used the Custom Validation control so here are some questions. 1) Is it able to do this? 2) Does anyone have an example of how to do this? Thanks

  Read the article

< Previous Page | 692 693 694 695 696 697 698 699 700 701 702 703  | Next Page >