Search Results

Search found 9727 results on 390 pages for 'general concepts'.

Page 276/390 | < Previous Page | 272 273 274 275 276 277 278 279 280 281 282 283  | Next Page >

• VS2010 patch: why it's take so much time to install it? [closed]

  - by Mendy

  Visual Studio 2010 RC has a few of patches release. For more information about them take a look here. What I'm expect from patch program, is to replace a few dll's of the program to a new fixed version of them. But when I run each of this 3 patches, they take a lot of time (5 minutes each), and you think that the program was frozen because the progress bar stay on the begging. This is question may not be so important, but it really interesting me to know, why this happens? It's really confusing to see that each VS2010 (or Microsoft in general) is frozen to 4-5 minutes.

  Read the article

• [PHP] Variables loaded from a separate script are not defined within functions

  - by Goro

  Hello, I use settings.php to store general settings for my application. When I load this settings file, I can use the variables defined in settings.php in the script itself, but not within any functions I define in it. For example, in my class definition, myclass.php: <?php $preIP = dirname(__FILE__); require_once( "preIP/settings.php" ); class MyClass { ... public function foo() { echo $variable_from_settings; } } The code in the function foo() will not work (the variable will not be defined). The settings.php file looks like this: $variable_from_settings = "bar"; Thanks,

  Read the article

• How to know if the argument that is passed to the function is a class, union or enum in c++?

  - by Narek

  I want to define an operator<< for all enums, to cout the value and print that it is an enum like this: code: enum AnyEnum{A,B,C}; AnyEnum enm = A; cout << enm <<endl; output: This is an enum which has a value equal to 0 I know a way of doing this with Boost library by using is_enum struct. But I don’t understand how it works. So that's why, in general, I am interested how to identify if the veriable is a class type, union type or an enum (in compile time).

  Read the article

• Drupal and Back-End Complexity

  - by Brian

  Currently I am working on a school website, and we are still in the decision-making process of choosing a framework (we know that we're not using Joomla! or hand-coding). Drupal came up as a viable choice, and currently, that is my best bet for the site. However, I have an issue with CMS's in general. I would like to develop a quite complicated and specifically custom-suited back-end application for teachers to interact with individual students, including the design of shared/custom calendars, announcement privileges, etc. I currently have a bit of expertise with HTML, CSS, PHP, MySQL, and I could wrap my head around some JavaScript and AJAX stuff if need-be. However, would such a complicated application work with Drupal (in that I could create it to specifically suite my purposes)?

  Read the article

• How to filter/sort/rank object model nodes?

  - by BCS

  I have some kind of object model and I need to filter and sort it's nodes for some kind of property. What kinds of automated systems exist to generate and select properties of the object model that correlate to what I want? (I'm intentionally being abstract and non-specific) I'm thinking of a system that works kind of like spam filters or supervised classification systems in that given an example data set it identifies rules that find nodes of interest. However I'm looking for a more general system in that it shouldn't require any design time information about the object model. It should work equality well as a spam filter on e-mail, a bug finder on a code base, an interest filter in a newsgroup or bot accounts finder on a social networking site. As long as it can explore the object model via reflection and be given a set of "interesting" nodes, it should be able to find rules that will find more nodes like them.

  Read the article

• How to show a window that acts like a popup menu?

  - by Edwin

  Hi, When window A is show, I want to show another none-modal popup window B, but: I don't want window A to become inactive due to window B becomes the front window; I want that when window B is focused, I pull down a combo box control on window A with one click (generally you have to click twice, one for moving the focus to window A and the second for pulling down the combo box); As you can see, the window B that I want is something like a more usable popup window like a popup menu (which is less a obstacle than a general none-modal window when you want it to get away by clicking on any other part of the parent window). Am I clear on my question? Thank you.

  Read the article

