Hello,
I would like to compare 4 character string using wildcards.
For example:
std::vector<std::string> wildcards[]=
{"H? ", "RH? ", "H[0-5] "};
/*in the last one I need to check if string is "H0 ",..., and "H5 " */
Is it possible to manage to realize only by STL?
Thanks,
Arman.
The variable returns MINGW32_NT-5.1 or CYGWIN_NT-5.1. (yea, dot at the end)
Need to compare that given var contains NT-5.1 positioned anywhere.
Using cygwin and would like to be compatible with pretty much any *nix.
I'm trying to validate that a user only enters a long value as input (long bigger than 0 actually).
Compare and Range validator has DataTypeCheck for int values only. I was planning on using this class in a CustomValidator but then I would need to write both, client and server side validation code.
Do you know of any other good way of doing this? Thanks!
I would like an algorithm that will grab all the nodes that are attached to one particular node. I thought it would be easy but it eludes me at a certain point. Would love to find something to compare my algorithm to know where I went wrong..
Is data processing a part of business intelligence tools? If no how else is it done or if yes can you give a few examples.
My use case: I am using pentaho reporting to generate tables and graphs of my test data. Now I want to compare the data against the spec and see if it passes or fails and report the same. The spec is also in the database. How best to do it?
I would like an algorithm that will grab all the nodes that are attached to one particular node. I thought it would be easy but it eludes me at a certain point. Would love to find something to compare my algorithm to know where I went wrong..
I have some data like this :
1, 111, 2, 333, 45, 67, 322, 4445
NSArray *array = [[myData allKeys]sortedArrayUsingSelector: @selector(compare:)];
If I run this code, it sorted like this:
1, 111, 2,322, 333, 4445, 45, 67,
but I actually want this:
1, 2, 45, 67, 111, 322, 333, 4445
How can I implement it? thz u.
I am creating lists in my android app and would like to capture the text of the list item that is clicked but I want to do it in a seperate function so I only have to write the code once. And I want to be able to compare the string to another sting.
What is the best way to do this?
I want to grep an environment variable
env | grep ABC_IJK[1,2]
currenlty defined variables are like this
ABC_IJK1=123
ABC_IJK1_XYZ=sn123:345
ABC_IJK2=999
ABC_IJK2_XYZ=sn321:999
I only want to get only this
ABC_IJK1=123
ABC_IJK2=999
get number of connections sum them(not 123 + 999) and save in N1 (this one has 2 connection)
so N1=2
get number of connections sum them and save in N2 for other machine (if this have four)
so N2=4
If the value is not there or the variable is not present then N1=1 for below:
ABC_IJK1=
ABC_IJK2=123
Then need to compare it with a MAX_CONNECTION variable
Thanks
I saw something from an "execution plan" article:
10 rows fetched in 0.0003s (0.7344s)
How come there are 2 durations shown? What if I don't have large data set yet. For example, if I have only 20, 50, or even just 100 records, I can't really measure how faster 2 different SQL statements compare in term of speed in real life situation? In other words, there needs to be at least hundreds of thousands of records, or even a million records to accurately compares the performance of 2 different SQL statements?
I have a critical method in an Objective-C application that I need to optimize as much as possible. I first need to take some easy benchmarks on this one single method so I can compare my progress as I optimize.
What is the easiest way to track the execution time of a given method in, say, milliseconds, and print that to console.
If I use String.intern() to improve performance as I can use "==" to compare interned string, will I run into garbage collection issues. How does the garbage collection mechanism of interned strings differ from normal strings ?
ok i have meet following problem too for example there is given two text find longest string that occur in both i think we should cretate string array where we should put common srings and then compare their length and which length will be largest print it is there fast method?
In another question, the accepted answer suggested replacing a (very cheap) if statement in Python code with a try/except block to improve performance.
Coding style issues aside, and assuming that the exception is never triggered, how much difference does it make (performance-wise) to have an exception handler, versus not having one, versus having a compare-to-zero if-statement?
I'm somewhat familiar with Wordpress and I've used it a little. There is a huge community with tons of plugins and themes etc. Does the BlogEngine.Net compare favorably? Is there another .NET CMS that you would recommend?
Thanks for your help.
Is it possible to restrict direct access to PHP file if I use jquery .load function like this one:
$(document).ready(function(){
$("#second").load("testip.php");
});
In this case I want to restrict direct access to file testip.php that will instert data in database.
Can I do it using some PHP function that will compare visitors IP address and server IP at "testip.php" file or there is some better way to do it?
The options for source code diff viewing/editing/merging seem to be:
Free:
Tortoise Merge
Meld *
WinDiff
WinMerge *
DiffMerge *
KDiff
AJC Diff
Commercial:
Total Commander's Diff viewer *
Beyond Compare *
Delta Walker *
Araxis Merge *
Are there any other options? (Wikipedia suggests a few)
What's your favorite tools for source code diff? And how does it differ from the ones in the list?
* Supports directory diffs
i am trying to read a username and a password from a file in x86 assembly for the perpose of authentication
obviously the file consists of two lines , the user name and the password how can i read the two lines seperately and compare them?
My attempt:
proc read_file
mov ah,3dh
lea dx,file_name
int 21h
mov bx, ax
xor si,si
repeat:
mov ah, 3fh
lea dx, buffer
mov cx, 100
int 21h
mov si, ax
mov buffer[si], '$'
mov ah, 09h
int 21h ;print on screen
cmp si, 100
je repeat
jmp stop;jump to end
stop:
RET
read_file ENDP
A few years ago, I did a survey of DbC packages for Java, and I wasn't wholly satisfied with any of them. Unfortunately I didn't keep good notes on my findings, and I assume things have changed. Would anybody care to compare and contrast different DbC packages for Java?
Is there a way of getting a contract from a running service programatically? I want to compare the contract of a running service from a referenced contract in the client side.
Hello.
I am using javasound and have an AudioInputStream of format
PCM_SIGNED 8000.0 Hz, 16 bit, stereo, 4 bytes/frame, little-endian
Using AudioSystem.getAudioInputStream(target_format, original_stream) produces an 'IllegalArgumentException: Unsupported Conversion' when the target_format is PCM_SIGNED 8000.0 Hz, 16 bit, mono, 2 bytes/frame, little-endian
Is it possible to convert this stream manually after every read() call? And if yes, how?
In general, how can you compare two formats and tell if a conversion is possible?
I'm learning perl and everytime I search for perl stuff in the internet I get some random page with people saying that perl should die because code written in it looks like a lesson in steganography. Then they say that python is clean and stuff like that. Now, I know that those comparisons are always stupid and made by fellows that feel that languages are a extension of their boring personality so, let me ask instead: can you give me the implementation of a widely known algorithm to deal with a data structure like red-black trees in both languages so I can compare?
More than a question, per se, this is an attempt to compare notes
with other people. I wrote a generic History class that emulates
the functionality of a browser's history. I am trying to wrap my
head around how far to go when writing unit tests for it. I am
using NUnit. Please share your testing approaches below.
The full code for the History class is here (http://pastebin.com/ZGKK2V84).
in c# what does exactly happen in the background when you do a comparison with the "==" operator on two objects? does it just compare the addresses? or does it something like Equals() or CompareTo() ?
PS: what about the "==" operator in java? does it behave the same?