Search Results

Search found 88027 results on 3522 pages for 'code composer'.

Page 557/3522 | < Previous Page | 553 554 555 556 557 558 559 560 561 562 563 564  | Next Page >

  • June 2013 release of SSDT contains a minor bug that you should be aware of

    - by jamiet
    I have discovered what seems, to me, like a bug in the June 2013 release of SSDT and given the problems that it created yesterday on my current gig I thought it prudent to write this blog post to inform people of it. I’ve built a very simple SSDT project to reproduce the problem that has just two tables, [Table1] and [Table2], and also a procedure [Procedure1]: The two tables have exactly the same definition, both a have a single column called [Id] of type integer. CREATE TABLE [dbo].[Table1] (     [Id] INT NOT NULL PRIMARY KEY ) My stored procedure simply joins the two together, orders them by the column used in the join predicate, and returns the results: CREATE PROCEDURE [dbo].[Procedure1] AS     SELECT t1.*     FROM    Table1 t1     INNER JOIN Table2 t2         ON    t1.Id = t2.Id     ORDER BY Id Now if I create those three objects manually and then execute the stored procedure, it works fine: So we know that the code works. Unfortunately, SSDT thinks that there is an error here: The text of that error is: Procedure: [dbo].[Procedure1] contains an unresolved reference to an object. Either the object does not exist or the reference is ambiguous because it could refer to any of the following objects: [dbo].[Table1].[Id] or [dbo].[Table2].[Id]. Its complaining that the [Id] field in the ORDER BY clause is ambiguous. Now you may well be thinking at this point “OK, just stick a table alias into the ORDER BY predicate and everything will be fine!” Well that’s true, but there’s a bigger problem here. One of the developers at my current client installed this drop of SSDT and all of a sudden all the builds started failing on his machine – he had errors left right and centre because, as it transpires, we have a fair bit of code that exhibits this scenario.  Worse, previous installations of SSDT do not flag this code as erroneous and therein lies the rub. We immediately had a mass panic where we had to run around the department to our developers (of which there are many) ensuring that none of them should upgrade their SSDT installation if they wanted to carry on being productive for the rest of the day. Also bear in mind that as soon as a new drop of SSDT comes out then the previous version is instantly unavailable so rolling back is going to be impossible unless you have created an administrative install of SSDT for that previous version. Just thought you should know! In the grand schema of things this isn’t a big deal as the bug can be worked around with a simple code modification but forewarned is forearmed so they say! Last thing to say, if you want to know which version of SSDT you are running check my blog post Which version of SSDT Database Projects do I have installed? @Jamiet

    Read the article

  • Google I/O 2012 - Getting Direct Feedback from your YouTube Community

    Google I/O 2012 - Getting Direct Feedback from your YouTube Community Eric Lundberg, Jeffrey Posnick Do you want to hear from (and see!) your site's community? We will be sharing a new way to solicit videos from your users. Come and learn about how it was developed and see an example of it put to use as part of the YouTube Direct open source video submission platform. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 0 0 ratings Time: 40:44 More in Science & Technology

    Read the article

  • GDL Presents: Make Web Magic | Part I

    GDL Presents: Make Web Magic | Part I Using the latest open web technologies, the developers creating some of the most inspired Chrome Experiments showcase their latest web experiments and discuss how they are making the web faster, more fun, and more open in this 3-episode hangout. Happy experimenting. Host: Paul Irish, Developer Advocate, Chrome Guest: Michael Deal From: GoogleDevelopers Views: 115 2 ratings Time: 31:44 More in Science & Technology

    Read the article

  • Google I/O 2012 - What's Next for Chrome Extensions?

    Google I/O 2012 - What's Next for Chrome Extensions? Mike West Chrome's extension system offers developers more opportunities than ever to customize and enhance users' experience on the web. New APIs are landing on a regular basis that provide new functionality and deeper hooks into Chrome itself. Join us for a walk through bleeding edge changes to Chrome's extension framework that increase security, improve performance, and make it easier than ever for users to get up and running with the product of your hard work. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 1372 29 ratings Time: 51:36 More in Science & Technology

    Read the article

  • Maps We Like, and Why We Like Them

    Maps We Like, and Why We Like Them Live from Sydney (now in HD!) Paul and Chris talk about their favorite maps, why we like them, and how we find cool maps. 1:40 Showcase | 5:45 Geo Developer Blog | 8:25 GTA4 Street View map | 11:00 Internet Map | 14:40 How we find cool maps | 20:30 Map of the Dead | 24:50 Old Maps Online | 27:10 Wind Map From: GoogleDevelopers Views: 3 0 ratings Time: 29:18 More in Science & Technology

    Read the article

  • Avoiding and Identifying False Sharing Among Threads

    In symmetric multiprocessor (SMP) systems, each processor has a local cache. The memory system must guarantee cache coherence. False sharing occurs when threads on different processors modify variables that reside on the same cache line. Learn methods to detect and correct false sharing.

    Read the article

  • Double Buffering in Panda3D (C++)

    - by jsvcycling
    How would I go about using Double Buffering (to create a loading screen) in Panda3D using C++? I've searched Google and found some forums that talk about the concept of swapping buffers, but I haven't seen any that show any type of source code (specifically Panda3D/C++). I'd like to try and stay away from using pure OpenGL code and work it through Panda3D, but if I have no other choice, then I'll have to go with OpenGL coding.

    Read the article

  • More Than a Map - Ubilabs

    More Than a Map - Ubilabs In Hamburg, Germany we met with certified Google Maps API development partner Ubilabs. Ubilabs founders Michael Pletziger and Martin Kleppe showed us some of the Google Maps API driven projects they have built for Germany's largest brands such as Deutsche Telekom, Blitzer.de, and BMW. Read more on morethanamap.com #morethanamap From: GoogleDevelopers Views: 6 0 ratings Time: 01:48 More in Science & Technology

    Read the article

  • G+ Platform Office Hours -- Retrieving Profile Information with the Sign In Button

    G+ Platform Office Hours -- Retrieving Profile Information with the Sign In Button Join us for a live coding demo of the sign in button and how to retrieve profile information using it! Or skip ahead to what you really care about: Meet your presenters: goo.gl Render the Sign-In Button: goo.gl Add a Client ID: goo.gl See Sign-In Render: goo.gl Grab the user resource (with live XHR/REST debugging*!): goo.gl Retrieve and render the user resource: goo.gl *If you don't feel you need a debugging crash course, feel free to skip from 10:14 to 18:30. :) From: GoogleDevelopers Views: 659 17 ratings Time: 29:39 More in Science & Technology

    Read the article

  • How do you make a bullet ricochet off a vertical wall?

    - by Bagofsheep
    First things first. I am using C# with XNA. My game is top-down and the player can shoot bullets. I've managed to get the bullets to ricochet correctly off horizontal walls. Yet, despite using similar methods (e.g. http://stackoverflow.com/questions/3203952/mirroring-an-angle) and reading other answered questions about this subject I have not been able to get the bullets to ricochet off a vertical wall correctly. Any method I've tried has failed and sometimes made ricocheting off a horizontal wall buggy. Here is the collision code that calls the ricochet method: //Loop through returned tile rectangles from quad tree to test for wall collision. If a collision occurs perform collision logic. for (int r = 0; r < returnObjects.Count; r++) if (Bullets[i].BoundingRectangle.Intersects(returnObjects[r])) Bullets[i].doCollision(returnObjects[r]); Now here is the code for the doCollision method. public void doCollision(Rectangle surface) { if (Ricochet) doRicochet(surface); else Trash = true; } Finally, here is the code for the doRicochet method. public void doRicochet(Rectangle surface) { if (Position.X > surface.Left && Position.X < surface.Right) { //Mirror the bullet's angle. Rotation = -1 * Rotation; //Moves the bullet in the direction of its rotation by given amount. moveFaceDirection(Sprite.Width * BulletScale.X); } else if (Position.Y > surface.Top && Position.Y < surface.Bottom) { } } Since I am only dealing with vertical and horizontal walls at the moment, the if statements simply determine if the object is colliding from the right or left, or from the top or bottom. If the object's X position is within the boundaries of the tile's X boundaries (left and right sides), it must be colliding from the top, and vice verse. As you can see, the else if statement is empty and is where the correct code needs to go.

    Read the article

  • Off the Charts: Getting Cost Data into Google Analytics

    Off the Charts: Getting Cost Data into Google Analytics With Analytics' new Cost Data Upload feature, users can measure and analyze non-Google cost data to calculate paid campaign effectiveness. Developers are able to build solutions to upload exported cost data into Analytics so marketers can have a unified view of their campaign spend - all within the Google Analytics interface. Join Google Analytics' Developer Advocate Pete Frisella to dive into the implementation of this new feature through the robust Analytics APIs. From: GoogleDevelopers Views: 0 0 ratings Time: 30:00 More in Science & Technology

    Read the article

< Previous Page | 553 554 555 556 557 558 559 560 561 562 563 564  | Next Page >