• Does this pattern have a name?

  - by LK7jb

  Disclaimer: I'm trying to learn proper OO programming/design, so I'm pretty new to this stuff. I guess this is a general design patterns question, but I'll base my example on a game engine or something that renders objects to the display. Consider the following: How can this sort of separation between physical objects (e.g., cubes, spheres, etc.) and the rendering mechanism be achieved in an extensible manner? This design is not set in stone, and perhaps I've got something wrong from the start. I'm just curious as to how a problem like this is solved in real world code.

  Read the article

• How do I make dynamic windows in Swing?

  - by Roman

  I have a general question. I would like to have a window containing some buttons, radio buttons, text fields and so on. So, user can do something (write text, select options and press buttons). As the result of the user activity window should change it structure/appearance some element should disappear and some appear. How do I program such "updates"? Should I close an old window and open a new one or I can modify content of window without closing it?

  Read the article

• Is it possible to exclude folders from a web application project in vs 2010?

  - by JL

  I had previously asked this question. At the time I was working with VS 2008. To restate the question. I have a web application that generates 1000's of small xml files in a certain directory. I would like to exclude this directory from the web application project in visual studio 2010. With vs 2008 it was not possible. Has anything changed? Besides the general wait for VS to iterate through this directory and add an item in the solution explorer for each file, it also strains my system resources, so I would like to exclude it from the project, but the dir and files need to physically exist on disk, because they are part of the application. Any OOB VS 2010 solutions, or any good workarounds? Thanks Update: This also sums up the issue nicely http://forums.asp.net/t/1179077.aspx

  Read the article

• What are the merits of using the various VCS (Version Control Systems) that exist to track Drupal pr

  - by ZoFreX

  I'm trying to find the best version control strategy for my workflow with Drupal. I have multiple sites per install and I'm pretty sure I'll have a separate repository for each website. As far as I know, the VCSs worth considering are: SVN Bazaar (bzr) Git Mercurial (hg) I know how these compare to each other in general, but want to learn their merits/demerits for Drupal. If you're using (or have used) any of these for Drupal: What is your setup? What about the VCS you chose works well for managing Drupal projects? What doesn't?

  Read the article

• Is this a valid C statement ?

  - by Philando Gullible

  Lets say I write char c[99] = {'Stack Overflow'}; in C or C++ it does compiles fine but does this valid? By valid I meant not invoking any kind of undefined or unspecified behavior. Again if I write char c[99] = 'Stack Overflow'; gcc complains about multicharacter constant which is obvious but in the above when I am enclosing within curly brackets compiler is happy! why is it so ? I also notice that puts(c); after the first statement will output 'w' precisely the last character of a general string in-place of Stack Overflow. why so ? Could somebody explain this behavior may be separately.

  Read the article

• How do I create a certain control using Windows Forms in Visual C++?

  - by Dalze

  I am new to using Windows Forms in C++ (and just in general), and I am not exactly sure of the name or if it's even possible to do. Currently I am currently working on a school project in which we must make a program for an imaginary bookstore. I am trying right now to make a sort of list that shows what the "customer" is buying. I have to make it sort by price and ISBN and any other variable that the book has. In essence I am trying to make something like the following: I just need to know how to get started. I can't figure out what the name of the control is or how to even get it to sort every time the user clicks on the header.

  Read the article

• How i can connect the buttons to next pages and create multiple pages?

  - by ejaa

  How can i connect buttons in the example of this Project. zip Here's the link of the file--- (http://www.2shared.com/file/12046081/65fad040/Project.html). Example: Button General Information connect to 3rd page, button Trainer information connect to the next pages number. May i need to create a new .h/.m/xib file for each of the pages?? then, where's the code to connect the button to the page. Also , how (the steps) to make it true?? All of your replies i thank you all first. Very appreciated it =)

  Read the article

