Search Results

Search found 10883 results on 436 pages for 'ms expression'.

Page 264/436 | < Previous Page | 260 261 262 263 264 265 266 267 268 269 270 271  | Next Page >

  • Restrict characters used in a string

    - by Jeremy Rudd
    How do I restrict a string to whitelisted characters? // "HOW am I to understand; this is, BAD" $str = restrictTo($str,"0-9a-z,. "); // " am I to understand this is, " Is there an inbuilt function in PHP that does something close? I can't formulate a regular expression for this though :(

    Read the article

  • What's the differenct between passing a function and the function call itself in javascript?

    - by Mingus Rude
    In the application I'm building I'm polling for a status update and I have noticed that if the call is made as follows the timeout fires continuously: setTimeout($.get("http://localhost:8080/status", function(data) { UpdateStatus(data);}), 1000); While if use a function instead the timeout fires every 1000 ms: setTimeout(function() {$.get("http://localhost:8080/status", function(data) { UpdateStatus(data);})}, 1000); Why?

    Read the article

  • Using SQL Server for web applications

    - by rem
    As far as I understand, due to license reqirements all web applications, which use MS SQL Server, use SQL Server Express (free) or SQL Server web edition (processor license). Is it so? What are other specific features of SQL Server usage for web app?

    Read the article

  • What's the difference between 'service' and 'server'?

    - by bonefisher
    I can imagine that the 'server' can be a machine/host but can be also a program like ftp server, smtp server, etc.. The 'service' on the other hand refers mainly to applications/programms.. Why can then for example the Sql Server cannot be called as Sql Service? It has the same semanthics. Or the other way round: MS Azure service: why it isn't called Azure Server? :)

    Read the article

  • Function of: if(/(file|http).*/.test(url)) { }

    - by WmasterJ
    I am wondering what this technique is called and what it does. It seems to be validating some regular expression on the variable url. I am customizing another persons code: var url = document.getElementById("editorURL").value; if(/(file|http).*/.test(url)) { } Maybe someone has a link to an article that explains this a bit more in-depth?

    Read the article

  • How to create combobox with bitmaps

    - by Morpheus
    Hi ! I wanted to create a custom combo box like this (as in MS Word), Are there any Win32 API calls to get this job done, (like ChooseColor() or ChooseFont()? If there aren't any, can anyone please tell me how to do this? Thanks you. Regards,

    Read the article

  • Abstract over X

    - by Bruno Bieth
    Sorry for this english related question but I only came across that expression in the context of IT. What does abstracting over something mean ? For example abstracting over objects or abstracting over classes. Thanks

    Read the article

  • dragging toolbars

    - by Remus Rigo
    I created in my app 2 toolbars. Because I wanted to be able to drag them, I put both TToolBar components inside a TControlBar. I this case I can move them, but I want to be able to drag them like in MS Office (drag a toolbar from top and put it left, right or at bottom of the window and save it's position).... Can anyone help me out?

    Read the article

  • check that int array contains !=0 value using lambda

    - by netmajor
    hey, I have two-dimension array List<List<int>> boardArray How can I enumerate throw this array to check that it contains other value than 0 ? I think about boardArray.Contains and ForEach ,cause it return bool value but I don't have too much experience with lambda expression :/ Please help :)

    Read the article

  • passing Func<TSource, TKey> keySelector error

    - by user338429
    static void Main() { string[] a = { "a", "asd", "bdfsd", "we" }; a = a.OrderBy(fun).ToArray(); } private static int fun(string s) { return s.Length; } its is giving compile time error . I know that we can do this with Lambda expression like this. a.OrderBy(s=>s.Length).ToArray(); but i want to this do by defining different function . What mistake i have done?

    Read the article

  • C++ WCHAR: Cannot allocate an array of constant size 0

    - by Rosarch
    I'm trying to create a WCHAR: LONG bufferSize = foo.bar() + 1; WCHAR wszBaz[bufferSize]; The compiler issues an error: error C2057: expected constant expression error C2466: cannot allocate an array of constant size 0 error C2133: 'wszBaz' unknown size What am I doing wrong? UPDATE: I added const but it still gives the same error: const LONG bufferSize = foo.bar() + 1; WCHAR wszBaz[bufferSize];

    Read the article

  • Haskell Tuple Size Limit

    - by SHiNKiROU
    Why I can't construct large tuples in Haskell? Why there's a tuple size limit? Prelude> (1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1) <interactive>:1:0: No instance for (Show (t, t1, t2, ... t23)) arising from a use of `print' at <interactive>:1:0-48 Possible fix: add an instance declaration for (Show (t, t1, t2, ... t23)) In a stmt of a 'do' expression: print it

    Read the article

  • What's the fastest lookup algorithm for a key, pair data structure (i.e, a map)?

    - by truncheon
    In the following example a std::map structure is filled with 26 values from A - Z (for key) and 0 – 26 for value. The time taken (on my system) to lookup the last entry (10000000 times) is roughly 250 ms for the vector, and 125 ms for the map. (I compiled using release mode, with O3 option turned on for g++ 4.4) But if for some odd reason I wanted better performance than the std::map, what data structures and functions would I need to consider using? I apologize if the answer seems obvious to you, but I haven't had much experience in the performance critical aspects of C++ programming. #include <ctime> #include <map> #include <vector> #include <iostream> struct mystruct { char key; int value; mystruct(char k = 0, int v = 0) : key(k), value(v) { } }; int find(const std::vector<mystruct>& ref, char key) { for (std::vector<mystruct>::const_iterator i = ref.begin(); i != ref.end(); ++i) if (i->key == key) return i->value; return -1; } int main() { std::map<char, int> mymap; std::vector<mystruct> myvec; for (int i = 'a'; i < 'a' + 26; ++i) { mymap[i] = i - 'a'; myvec.push_back(mystruct(i, i - 'a')); } int pre = clock(); for (int i = 0; i < 10000000; ++i) { find(myvec, 'z'); } std::cout << "linear scan: milli " << clock() - pre << "\n"; pre = clock(); for (int i = 0; i < 10000000; ++i) { mymap['z']; } std::cout << "map scan: milli " << clock() - pre << "\n"; return 0; }

    Read the article

  • Algorithm performance

    - by william007
    I am testing an algorithm for different parameters on a computer. I notice the performance fluctuates for each parameters. Say I run for the first time I got 20 ms, second times I got 5ms, third times I got 4ms: But the algorithm should work the same for these 3 times. I am using stopwatch from C# library to count the time, is there a better way to measure the performance without subjecting to those fluctuations?

    Read the article

  • How do I debug a Unity Container "Resolve"?

    - by willem
    I'm using the MS Unity container to do dependency injection, but a "Resolve" is returning unexpected results. Is there an way I can debug this resolution? It would be great if I could view what Types/Instances are registered in the container, but I can't see where this is stored when using QuickWatch. It would also be useful if I could get the container to output some debug Traces. Any suggestions?

    Read the article

  • Linq List contains specific values.

    - by Raffaeu
    I need to know if the List I am working with contains only some specific values. var list = new List<string> { "First", "Second", "Third" }; If I want to know if the List contain at least one item with the value "First" I use the Any keyword: var result = list.Any(l => l == "First"); But how I can write a Linq expression that will return true/false only if the List contains "First" and "Second" values?

    Read the article

  • Converting upper-case string into title-case using Ruby

    - by wsb3383
    Hi, all. I'm trying to convert an all-uppercase string in Ruby into a lower case one, but with each word's first character being upper case. Example: convert "MY STRING HERE" to "My String Here". I know I can use the .downcase method, but that would make everything lower case ("my string here"). I'm scanning all lines in a file and doing this change, so is there a regular expression I can use through ruby to achieve this? Thanks!

    Read the article

  • Need some help with a NHibernate Query

    - by cwap
    Hi all Say I got 3 entities: Business, Employee and Payment. A payment has a foreign key to an Employee, while the Employee has an foreign key to a business. Now, I want to create a query which gives me all payments for a given business. I really don't have a clue about how to do this - I guess I want something like: mySession.CreateCriteria<Payment>() .Add(Criterion.Expression.Eq(/* Employee_FK => Employee.Business_FK == BusinessID */); Any help would be greatly appreciated :)

    Read the article

  • Custom Control in Silverlight ListBox

    - by jaime
    I have a custom control I created from a expression design I created and exported to xaml. I have put in it a bound itemtemplate/datatemplate of a ListBox contorl. It doesn't seem to be rendering more than once and/or it is rendering each item in the same place(kind of like the same x,y coordinates.

    Read the article

  • OrderBy on children in a LINQ Query

    - by eka808
    Hello everybody I have a user entity who contains a one to many relationship with a role entity So with this linq expression : from user in USER_TABLE.Include("USERROLE_TABLE") order by user.Name select user I can get users with related roles as a child. My problem is that i want to get roles of each user ordered alphabetically. How can i do that ? I googled a lot and don't find anything Thank's by advance !

    Read the article

< Previous Page | 260 261 262 263 264 265 266 267 268 269 270 271  | Next Page >