Search Results

Search found 20211 results on 809 pages for 'language implementation'.

Page 433/809 | < Previous Page | 429 430 431 432 433 434 435 436 437 438 439 440  | Next Page >

  • Does GCC have a built-in compile time assert?

    - by VladLosev
    Our existing compile-time assert implementation is based on negative array index, and it provides poor diagnostic output on GCC. C++0x's static_assert is a very nice feature, and the diagnostic output it provides is much better. I know GCC has already implemented some C++0x features. Does anyone know if static_assert is among them and if it is then since what GCC version?

    Read the article

  • Abstract class and an inheritor: is it possible to factorize .parent() here?

    - by fge
    Here are what I think are the relevant parts of the code of these two classes. First, TreePointer (original source here): public abstract class TreePointer<T extends TreeNode> implements Iterable<TokenResolver<T>> { //... /** * What this tree can see as a missing node (may be {@code null}) */ private final T missing; /** * The list of token resolvers */ protected final List<TokenResolver<T>> tokenResolvers; /** * Main protected constructor * * <p>This constructor makes an immutable copy of the list it receives as * an argument.</p> * * @param missing the representation of a missing node (may be null) * @param tokenResolvers the list of reference token resolvers */ protected TreePointer(final T missing, final List<TokenResolver<T>> tokenResolvers) { this.missing = missing; this.tokenResolvers = ImmutableList.copyOf(tokenResolvers); } /** * Alternate constructor * * <p>This is the same as calling {@link #TreePointer(TreeNode, List)} with * {@code null} as the missing node.</p> * * @param tokenResolvers the list of token resolvers */ protected TreePointer(final List<TokenResolver<T>> tokenResolvers) { this(null, tokenResolvers); } //... /** * Tell whether this pointer is empty * * @return true if the reference token list is empty */ public final boolean isEmpty() { return tokenResolvers.isEmpty(); } @Override public final Iterator<TokenResolver<T>> iterator() { return tokenResolvers.iterator(); } // .equals(), .hashCode(), .toString() follow } Then, JsonPointer, which contains this .parent() method which I'd like to factorize here (original source here: public final class JsonPointer extends TreePointer<JsonNode> { /** * The empty JSON Pointer */ private static final JsonPointer EMPTY = new JsonPointer(ImmutableList.<TokenResolver<JsonNode>>of()); /** * Return an empty JSON Pointer * * @return an empty, statically allocated JSON Pointer */ public static JsonPointer empty() { return EMPTY; } //... /** * Return the immediate parent of this JSON Pointer * * <p>The parent of the empty pointer is itself.</p> * * @return a new JSON Pointer representing the parent of the current one */ public JsonPointer parent() { final int size = tokenResolvers.size(); return size <= 1 ? EMPTY : new JsonPointer(tokenResolvers.subList(0, size - 1)); } // ... } As mentioned in the subject, the problem I have here is with JsonPointer's .parent() method. In fact, the logic behind this method applies to TreeNode all the same, and therefore to its future implementations. Except that I have to use a constructor, and of course such a constructor is implementation dependent :/ Is there a way to make that .parent() method available to each and every implementation of TreeNode or is it just a pipe dream?

    Read the article

  • Clojure example of the day?

    - by Michiel Borkent
    Is there a Clojure example of the day kind of service, like a blog, or Twitter account I can follow? Would be really nice to have a short example every day to enhance Clojure skills and to get inspired to delve deeper into the language. Clojure really lends itself well for short but powerful code.

    Read the article

  • what math do i need to convert this number

    - by Uberfuzzy
    given an X, what math is needed to find its Y, using this table? x->y 0->1 1->0 2->6 3->5 4->4 5->3 6->2 language agnostic problem and no, i dont/cant just store the array, and do the lookup. yes, the input will always be the finite set of 0 to 6. it wont be scaling later.

    Read the article

  • How to calculate the cycles that change one permutation into another?

    - by fortran
    Hi, I'm looking for an algorithm that given two permutations of a sequence (e.g. [2, 3, 1, 4] and [4, 1, 3, 2]) calculates the cycles that are needed to convert the first into the second (for the example, [[0, 3], [1, 2]]). The link from mathworld says that Mathematica's ToCycle function does that, but sadly I don't have any Mathematica license at hand... I'd gladly receive any pointer to an implementation of the algorithm in any FOSS language or mathematics package. Thanks!

    Read the article

  • How to open a PDF file?

    - by Alive
    I want to load a pdf file on the click of a button. In the OnClickButton() implementation I am writing the function which open the PDF file ShellExecute(0, "Open", "%s\\HELP\\RiverCADPro_User_Manual.pdf", NULL, NULL, SW_MAXIMIZE); The above code is not working.What else is to be needed so as to run the above code

    Read the article

  • Remember JVM state before executing a specific instruction.

    - by user559064
    I am working on a testing project using mutating technique. My project requires to manipulate a Java classfile and re-execute the classfile multiple times for testing. My implementation need to re-execute the whole system again after one manipulation, and that is not efficient. I am wondering whether I can save the JVM state right before executing a desired instruction in the classfile, so that I can start from that state after each manipulation. Thank you.

    Read the article

  • Reading a SquashFS archive

    - by p-static
    (SquashFS is a compressed filesystem - http://en.wikipedia.org/wiki/SquashFS) I'm looking for a way to read a SquashFS filesystem from a program. So far, I've know about the in-kernel drivers for it, but I'm sure that a userspace library for it must exist somewhere. Any language would be fine, but C is preferred. Just mounting the filesystem and using it that way is technically possible, but I'd rather avoid that route because the application I'm looking at would involve working with at least a few dozen archives at any given time.

    Read the article

  • Recursively expand collapsed regions in Visual Studio? (outlining)

    - by Kurt Margenau
    I'm using Visual Studio 2008, and it doesn't seem like once I have collapsed all the regions, I can expand ALL levels of a certain region with one click/command. Notepad++ has this functionality when you ctrl + click on a collapsed region, it recursively expands all regions within it. It's awesome. Anyone know of a plugin or macro that has this functionality? I'm using a custom language, aka not C++/C# btw thanks!

    Read the article

  • How to find where error is.

    - by gurugio
    How can I find where the error occurs? In C language, the return value means what error occurs, such as failure to open file or memory allocation. There is no information where the error occurs. For example, function 'foo' calls A,B,C,D. If foo returns an error value, it might be return value of A or B or C or D. I cannot find what function returns error. I have to run debugger or add some codes to find what function returns error.

    Read the article

  • Where c++ really shines?

    - by pygabriel
    I know C and python, and I'm moving toward another language for learning purposes. My problem is that I like to learn things with something to do (for example contributing to some project or do something amazing, not boring plain algebra). I would like to hear suggestions about the fields in which C++ shines and where I can found interesting programming with C++. (for fields I mean networking/gui programming/algorithms/games ...)

    Read the article

  • JVM memory management & garbage collection book?

    - by Max
    Hi. Could anyone advice a book (or any other source) that would thoroughly reveal internals of JVM memory management & garbage collection (optimization, work, circular references, pecularities, discussions for various JVM impls...)? [What I've found so far are separate articles devoted to various aspects but no weighty tome :). Some good materials for Hotspot implementation are here. ] Thanks a lot for any advice you give.

    Read the article

  • What's wrong with this "if"?

    - by Gurzo
    Hello, I'm currently trying to make an AppleScript which should recognize the selected file in Finder and do the relative command in Terminal. Everything was going fine since I reached the part where it should define the language of the selected file: it just doesn't check the ifs. I checked if it writes fileExtension correctly (via return) and it does. Here is the Gist with the code, any help would be appreciated. Thanks

    Read the article

  • Pin Control in HCS12

    - by Brian Lindsey
    A HCS12 microcontroller I had to buy for a class I had recently taken has 40 pins on the back side of it. The class was merely about computer organization, and so unfortunately, we never had a chance to cover all the capabilities of the chip itself. Now that the class is over, I have been thinking about using the to familiarize myself with the assembly language. I haven't found any sources that cover pin control and was wondering if anyone could possibly provide me with a hands-on pin tutorial.

    Read the article

  • How can I fix a locale warning from perl?

    - by xain
    When I run perl, I get the warning: perl: warning: Setting locale failed. perl: warning: Please check that your locale settings: LANGUAGE = (unset), LC_ALL = (unset), LANG = "en_US.UTF-8" are supported and installed on your system. perl: warning: Falling back to the standard locale ("C"). Any ideas on how to fix it?

    Read the article

< Previous Page | 429 430 431 432 433 434 435 436 437 438 439 440  | Next Page >