• iqueryable select/where not working

  - by Steve

  I have two tables Boxer and Prospect. Boxers has general stuff like name and and dob etc and a BoxerId While Prospect contains only one value (at the moment) which is a boxerId. If a boxer is a prospect(up and coming boxer) there Id will be in the prospect table. This works fine but now I want to select all boxers that are prospects public static IQueryable<Boxer> IsProspect(this IQueryable<Boxer> query) { //this does not filter down to only prospects!!! return query.Where(x => x.Prospect != null); } This is the function I call using: var repository = GetRepository<Boxer>(); var boxers = repository.Query().IsProspect(); I would hope this would filter my collection of all boxers down to just boxers that are prospects! Oddly it doesnt filter it but if i hover over my boxers object and look at each boxer during debugging I can see "IsProspect" true or false correctly

  Read the article

• Perl regular expression question

  - by user368311

  Suppose I have variables $x1 = 'XX a b XX c d XX'; $x2 = 'XX a b XX c d XX e f XX'; I want a regular expression that will find each instance of letters between XX. I'm looking for a general solution, because I don't know how many XX's there are. I tried using /XX(.*?)XX/g but this only matches "a b" for x1 and "a b", "e f" for x2 because once the first match is found, the engine has already read the second "XX". Thanks for any help.

  Read the article

• iPhone SDK: How to add multiple labels to table cell?

  - by iPhone Developer

  I am trying to create a custom table cell that conveys these data fields. a.) Name b.) Address1 c.) Address2 d.) Phone In the table cell these fields should appear centered one after another. Another requirement is that each of those fields be a different font and color. For that reason, I was thinking of creating labels and attaching them to the cell but I haven't had much luck getting this working. My question is, can this be done? If so, what is the general approach to follow? Any pointers or links to examples greatly appreciated.

  Read the article

• Looking for a VIM Book

  - by sixtyfootersdude

  I have been using vim for about six months now. I know my way around pretty well. I know all of the "basic commands", have defined my own functions and have defined some syntax files. I was hopping to pickup a book on vim to read in my spare time. There is nothing specific that I want to learn I just want to improve my general knowledge. I looked on amazon and there are about 7 possibilities. Any recommendations?

  Read the article

• web service data type (contract)

  - by cyberguest

  hi, i have a general design question. we have a fairly big data model that represents an clinical object, the object itself has 200+ child attributes in the hierarchy. and we have a SetObject operation, and a GetObject operation. my question is, best practice wise, would it make sense to use that single data model in both operations or different data model for each? Because the Get operation will return much more details than what's needed for Set. an example of what i mean: the data model has say ProviderId, and ProviderName attributes, in the Get operation, both the ProviderId, and ProviderName would need to be returned. However, in the Set operation, only the ProviderId is needed, and ProviderName is ignored by the service since system has that information already. In this case, if the Get and Set operations use the same data model, the ProviderName is exposed even for Set operation, does that confuse the consuming developer?

  Read the article

• Having access to a private variable from other classes in Java

  - by Crystal

  If I want to create a form that adds people to a List, how do I have access to that List from another class? Where would I define that List so other classes can access the members, the size, etc? For example, if I have Class Foo that has the GUI for my form, along with buttons to add and remove people to the List, it would make sense to me to declare the List as a private instance variable of Class Foo. But then if I have another class, Class Bar, how does it get the values that are currently in that List to update some other graphical components? Or is that the wrong place to declare the List in general? Thanks.

  Read the article

• Add 64 bit offset to a pointer

  - by Novox

  In F#, there's the NativePtr module, but it seems to only support 32 bit offsets for its’ add/get/set functions, just like System.IntPtr does. Is there a way to add a 64 bit offset to a native pointer (nativeptr<'a) in F#? Of course I could convert all addresses to 64 bit integers, do normal integer operations and then convert the result again to nativeptr<'a, but this would cost additional add and imul instructions. I really want the AGUs to perform the address calculations. For instance, using unsafe in C# you could do something like void* ptr = Marshal.AllocHGlobal(...).ToPointer(); int64 offset = ...; T* newAddr = (T*)ptr + offset; // T has to be an unmanaged type Well actually you can't, because there is no "unmanaged" constraint for type parameters, but at least you can do general pointer arithmetic in a non-generic way. In F# we finally got the unmanaged constraint; but how do I do the pointer arithmetic?

  Read the article

• Generic type parameter naming convention for Java (with multiple chars)?

  - by chaper29

  In some interfaces i wrote I'd like to name generic type parameter with more than one character to make the code more readable. Something like.... Map<Key,Value> Instead of this... Map<K,V> But when it comes to methods, the type-parameters look like java-classes which is also confusing. public void put(Key key, Value value) This seems like Key and Value are classes. I found or thought of some notations, but nothing like a convention from sun or a general best-practice. Alternatives i guesed of or found... Map<KEY,VALUE> Map<TKey,TValue>

  Read the article

• How often does memcache on Google AppEngine lose data?

  - by Freed

  Memcache in general and on AppEngine in specific is unreliable in the sense that my data may be deleted from the cache for whatever reason at any point in time. However, in some cases there might be cases where a small risk may be worth the added performance using memcache could give, such as updating some data in memcache that gets saved periodically to some other, more reliable storage. Are there any numbers from Google that could give me an indication of the actual probability that a memcache entry would be lost from the cache before its expiration time, given that I keep within my quotas? Are there any reasons other than hardware failure and administrative operations such as machines at the data centers being upgraded/moved/replaced that would cause entries to be removed from memcache prematurely?

  Read the article

• Preventing click event with jQuery drag and drop

  - by Sasha Yanovets

  I have an elements on page that are draggabe with jQuery. These elements have click event wich navigates to another page (ordinary links for example). What is the best way to prevent click from firing on dropping such element, while allowing clicking it in not drag and drop state? I have this problem with sortable elements, but think it is good to have solution for general drag and drop. I've solved the problem for myself. After that found that same solution exists for Scriptaculous, but maybe someone have a better way to achieve that.

  Read the article

• mod_rewrite: no ? and # in REQUEST_URI

  - by tshabala

  Hello. What I'm trying to do: have pretty URLs in the format 'http://domain.tld/one/two/three', that get handled by a PHP script (index.php) by looking at the REQUEST_URI server variable. In my example, the REQUEST_URI would be '/one/two/three'. (Btw., is this a good idea in general?) I'm using Apache's mod_rewrite to achieve that. Here's the RewriteRule I use in my .htaccess: RewriteRule ^/?([a-zA-Z/]+)/?$ /index.php [NC,L] This works really well thus far; it forwards every REQUEST_URI that consists of a-z, A-Z or a '/' to /index.php, where it is processed. Only drawback: '?' (question marks) and '#' (hash keys) seem to still be allowed in the REQUEST_URI, maybe even more characters that I've yet to find. Is it possible to restrict those via my .htaccess and an adequate addition to the RewriteRule? Thanks!

  Read the article

• Permutations with extra restrictions

  - by Full Decent

  I have a set of items, for example: {1,1,1,2,2,3,3,3}, and a restricting set of sets, for example {{3},{1,2},{1,2,3},{1,2,3},{1,2,3},{1,2,3},{2,3},{2,3}. I am looking for permutations of items, but the first element must be 3, and the second must be 1 or 2, etc. One such permutation that fits is: {3,1,1,1,2,2,3} Is there an algorithm to count all permutations for this problem in general? Is there a name for this type of problem? For illustration, I know how to solve this problem for certain types of "restricting sets". Set of items: {1,1,2,2,3}, Restrictions {{1,2},{1,2,3},{1,2,3},{1,2},{1,2}}. This is equal to 2!/(2-1)!/1! * 4!/2!/2!. Effectively permuting the 3 first, since it is the most restrictive and then permuting the remaining items where there is room.

  Read the article

< Previous Page | 272 273 274 275 276 277 278 279 280 281 282 283  | Next Page >