Search Results

Search found 2300 results on 92 pages for 'robert smith'.

Page 19/92 | < Previous Page | 15 16 17 18 19 20 21 22 23 24 25 26  | Next Page >

  • JSP Model 2 Architecture and Dependency Injection

    - by Robert
    If I'm writing a web application that uses the model 2 architecture, is it possible to use the Google Guice framework (or really any IoC container)? The reason I ask this question is because everything I've researched about DI, IoC, et cetera always uses Spring, Hibernate or some other framework/container in their examples. I'm just using Java classes, controllers, and JSP's to build this application and I can't find any good documentation about the subject.

    Read the article

  • Directory Synchronization

    - by Robert May
    We’re using federated security with Office 365 and everything was running swimmingly and then I started getting the following error when trying to synchronize security information: “An unknown error occurred with the Microsoft Online Services Sign-in Assistant. Contact Technical Support.” Great.  Very descriptive.  In the event viewer, you get a bit more detail: GetAuthState() failed with -2147186688 state. HResult:0. Contact Technical Support.  (0x80048831) If you do some searching, you’ll find that there are a couple of MSDN articles about this error.  In KB2502710 you’re told to reinstall sign in assistant.  This one requires a reboot.  In KB2517393 you’re told to make sure that your proxy settings are working correctly.  I’m not using a proxy and everything was set up right. Rather frustrating and I couldn’t figure out what was going on.  What finally keyed me in was the error number being presented.  Rather than 80048800, which is listed in the second article, I was getting 80048831.  I did a quick search and found something that was seemingly unrelated here.  Could it really be so simple as the password having expired for my synchronization user? Turns out, it was that simple.  Once the password was reset and reentered, everything worked great again. Since this isn’t a user that humans use, I also don’t want the password to expire.  You can find the instructions for that (use Set-MsolUser –UserPrincipalName <user ID> –PasswordNeverExpires $true) here. Technorati Tags: Office 365

    Read the article

  • display driver problem

    - by Robert
    I just recently installed Ubuntu 12.10 on my laptop and am keeping windows 7 as a back up for when I get stuck like now..... After I installed Ubuntu I got on line and was reading about some of the things to do after Installing for the first time. One of them was looking for additional drivers witch I did and found two display drivers. Both drivers were from Ubuntu. However after install and a reboot I can't see any of my menu bars.....no app bar on the side.....no bar at the top of the display...nothing. I did have a file on the desktop that I was able to open. And I just learned that ctrl+alt+T gets me a form of command prompt. this worked but I don't know how to use it. How do I get my menu bars back?? is there a way to uninstall the drivers? I am really new to Ubuntu and like it so far but am having problems getting over the learning curve.

    Read the article

  • RewriteRule for URLs with spaces

    - by Robert Cailliau
    My site's pages are in multiple languages whereby each language version shares its media (images) with the other language versions. I place all versions and the media in a single directory with the same name. E.g. pages mypage-en.html, mypage-fr.html etc. will sit in directory mypage. The directory path suffices to reference a page: h t t p : //....../mypage/ is good enough, there is no need for h t t p : //....../mypage/mypage-en/html A rewrite with RewriteRule ^(.*)/([a-zA-Z0-9]+)/?$ /$1/$2/$2-en.html lets me use the shorter form. But what if the name mypage contains spaces (which some do) ? I want h t t p : //....../my page/ to lead to h t t p : //....../my page/my page.html Using RewriteRule ^(.*)/([a-zA-Z0-9|\s]+)/?$ /$1/$2/$2-en.html did not work. Any hints welcome. (please do not ask me why I want to do this, nor tell me I should not use spaces in file names)

    Read the article

  • SQL SERVER – Shrinking Database is Bad – Increases Fragmentation – Reduces Performance

    - by pinaldave
    Earlier, I had written two articles related to Shrinking Database. I wrote about why Shrinking Database is not good. SQL SERVER – SHRINKDATABASE For Every Database in the SQL Server SQL SERVER – What the Business Says Is Not What the Business Wants I received many comments on Why Database Shrinking is bad. Today we will go over a very interesting example that I have created for the same. Here are the quick steps of the example. Create a test database Create two tables and populate with data Check the size of both the tables Size of database is very low Check the Fragmentation of one table Fragmentation will be very low Truncate another table Check the size of the table Check the fragmentation of the one table Fragmentation will be very low SHRINK Database Check the size of the table Check the fragmentation of the one table Fragmentation will be very HIGH REBUILD index on one table Check the size of the table Size of database is very HIGH Check the fragmentation of the one table Fragmentation will be very low Here is the script for the same. USE MASTER GO CREATE DATABASE ShrinkIsBed GO USE ShrinkIsBed GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Create FirstTable CREATE TABLE FirstTable (ID INT, FirstName VARCHAR(100), LastName VARCHAR(100), City VARCHAR(100)) GO -- Create Clustered Index on ID CREATE CLUSTERED INDEX [IX_FirstTable_ID] ON FirstTable ( [ID] ASC ) ON [PRIMARY] GO -- Create SecondTable CREATE TABLE SecondTable (ID INT, FirstName VARCHAR(100), LastName VARCHAR(100), City VARCHAR(100)) GO -- Create Clustered Index on ID CREATE CLUSTERED INDEX [IX_SecondTable_ID] ON SecondTable ( [ID] ASC ) ON [PRIMARY] GO -- Insert One Hundred Thousand Records INSERT INTO FirstTable (ID,FirstName,LastName,City) SELECT TOP 100000 ROW_NUMBER() OVER (ORDER BY a.name) RowID, 'Bob', CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%2 = 1 THEN 'Smith' ELSE 'Brown' END, CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 1 THEN 'New York' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 5 THEN 'San Marino' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 3 THEN 'Los Angeles' ELSE 'Houston' END FROM sys.all_objects a CROSS JOIN sys.all_objects b GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Insert One Hundred Thousand Records INSERT INTO SecondTable (ID,FirstName,LastName,City) SELECT TOP 100000 ROW_NUMBER() OVER (ORDER BY a.name) RowID, 'Bob', CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%2 = 1 THEN 'Smith' ELSE 'Brown' END, CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 1 THEN 'New York' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 5 THEN 'San Marino' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 3 THEN 'Los Angeles' ELSE 'Houston' END FROM sys.all_objects a CROSS JOIN sys.all_objects b GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO Let us check the table size and fragmentation. Now let us TRUNCATE the table and check the size and Fragmentation. USE MASTER GO CREATE DATABASE ShrinkIsBed GO USE ShrinkIsBed GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Create FirstTable CREATE TABLE FirstTable (ID INT, FirstName VARCHAR(100), LastName VARCHAR(100), City VARCHAR(100)) GO -- Create Clustered Index on ID CREATE CLUSTERED INDEX [IX_FirstTable_ID] ON FirstTable ( [ID] ASC ) ON [PRIMARY] GO -- Create SecondTable CREATE TABLE SecondTable (ID INT, FirstName VARCHAR(100), LastName VARCHAR(100), City VARCHAR(100)) GO -- Create Clustered Index on ID CREATE CLUSTERED INDEX [IX_SecondTable_ID] ON SecondTable ( [ID] ASC ) ON [PRIMARY] GO -- Insert One Hundred Thousand Records INSERT INTO FirstTable (ID,FirstName,LastName,City) SELECT TOP 100000 ROW_NUMBER() OVER (ORDER BY a.name) RowID, 'Bob', CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%2 = 1 THEN 'Smith' ELSE 'Brown' END, CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 1 THEN 'New York' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 5 THEN 'San Marino' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 3 THEN 'Los Angeles' ELSE 'Houston' END FROM sys.all_objects a CROSS JOIN sys.all_objects b GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Insert One Hundred Thousand Records INSERT INTO SecondTable (ID,FirstName,LastName,City) SELECT TOP 100000 ROW_NUMBER() OVER (ORDER BY a.name) RowID, 'Bob', CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%2 = 1 THEN 'Smith' ELSE 'Brown' END, CASE WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 1 THEN 'New York' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 5 THEN 'San Marino' WHEN ROW_NUMBER() OVER (ORDER BY a.name)%10 = 3 THEN 'Los Angeles' ELSE 'Houston' END FROM sys.all_objects a CROSS JOIN sys.all_objects b GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO You can clearly see that after TRUNCATE, the size of the database is not reduced and it is still the same as before TRUNCATE operation. After the Shrinking database operation, we were able to reduce the size of the database. If you notice the fragmentation, it is considerably high. The major problem with the Shrink operation is that it increases fragmentation of the database to very high value. Higher fragmentation reduces the performance of the database as reading from that particular table becomes very expensive. One of the ways to reduce the fragmentation is to rebuild index on the database. Let us rebuild the index and observe fragmentation and database size. -- Rebuild Index on FirstTable ALTER INDEX IX_SecondTable_ID ON SecondTable REBUILD GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO You can notice that after rebuilding, Fragmentation reduces to a very low value (almost same to original value); however the database size increases way higher than the original. Before rebuilding, the size of the database was 5 MB, and after rebuilding, it is around 20 MB. Regular rebuilding the index is rebuild in the same user database where the index is placed. This usually increases the size of the database. Look at irony of the Shrinking database. One person shrinks the database to gain space (thinking it will help performance), which leads to increase in fragmentation (reducing performance). To reduce the fragmentation, one rebuilds index, which leads to size of the database to increase way more than the original size of the database (before shrinking). Well, by Shrinking, one did not gain what he was looking for usually. Rebuild indexing is not the best suggestion as that will create database grow again. I have always remembered the excellent post from Paul Randal regarding Shrinking the database is bad. I suggest every one to read that for accuracy and interesting conversation. Let us run following script where we Shrink the database and REORGANIZE. -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO -- Shrink the Database DBCC SHRINKDATABASE (ShrinkIsBed); GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO -- Rebuild Index on FirstTable ALTER INDEX IX_SecondTable_ID ON SecondTable REORGANIZE GO -- Name of the Database and Size SELECT name, (size*8) Size_KB FROM sys.database_files GO -- Check Fragmentations in the database SELECT avg_fragmentation_in_percent, fragment_count FROM sys.dm_db_index_physical_stats (DB_ID(), OBJECT_ID('SecondTable'), NULL, NULL, 'LIMITED') GO You can see that REORGANIZE does not increase the size of the database or remove the fragmentation. Again, I no way suggest that REORGANIZE is the solution over here. This is purely observation using demo. Read the blog post of Paul Randal. Following script will clean up the database -- Clean up USE MASTER GO ALTER DATABASE ShrinkIsBed SET SINGLE_USER WITH ROLLBACK IMMEDIATE GO DROP DATABASE ShrinkIsBed GO There are few valid cases of the Shrinking database as well, but that is not covered in this blog post. We will cover that area some other time in future. Additionally, one can rebuild index in the tempdb as well, and we will also talk about the same in future. Brent has written a good summary blog post as well. Are you Shrinking your database? Well, when are you going to stop Shrinking it? Reference: Pinal Dave (http://blog.SQLAuthority.com) Filed under: Pinal Dave, PostADay, SQL, SQL Authority, SQL Index, SQL Performance, SQL Query, SQL Scripts, SQL Server, SQL Tips and Tricks, SQLServer, T SQL, Technology

    Read the article

  • Optimizing multiple dispatch notification algorithm in C#?

    - by Robert Fraser
    Sorry about the title, I couldn't think of a better way to describe the problem. Basically, I'm trying to implement a collision system in a game. I want to be able to register a "collision handler" that handles any collision of two objects (given in either order) that can be cast to particular types. So if Player : Ship : Entity and Laser : Particle : Entity, and handlers for (Ship, Particle) and (Laser, Entity) are registered than for a collision of (Laser, Player), both handlers should be notified, with the arguments in the correct order, and a collision of (Laser, Laser) should notify only the second handler. A code snippet says a thousand words, so here's what I'm doing right now (naieve method): public IObservable<Collision<T1, T2>> onCollisionsOf<T1, T2>() where T1 : Entity where T2 : Entity { Type t1 = typeof(T1); Type t2 = typeof(T2); Subject<Collision<T1, T2>> obs = new Subject<Collision<T1, T2>>(); _onCollisionInternal += delegate(Entity obj1, Entity obj2) { if (t1.IsAssignableFrom(obj1.GetType()) && t2.IsAssignableFrom(obj2.GetType())) obs.OnNext(new Collision<T1, T2>((T1) obj1, (T2) obj2)); else if (t1.IsAssignableFrom(obj2.GetType()) && t2.IsAssignableFrom(obj1.GetType())) obs.OnNext(new Collision<T1, T2>((T1) obj2, (T2) obj1)); }; return obs; } However, this method is quite slow (measurable; I lost ~2 FPS after implementing this), so I'm looking for a way to shave a couple cycles/allocation off this. I thought about (as in, spent an hour implementing then slammed my head against a wall for being such an idiot) a method that put the types in an order based on their hash code, then put them into a dictionary, with each entry being a linked list of handlers for pairs of that type with a boolean indication whether the handler wanted the order of arguments reversed. Unfortunately, this doesn't work for derived types, since if a derived type is passed in, it won't notify a subscriber for the base type. Can anyone think of a way better than checking every type pair (twice) to see if it matches? Thanks, Robert

    Read the article

  • IE9 RC fixed the “Internet Explorer cannot display the webpage” error when running an ASP.NET application in Visual Studio

    - by Jon Galloway
    One of the obstacles ASP.NET developers faced in using the Internet Explorer 9 Beta was the dreaded “Internet Explorer cannot display the webpage” error when running an ASP.NET application in Visual Studio. In the bug information on Connect (issue 601047), Eric Lawrence said that the problem was due to “caused by failure to failover from IPv6 to IPv4 when the connection is local.” Robert MacLean gives some more information as what was going wrong: “The problem is Windows, especially since it assumes IPv6 is better than IPv4. Note […] that when you ping localhost you get an IPv6 address. So what appears to be happening is when IE9 tries to go to localhost it uses IPv6, and the ASP.NET Development Server is IPv4 only and so nothing loads and we get the error.” The Simple Fix - Install IE 9 RC Internet Explorer 9 RC fixes this bug, so if you had tried IE 9 Beta and stopped using it due to problems with ASP.NET development, install the RC. The Workaround in IE 9 Beta If you're stuck on IE 9 Beta for some reason, you can follow Robert's workaround, which involves a one character edit to your hosts file. I've been using it for months, and it works great. Open notepad (running as administrator) and edit the hosts file (found in %systemroot%\system32\drivers\etc) Remove the # comment character before the line starting with 127.0.0.1 Save the file - if you have problems saving, it's probably because you weren't running as administrator When you're done, your hosts file will end with the following lines (assuming you were using a default hosts file setup beforehand): # localhost name resolution is handled within DNS itself.     127.0.0.1       localhost #    ::1             localhost Note: more information on editing your hosts file here. This causes Windows to default to IPv4 when resolving localhost, which will point to 127.0.0.1, which is right where Cassini - I mean the ASP.NET Web Development Server - is waiting for it.

    Read the article

  • hall.dll errors

    - by Robert Elliott
    I am getting frequent BSoDs, mostly with hall.dll errors. I have Dell Inspiron laptop running Windows 7 SP1. The following file, werfault, is shown below. Can anyone help me work out what is wrong? Version=1 EventType=BlueScreen EventTime=129987824768810026 ReportType=4 Consent=1 ReportIdentifier=1c3e1c58-3b30-11e2-9074-002219f61870 IntegratorReportIdentifier=113012-32557-01 Response.type=4 DynamicSig[1].Name=OS Version DynamicSig[1].Value=6.1.7601.2.1.0.768.3 DynamicSig[2].Name=Locale ID DynamicSig[2].Value=2057 UI[2]=C:\Windows\system32\wer.dll UI[3]=Windows has recovered from an unexpected shutdown UI[4]=Windows can check online for a solution to the problem. UI[5]=&Check for solution UI[6]=&Check later UI[7]=Cancel UI[8]=Windows has recovered from an unexpected shutdown UI[9]=A problem caused Windows to stop working correctly. Windows will notify you if a solution is available. UI[10]=Close Sec[0].Key=BCCode Sec[0].Value=a Sec[1].Key=BCP1 Sec[1].Value=0000000000000000 Sec[2].Key=BCP2 Sec[2].Value=0000000000000002 Sec[3].Key=BCP3 Sec[3].Value=0000000000000000 Sec[4].Key=BCP4 Sec[4].Value=FFFFF80002C0E477 Sec[5].Key=OS Version Sec[5].Value=6_1_7601 Sec[6].Key=Service Pack Sec[6].Value=1_0 Sec[7].Key=Product Sec[7].Value=768_1 File[0].CabName=113012-32557-01.dmp File[0].Path=113012-32557-01.dmp File[0].Flags=589826 File[0].Type=2 File[0].Original.Path=C:\Windows\Minidump\113012-32557-01.dmp File[1].CabName=sysdata.xml File[1].Path=WER-75941-0.sysdata.xml File[1].Flags=589826 File[1].Type=5 File[1].Original.Path=C:\Users\Robert\AppData\Local\Temp\WER-75941-0.sysdata.xml File[2].CabName=Report.cab File[2].Path=Report.cab File[2].Flags=196608 File[2].Type=7 File[2].Original.Path=Report.cab FriendlyEventName=Shut down unexpectedly ConsentKey=BlueScreen AppName=Windows AppPath=C:\Windows\System32\WerFault.exe *********From the minidump file**** RAX = fffff88002f22150 RBX = fffffa80074141f0 RCX = 000000000000000a RDX = 0000000000000000 RSI = fffffa8007278180 RDI = 0000000000000001 R9 = 0000000000000000 R10 = fffff80002c0e477 R11 = 0000000000000000 R12 = fffffa800523e7a0 R13 = 0000000000001000 R14 = 0000000000000028 R15 = fffffa80074141f0 RBP = fffff88002f22210 RIP = fffff80002cd3fc0 RSP = fffff88002f22048 SS = 0000 GS = 002b FS = 0053 ES = 002b DS = 002b CS = 0010 Flags = 00200286 fffff800`02e99ac0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99ad0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99ae0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99af0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99b00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99b10 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99b20 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99b30 00 00 00 00 00 00 00 00 00 00 00 00 04 00 00 00 ................ fffff800`02e99b40 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e99b50 00 00 00 00 00 00 00 00 00 00 00 00 ............ fffff800`02e81928 00 00 00 00 .... fffff800`02e81924 00 00 00 00 .... fffff800`02e0a880 37 36 30 31 2E 31 37 39 34 34 2E 61 6D 64 36 34 7601.17944.amd64 fffff800`02e0a890 66 72 65 2E 77 69 6E 37 73 70 31 5F 67 64 72 2E fre.win7sp1_gdr. fffff800`02e0a8a0 31 32 30 38 33 30 2D 30 33 33 33 00 00 00 00 00 120830-0333..... fffff800`02e0a8b0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a8c0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a8d0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a8e0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a8f0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a900 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a910 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a920 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a930 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a940 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a950 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................ fffff800`02e0a960 35 36 65 38 62 61 31 33 2D 37 30 32 39 2D 34 37 56e8ba13-7029-47 fffff800`02e0a970 32 38 2D 61 35 30 36 2D 32 64 64 62 34 61 30 63 28-a506-2ddb4a0c fffff800`02c0e000 C5 0F 85 79 02 00 00 8B 9C 24 90 00 00 00 E9 A5 ...y.....$...... fffff800`02c0e010 00 00 00 44 2B C3 45 33 C9 E8 5E 14 00 00 49 3B ...D+.E3..^...I; fffff800`02c0e020 C5 74 2B 44 8B 8C 24 90 00 00 00 48 8B C8 41 8D .t+D..$....H..A. fffff800`02c0e030 51 FF 41 3B D5 76 0D 44 8B C2 49 83 E8 01 48 8B Q.A;.v.D..I...H. fffff800`02c0e040 49 08 75 F6 48 89 79 08 41 03 D9 48 8B F8 3B DD I.u.H.y.A..H..;. fffff800`02c0e050 75 08 48 8B C7 E9 26 02 00 00 48 8B 96 98 00 00 u.H...&...H..... fffff800`02c0e060 00 48 8D 84 24 90 00 00 00 44 8B C5 48 89 44 24 .H..$....D..H.D$ fffff800`02c0e070 28 44 2B C3 45 33 C9 48 8B CE 44 88 6C 24 20 E8 (D+.E3.H..D.l$ . fffff800`02c0e080 CC 14 00 00 49 3B C5 74 2B 44 8B 8C 24 90 00 00 ....I;.t+D..$... fffff800`02c0e090 00 48 8B C8 41 8D 51 FF 41 3B D5 76 0D 44 8B C2 .H..A.Q.A;.v.D.. fffff800`02c0e0a0 49 83 E8 01 48 8B 49 08 75 F6 48 89 79 08 41 03 I...H.I.u.H.y.A. fffff800`02c0e0b0 D9 48 8B F8 3B DD 74 9A 44 38 AE 28 01 00 00 0F .H..;.t.D8.(.... fffff800`02c0e0c0 85 DF 00 00 00 48 8D 44 24 30 4C 8D 8C 24 A0 00 .....H.D$0L..$.. fffff800`02c0e0d0 00 00 4C 8D 84 24 A8 00 00 00 8B D5 48 8B CE 48 ..L..$......H..H fffff800`02c0e0e0 89 44 24 20 E8 F7 1F 00 00 8B F8 89 84 24 90 00 .D$ .........$.. fffff800`02c0e0f0 00 00 41 3B C5 0F 84 83 01 00 00 4C 8B A4 24 A8 ..A;.......L..$. fffff800`02c0e100 00 00 00 44 8B 84 24 A0 00 00 00 48 8B 8E 98 00 ...D..$....H.... fffff800`02c0e110 00 00 49 8B D4 44 8B C8 E8 DB 1B 00 00 49 3B C5 ..I..D.......I;. fffff800`02c0e120 74 35 48 8B 96 98 00 00 00 48 8D 84 24 90 00 00 t5H......H..$... fffff800`02c0e130 00 41 B1 01 48 89 44 24 28 44 8B C5 48 8B CE 44 .A..H.D$(D..H..D fffff800`02c0e140 88 6C 24 20 E8 43 12 00 00 49 3B C5 0F 84 2C 01 .l$ .C...I;...,. fffff800`02c0e150 00 00 E9 29 01 00 00 48 8B 5C 24 30 49 3B DD 74 ...)...H.\$0I;.t fffff800`02c0e160 2A 4D 3B E5 74 0C 48 8B D3 49 8B CC FF 15 AE CE *M;.t.H..I...... fffff800`02c0e170 01 00 48 8B CB FF 15 95 CF 01 00 33 D2 48 8B CB ..H........3.H.. fffff800`02c0e180 FF 15 AA CE 01 00 E9 F3 00 00 00 C1 E7 0C 41 B8 ..............A. fffff800`02c0e190 01 00 00 00 49 8B CC 8B D7 FF 15 99 CE 01 00 E9 ....I........... fffff800`02c0e1a0 DA 00 00 00 2B EB 33 C9 41 B8 48 61 6C 20 8B D5 ....+.3.A.Hal .. fffff800`02c0e1b0 44 8B FD 48 C1 E2 03 FF 15 33 D4 01 00 4C 8B F0 D..H.....3...L.. fffff800`02c0e1c0 49 3B C5 0F 84 8F 00 00 00 45 8B E5 41 3B ED 76 I;.......E..A;.v fffff800`02c0e1d0 3F 4C 8B E8 BA 00 10 00 00 B9 04 00 00 00 41 B8 ?L............A. fffff800`02c0e1e0 48 61 6C 20 FF 15 06 D4 01 00 49 89 45 00 48 85 Hal ......I.E.H. fffff800`02c0e1f0 C0 74 39 48 8B C8 FF 15 BC CE 01 00 48 C1 E8 20 .t9H........H.. fffff800`02c0e200 85 C0 75 28 41 FF C4 49 83 C5 08 44 3B E5 72 C4 ..u(A..I...D;.r. fffff800`02c0e210 48 8B 8E 98 00 00 00 44 8B C5 BA 01 00 00 00 E8 H......D........ fffff800`02c0e220 58 19 00 00 4C 8B E8 48 85 C0 75 6C 45 33 ED 45 X...L..H..ulE3.E fffff800`02c0e230 3B E5 76 19 49 8B EE 48 8B 4D 00 33 D2 FF 15 ED ;.v.I..H.M.3.... fffff800`02c0e240 CD 01 00 48 83 C5 08 49 83 EC 01 75 EA 33 D2 49 ...H...I...u.3.I fffff800`02c0e250 8B CE FF 15 D8 CD 01 00 41 3B DD 76 21 8B EB 48 ........A;.v!..H fffff800`02c0e260 8B 96 98 00 00 00 48 8B 5F 08 4C 8B C7 48 8B CE ......H._.L..H.. fffff800`02c0e270 E8 2B 15 00 00 48 83 ED 01 48 8B FB 75 E1 33 C0 .+...H...H..u.3. fffff800`02c0e280 48 8B 9C 24 98 00 00 00 48 83 C4 50 41 5F 41 5E H..$....H..PA_A^ fffff800`02c0e290 41 5D 41 5C 5F 5E 5D C3 8D 4D FF 85 C9 74 0C 8B A]A\_^]..M...t.. fffff800`02c0e2a0 D1 48 83 EA 01 48 8B 40 08 75 F6 48 89 78 08 49 [email protected] fffff800`02c0e2b0 8B FD 85 ED 74 29 49 8B DE 48 8B 0B FF 15 F6 CD ....t)I..H...... fffff800`02c0e2c0 01 00 41 89 45 00 48 8B 03 48 83 C3 08 48 83 C8 ..A.E.H..H...H.. fffff800`02c0e2d0 0F 49 83 EF 01 49 89 45 10 4D 8B 6D 08 75 DA 48 .I...I.E.M.m.u.H fffff800`02c0e2e0 8B 8E 98 00 00 00 48 8D 54 24 38 48 83 C1 78 FF ......H.T$8H..x. fffff800`02c0e2f0 15 83 CD 01 00 4C 8B 9E 98 00 00 00 48 8D 4C 24 .....L......H.L$ fffff800`02c0e300 38 41 01 AB D0 00 00 00 FF 15 3A CD 01 00 33 D2 8A........:...3. fffff800`02c0e310 49 8B CE FF 15 17 CD 01 00 E9 34 FD FF FF 90 90 I.........4..... fffff800`02c0e320 90 90 90 90 45 85 C0 74 43 48 89 5C 24 08 48 89 ....E..tCH.\$.H. fffff800`02c0e330 74 24 10 57 48 83 EC 20 48 8B F1 41 8B F8 48 8B t$.WH.. H..A..H. fffff800`02c0e340 5A 08 4C 8B C2 48 8B 96 98 00 00 00 48 8B CE E8 Z.L..H......H... fffff800`02c0e350 4C 14 00 00 48 83 EF 01 48 8B D3 75 E1 48 8B 5C L...H...H..u.H.\ fffff800`02c0e360 24 30 48 8B 74 24 38 48 83 C4 20 5F C3 90 90 90 $0H.t$8H.. _.... fffff800`02c0e370 90 90 90 90 48 8B C4 48 89 58 08 48 89 68 10 48 ....H..H.X.H.h.H fffff800`02c0e380 89 70 18 48 89 78 20 41 54 41 55 4C 8B D9 4D 8B .p.H.x ATAUL..M. fffff800`02c0e390 E0 48 8B F2 B9 FF 0F 00 00 4D 85 DB 75 08 4C 8B .H.......M..u.L. fffff800`02c0e3a0 D1 40 32 FF EB 12 4D 8B 93 88 00 00 00 41 8A BB [email protected].. fffff800`02c0e3b0 91 00 00 00 49 C1 EA 0C 44 8B 44 24 38 41 8B C1 ....I...D.D$8A.. fffff800`02c0e3c0 4C 2B 4E 20 23 C1 49 C1 E9 0C 41 BD 00 10 00 00 L+N #.I...A..... fffff800`02c0e3d0 41 8B D5 41 8B E9 2B D0 8B CA 4C 39 54 EE 30 76 A..A..+...L9T.0v fffff800`02c0e3e0 04 33 C9 EB 4F 41 3B D0 73 43 4C 8D 4C EE 38 4D .3..OA;.sCL.L.8M fffff800`02c0e3f0 39 11 77 39 49 8B 59 F8 48 8D 43 01 49 3B 01 75 9.w9I.Y.H.C.I;.u fffff800`02c0e400 2C 48 8B C3 49 33 01 48 A9 00 00 F0 FF 75 1E 40 ,H..I3.H.....u.@ fffff800`02c0e410 80 FF 01 74 0C 49 33 19 48 F7 C3 F0 FF FF FF 75 ...t.I3.H......u fffff800`02c0e420 0C 41 03 CD 49 83 C1 08 41 3B C8 72 C2 41 3B C8 .A..I...A;.r.A;. fffff800`02c0e430 41 0F 47 C8 4D 85 DB 0F 84 92 00 00 00 41 80 BB A.G.M........A.. fffff800`02c0e440 28 01 00 00 00 0F 84 84 00 00 00 4C 39 54 EE 30 (..........L9T.0 fffff800`02c0e450 76 7D 8B CA 48 8D 44 EE 38 41 3B D0 73 11 4C 39 v}..H.D.8A;.s.L9 fffff800`02c0e460 10 76 0C 41 03 CD 48 83 C0 08 41 3B C8 72 EF 49 .v.A..H...A;.r.I fffff800`02c0e470 8B 44 24 18 41 3B C8 44 8B 08 4C 8B 50 08 41 0F .D$.A;.D..L.P.A. fffff800`02c0e480 47 C8 41 C1 E9 0C EB 3A 45 8B 02 41 8D 41 01 41 G.A....:E..A.A.A fffff800`02c0e490 C1 E8 0C 44 3B C0 75 2E 41 8B C0 41 33 C1 A9 00 ...D;.u.A..A3... fffff800`02c0e4a0 00 F0 FF 75 21 40 80 FF 01 74 0D 41 8B C0 41 33 [email protected] fffff800`02c0e4b0 C1 A9 F0 FF FF FF 75 0E 4D 8B 52 08 45 8B C8 41 ......u.M.R.E..A fffff800`02c0e4c0 03 D5 3B D1 72 C2 3B D1 0F 47 D1 8B C2 EB 02 8B ..;.r.;..G...... fffff800`02c0e4d0 C1 48 8B 5C 24 18 48 8B 6C 24 20 48 8B 74 24 28 .H.\$.H.l$ H.t$( fffff800`02c0e4e0 48 8B 7C 24 30 41 5D 41 5C C3 90 90 90 90 90 90 H.|$0A]A\....... fffff800`02c0e4f0 48 89 5C 24 08 48 89 6C 24 10 48 89 74 24 18 57 H.\$.H.l$.H.t$.W fffff800`02c0e500 41 54 41 55 48 83 EC 30 48 8B 5C 24 70 4D 8B E1 ATAUH..0H.\$pM.. fffff800`02c0e510 49 8B F0 8B 03 4C 8B EA 48 8B E9 89 44 24 20 E8 I....L..H...D$ . fffff800`02c0e520 50 FE FF FF 49 8B CC 89 03 49 2B 4D 20 8B F8 48 P...I....I+M ..H fffff800`02c0e530 C1 E9 0C 8B C9 49 8B 54 CD 30 49 8B CC 48 C1 E2 .....I.T.0I..H.. fffff800`02c0e540 0C 81 E1 FF 0F 00 00 48 03 D1 48 85 F6 74 72 48 .......H..H..trH fffff800`02c0e550 39 95 88 00 00 00 73 69 4C 8B 4E 18 48 8B 84 24 9.....siL.N.H..$ fffff800`02c0e560 80 00 00 00 41 8B DC 41 8B 09 81 E3 FF 0F 00 00 ....A..A........ fffff800`02c0e570 03 CB 80 7C 24 78 01 48 89 08 75 17 4D 8B C4 49 ...|$x.H..u.M..I fffff800`02c0e580 8B D5 48 8B CD C6 44 24 28 01 89 7C 24 20 E8 C5 ..H...D$(..|$ .. fffff800`02c0e590 06 00 00 8B C7 C1 EF 0C 25 FF 0F 00 00 8D 8C 18 ........%....... fffff800`02c0e5a0 FF 0F 00 00 48 8B 46 18 C1 E9 0C 03 CF 74 0C 8B ....H.F......t.. fffff800`02c0e5b0 D1 48 83 EA 01 48 8B 40 08 75 F6 48 89 46 18 EB [email protected].. fffff800`02c0e5c0 0B 48 8B 84 24 80 00 00 00 48 89 10 48 8B 5C 24 .H..$....H..H.\$ fffff800`02c0e5d0 50 48 8B 6C 24 58 48 8B 74 24 60 48 83 C4 30 41 PH.l$XH.t$`H..0A fffff800`02c0e5e0 5D 41 5C 5F C3 90 90 90 90 90 90 90 4D 85 C0 0F ]A\_........M... fffff800`02c0e5f0 84 09 01 00 00 48 8B C4 48 89 58 08 48 89 68 10 .....H..H.X.H.h. fffff800`02c0e600 48 89 70 18 48 89 78 20 41 54 41 55 41 56 48 83 H.p.H.x ATAUAVH. fffff800`02c0e610 EC 30 44 8A 64 24 78 49 8B D8 49 8B F1 4C 8B EA .0D.d$xI..I..L.. fffff800`02c0e620 4C 8B F1 49 89 58 18 41 80 FC 01 0F 84 AF 00 00 L..I.X.A........ fffff800`02c0e630 00 8B 7C 24 70 85 FF 0F 84 9F 00 00 00 4C 8B CE ..|$p........L.. fffff800`02c0e640 4C 8B C3 49 8B D5 49 8B CE 89 7C 24 20 E8 22 FD L..I..I...|$ .". fffff800`02c0e650 FF FF 48 8B CE 49 2B 4D 20 8B E8 48 C1 E9 0C 8B ..H..I+M ..H.... fffff800`02c0e660 C9 49 8B 54 CD 30 48 8B CE 48 C1 E2 0C 81 E1 FF .I.T.0H..H...... fffff800`02c0e670 0F 00 00 48 03 D1 49 39 96 88 00 00 00 73 52 4C ...H..I9.....sRL fffff800`02c0e680 8B 4B 18 4C 8B C6 49 8B D5 49 8B CE 44 88 64 24 .K.L..I..I..D.d$ fffff800`02c0e690 28 89 6C 24 20 E8 BE 05 00 00 8B C5 44 8B DE 25 (.l$ .......D..% fffff800`02c0e6a0 FF 0F 00 00 41 81 E3 FF 0F 00 00 41 8D 8C 03 FF ....A......A.... fffff800`02c0e6b0 0F 00 00 8B C5 C1 E8 0C C1 E9 0C 03 C8 48 8B 43 .............H.C fffff800`02c0e6c0 18 74 0A 48 83 E9 01 48 8B 40 08 75 F6 48 89 43 [email protected] fffff800`02c0e6d0 18 48 03 F5 2B FD 0F 85 61 FF FF FF 48 89 5B 18 .H..+...a...H.[. fffff800`02c0e6e0 48 8B 5C 24 50 48 8B 6C 24 58 48 8B 74 24 60 48 H.\$PH.l$XH.t$`H fffff800`02c0e6f0 8B 7C 24 68 48 83 C4 30 41 5E 41 5D 41 5C C3 90 .|$hH..0A^A]A\.. fffff800`02c0e700 90 90 90 90 90 90 90 90 48 89 54 24 10 53 55 56 ........H.T$.SUV fffff800`02c0e710 57 41 54 41 55 41 56 41 57 48 83 EC 58 48 8B F2 WATAUAVAWH..XH.. fffff800`02c0e720 48 8B D9 48 8D 54 24 30 48 8D 0D B9 67 02 00 45 H..H.T$0H...g..E fffff800`02c0e730 8B E1 49 8B F8 4C 89 84 24 B0 00 00 00 FF 15 35 ..I..L..$......5 fffff800`02c0e740 C9 01 00 4C 8B 2D 86 67 02 00 4C 8B 35 77 67 02 ...L.-.g..L.5wg. fffff800`02c0e750 00 48 8B C6 44 8B C6 48 2B 43 20 41 81 E0 FF 0F .H..D..H+C A.... fffff800`02c0e760 00 00 BD 00 10 00 00 48 C1 E8 0C 45 89 45 2C 8B .......H...E.E,. fffff800`02c0e770 CD 8B C0 41 2B C8 41 89 4D 28 4C 8D 4C C3 30 48 ...A+.A.M(L.L.0H fffff800`02c0e780 8B C6 48 25 00 F0 FF FF 49 89 45 20 49 89 46 20 ..H%....I.E I.F fffff800`02c0e790 45 89 46 2C 41 89 4E 28 44 89 84 24 B8 00 00 00 E.F,A.N(D..$.... fffff800`02c0e7a0 4C 89 8C 24 A0 00 00 00 45 85 E4 0F 84 90 01 00 L..$....E....... fffff800`02c0e7b0 00 48 8B 5F 10 48 81 E3 00 F0 FF FF 75 3C 8B 07 .H._.H......u<.. fffff800`02c0e7c0 48 8B 0D 49 67 02 00 44 8D 4B 01 48 C1 E8 0C 4D H..Ig..D.K.H...M fffff800`02c0e7d0 8B C6 BA 48 61 6C 20 49 89 46 30 FF 15 DF C8 01 ...Hal I.F0..... fffff800`02c0e7e0 00 48 8B D8 48 85 C0 0F 84 36 01 00 00 4C 8B 8C .H..H....6...L.. fffff800`02c0e7f0 24 A0 00 00 00 41 B7 01 EB 09 41 8B C0 48 03 D8 $....A....A..H.. fffff800`02c0e800 45 32 FF 49 8B 01 33 FF 49 89 45 30 48 8B 0D C5 E2.I..3.I.E0H... fffff800`02c0e810 66 02 00 44 8B CF 4D 8B C5 BA 48 61 6C 20 FF 15 f..D..M...Hal .. fffff800`02c0e820 9C C8 01 00 48 8B F0 48 85 C0 75 24 FF C7 83 FF ....H..H..u$.... fffff800`02c0e830 06 7C D9 48 21 44 24 20 45 33 C9 41 B8 01 EF 00 .|.H!D$ E3.A.... fffff800`02c0e840 00 48 8B D5 B9 AC 00 00 00 FF 15 A1 CA 01 00 CC .H.............. fffff800`02c0e850 8B FD 2B BC 24 B8 00 00 00 44 3B E7 41 0F 42 FC ..+.$....D;.A.B. fffff800`02c0e860 80 BC 24 C0 00 00 00 01 8B EF 44 8B C7 75 0E 48 ..$.......D..u.H fffff800`02c0e870 8B D0 48 8B CB FF 15 AD 33 02 00 EB 0B 48 8B D3 ..H.....3....H.. fffff800`02c0e880 48 8B C8 E8 C8 A6 01 00 4D 8B C5 BA 48 61 6C 20 H.......M...Hal fffff800`02c0e890 48 8B CE FF 15 47 C8 01 00 41 80 FF 01 75 11 4D H....G...A...u.M fffff800`02c0e8a0 8B C6 BA 48 61 6C 20 48 8B CB FF 15 30 C8 01 00 ...Hal H....0... fffff800`02c0e8b0 48 8B 84 24 A8 00 00 00 4C 8B 8C 24 A0 00 00 00 H..$....L..$.... fffff800`02c0e8c0 44 2B E7 48 8B BC 24 B0 00 00 00 48 03 C5 BD 00 D+.H..$....H.... fffff800`02c0e8d0 10 00 00 48 8B 7F 08 49 83 C1 08 45 33 C0 44 3B ...H..I...E3.D; fffff800`02c0e8e0 E5 48 8B C8 41 8B D4 0F 47 D5 48 81 E1 00 F0 FF .H..A...G.H..... fffff800`02c0e8f0 FF 48 89 84 24 A8 00 00 00 49 89 4D 20 41 89 55 .H..$....I.M A.U fffff800`02c0e900 28 25 FF 0F 00 00 41 89 45 2C 49 89 4E 20 41 89 (%....A.E,I.N A. fffff800`02c0e910 46 2C 41 89 56 28 48 89 BC 24 B0 00 00 00 E9 75 F,A.V(H..$.....u fffff800`02c0e920 FE FF FF 48 83 64 24 20 00 45 33 C9 41 B8 00 EF ...H.d$ .E3.A... fffff800`02c0e930 00 00 48 8B D5 B9 AC 00 00 00 FF 15 B0 C9 01 00 ..H............. fffff800`02c0e940 CC 48 8D 4C 24 30 FF 15 FC C6 01 00 48 83 C4 58 .H.L$0......H..X fffff800`02c0e950 41 5F 41 5E 41 5D 41 5C 5F 5E 5D 5B C3 90 90 90 A_A^A]A\_^][.... fffff800`02c0e960 90 90 90 90 48 89 5C 24 08 48 89 6C 24 10 48 89 ....H.\$.H.l$.H. fffff800`02c0e970 74 24 18 57 41 54 41 55 48 83 EC 50 33 C0 49 8B t$.WATAUH..P3.I. fffff800`02c0e980 F9 41 8B F0 4C 8B E2 48 8B CA 49 C7 C3 00 F0 FF .A..L..H..I..... fffff800`02c0e990 FF 45 85 C0 74 10 4C 85 59 10 74 0A 48 8B 49 08 .E..t.L.Y.t.H.I. fffff800`02c0e9a0 FF C0 3B C6 72 F0 3B C6 75 09 49 83 21 00 E9 FB ..;.r.;.u.I.!... fffff800`02c0e9b0 00 00 00 65 48 8B 04 25 20 00 00 00 33 C9 44 8B ...eH..% ...3.D. fffff800`02c0e9c0 50 24 48 8B 05 F7 64 02 00 4A 8B 2C D0 4C 8D 4D P$H...d..J.,.L.M fffff800`02c0e9d0 30 45 85 C0 74 22 4C 8B C6 4C 85 5A 10 75 0F 8B 0E..t"L..L.Z.u.. fffff800`02c0e9e0 02 FF C1 48 C1 E8 0C 49 89 01 49 83 C1 08 49 83 ...H...I..I...I. fffff800`02c0e9f0 E8 01 48 8B 52 08 75 E1 33 DB C1 E1 0C 41 B5 01 ..H.R.u.3....A.. fffff800`02c0ea00 48 21 5D 20 21 5D 2C 89 4D 28 44 38 2D 07 65 02 H!] !],.M(D8-.e. fffff800`02c0ea10 00 75 10 48 8B 05 C6 64 02 00 4A 8B 1C D0 E9 29 .u.H...d..J....) fffff800`02c0ea20 01 00 00 48 8D 0D D6 64 02 00 FF 15 50 C6 01 00 ...H...d....P... fffff800`02c0ea30 48 85 C0 0F 85 F9 00 00 00 44 8D 40 01 45 33 C9 [email protected]. fffff800`02c0ea40 33 D2 48 8B CD C7 44 24 28 20 00 00 00 21 5C 24 3.H...D$( ...!\$ fffff800`02c0ea50 20 FF 15 71 C6 01 00 4C 8B D8 48 85 C0 74 69 45 ..q...L..H..tiE fffff800`02c0ea60 32 ED 49 8B D3 85 F6 74 36 48 8B CE 49 F7 44 24 2.I....t6H..I.D$ fffff800`02c0ea70 10 00 F0 FF FF 75 1D 41 8B 44 24 10 25 EF 0F 00 .....u.A.D$.%... fffff800`02c0ea80 00 48 0B C2 48 83 C8 10 48 81 C2 00 10 00 00 49 .H..H...H......I fffff800`02c0ea90 89 44 24 10 48 83 E9 01 4D 8B 64 24 08 75 CD 48 .D$.H...M.d$.u.H fffff800`02c0eaa0 89 2F 4C 89 5F 08 48 89 5F 10 44 88 6F 30 4C 8D ./L._.H._.D.o0L. fffff800`02c0eab0 5C 24 50 49 8B 5B 20 49 8B 6B 28 49 8B 73 30 49 \$PI.[ I.k(I.s0I fffff800`02c0eac0 8B E3 41 5D 41 5C 5F C3 48 8D 54 24 30 48 8D 0D ..A]A\_.H.T$0H.. fffff800`02c0ead0 4C 64 02 00 FF 15 66 C5 01 00 48 8B 15 FF 63 02 Ld....f...H...c. fffff800`02c0eae0 00 44 8B 0D 10 64 02 00 48 8B 02 B9 01 00 00 00 .D...d..H....... fffff800`02c0eaf0 44 8B 40 18 44 3B C9 76 1E 48 83 C2 08 48 8B 02 [email protected];.v.H...H.. fffff800`02c0eb00 44 39 40 18 7D 06 44 8B 40 18 8B D9 FF C1 48 83 D9@.}[email protected]. fffff800`02c0eb10 C2 08 41 3B C9 72 E6 48 8D 4C 24 30 FF 15 0E C6 ..A;.r.H.L$0.... fffff800`02c0eb20 01 00 48 8B 05 B7 63 02 00 44 8B DB 4A 8B 1C D8 ..H...c..D..J... fffff800`02c0eb30 EB 07 83 60 1C 00 48 8B D8 F0 83 43 18 01 48 8D ...`..H....C..H. fffff800`02c0eb40 57 18 48 8D 4B 20 FF 15 F4 C4 01 00 48 8B 4B 10 W.H.K ......H.K. fffff800`02c0eb50 41 B9 01 00 00 00 4C 8B C5 BA 48 61 6C 20 FF 15 A.....L...Hal .. fffff800`02c0eb60 5C C5 01 00 4C 8B D8 48 85 C0 0F 85 F2 FE FF FF \...L..H........ fffff800`02c0eb70 48 21 44 24 20 45 33 C9 BA 00 10 00 00 B9 AC 00 H!D$ E3......... fffff800`02c0eb80 00 00 41 B8 02 EF 00 00 FF 15 62 C7 01 00 CC 90 ..A.......b..... fffff800`02c0eb90 90 90 90 90 90 90 90 90 48 89 5C 24 08 48 89 6C ........H.\$.H.l fffff800`02c0eba0 24 18 48 89 74 24 20 57 48 83 EC 20 41 80 78 30 $.H.t$ WH.. A.x0 fffff800`02c0ebb0 00 49 8B F8 8B F2 48 8B D9 BD 01 00 00 00 75 0F .I....H.......u. fffff800`02c0ebc0 49 8B 10 49 8B 48 08 FF 15 53 C4 01 00 EB 4A 4D I..I.H...S....JM fffff800`02c0ebd0 8B 00 48 8B 4F 08 BA 48 61 6C 20 FF 15 FF C4 01 ..H.O..Hal ..... fffff800`02c0ebe0 00 80 3D 30 63 02 00 00 75 2F 48 8D 4F 18 FF 15 ..=0c...u/H.O... fffff800`02c0ebf0 3C C5 01 00 48 8B 57 10 83 C8 FF F0 0F C1 42 18 <...H.W.......B. fffff800`02c0ec00 83 C0 FF 75 14 F0 0F B1 6A 1C 75 0D 48 8D 0D ED ...u....j.u.H... fffff800`02c0ec10 62 02 00 FF 15 4F C4 01 00 85 F6 74 1E 48 8B CE b....O.....t.H.. fffff800`02c0ec20 F6 43 10 10 74 0C 8B 43 10 25 EF 0F 00 00 48 89 .C..t..C.%....H. fffff800`02c0ec30 43 10 48 2B CD 48 8B 5B 08 75 E5 48 8B 5C 24 30 C.H+.H.[.u.H.\$0 fffff800`02c0ec40 48 8B 6C 24 40 48 8B 74 24 48 48 83 C4 20 5F C3 [email protected]$HH.. _. fffff800`02c0ec50 90 90 90 90 90 90 90 90 48 89 5C 24 18 48 89 4C ........H.\$.H.L fffff800`02c0ec60 24 08 55 56 57 41 54 41 55 41 56 41 57 48 83 EC $.UVWATAUAVAWH.. fffff800`02c0ec70 70 4D 8B F1 4D 8B E8 48 8B F2 4C 8B D1 44 0F 20 pM..M..H..L..D. fffff800`02c0ec80 C7 F6 42 0A 05 74 06 48 8B 5A 18 EB 2A 45 33 C9 ..B..t.H.Z..*E3. fffff800`02c0ec90 33 D2 48 8B CE 45 8D 41 01 C7 44 24 28 20 00 00 3.H..E.A..D$( .. fffff800`02c0eca0 00 83 64 24 20 00 FF 15 1C C4 01 00 4C 8B 94 24 ..d$ .......L..$ fffff800`02c0ecb0 B0 00 00 00 48 8B D8 BD 02 00 00 00 48 85 DB 75 ....H.......H..u fffff800`02c0ecc0 4A 40 3A FD 76 1F 48 21 5C 24 20 45 33 C9 BA 00 J@:.v.H!\$ E3... fffff800`02c0ecd0 10 00 00 B9 AC 00 00 00 41 B8 05 EF 00 00 FF 15 ........A....... fffff800`02c0ece0 0C C6 01 00 CC 8A 84 24 D8 00 00 00 44 8B 8C 24 .......$....D..$ fffff800`02c0ecf0 D0 00 00 00 4D 8B C6 49 8B D5 48 8B CE 88 44 24 ....M..I..H...D$ fffff800`02c0ed00 20 E8 02 FA FF FF E9 4D 01 00 00 44 8B BC 24 D0 ......M...D..$. fffff800`02c0ed10 00 00 00 BA FF 0F 00 00 41 8B CD 23 CA 41 8B C7 ........A..#.A.. fffff800`02c0ed20 C6 84 24 B8 00 00 00 00 23 C2 44 8D A4 01 FF 0F ..$.....#.D..... fffff800`02c0ed30 00 00 41 8B C7 41 C1 EC 0C C1 E8 0C 44 03 E0 44 ..A..A......D..D fffff800`02c0ed40 89 64 24 30 40 3A FD 76 41 33 C9 49 8B C6 45 85 .d$0@:.vA3.I..E. fffff800`02c0ed50 E4 74 64 48 F7 40 10 00 F0 FF FF 74 0D 48 8B 40 [email protected].@ fffff800`02c0ed60 08 FF C1 41 3B CC 72 EB EB 4D 48 83 64 24 20 00 ...A;.r..MH.d$ .

    Read the article

  • Announcing the Winnipeg VS.NET 2012 Community Launch Event!

    - by D'Arcy Lussier
    Back in May 2010 the local Winnipeg technical community got together and put on a launch event for VS.NET 2010. That event was such a good time that we’re doing it again this year for the VS.NET 2012 launch! On December 6th, the Winnipeg .NET User Group is hosting a full day VS.NET 2012 Community Launch Event at the Imax theatre in Portage Place! We have 4 sessions planned covering dev tools, ALM/TFS, web development, and cloud development, presented by Dylan Smith, Tyler Doerksen, and myself. You can get all the details and register on our Eventbrite site: http://wpgvsnet2012launch.eventbrite.ca/ I’ve included the details below as well for convenience: Winnipeg VS.NET 2012 Community Launch Event Join us for a full day of sessions highlighting the new features and capabilities of Visual Studio .NET 2012 and the .NET 4.5 Framework! Hosted by the Winnipeg .NET User Group, this community event is FREE thanks to the generous support from our event sponsors: Imaginet Online Business Systems Prairie Developer Conference Event Details When: Thursday, Decemer 6th from 8:00 AM - 4:00 PM Where: IMAX Theatre, Portage Place Cost: *FREE!* Agenda 8:00 - 9:00 Continental Breakfast and Registration 9:00 - 9:15 Welcome 9:15 - 10:30 End-To-End Application Lifecycle Management with TFS 2012 10:30 - 10:45 Break 10:45 - 12:00 Improving Developer Productivity with Visual Studio 2012 12:00 - 1:00 Lunch Break (Lunch Not Provided) 1:00 - 2:15 Web Development in Visual Studio 2012 and .NET 4.5 2:15 - 2:30  Break 2:30 - 3:45 Microsoft Cloud Development with Azure and Visual Studio 2012 3:45 - 4:00 Prizes and Thanks Session Abstracts End-To-End Application Lifecycle Management with TFS 2012 Dylan Smith, Imaginet In this session we'll walk through the application development lifecycle from end-to-end and see how some of the new capabilities in TFS 2012 help streamline the software delivery process. There are some exciting new capabilities around Agile Project Management, Gathering Feedback, Code Reviews, Unit Testing, Version Control, Storyboarding, etc. During this session we’ll follow a fictional software development team through the process of planning, developing, testing, and deployment focusing on where the new functionality in VS/TFS 2012 fits in to make teams more effective. Improving Developer Productivity with Visual Studio 2012 Dylan Smith, Imaginet Microsoft Visual Studio 2012 enables developers to take full advantage of the capability of Windows using the skills and technologies developers already know and love to deliver exceptional and compelling apps.  Whether working individually or in a small, medium or large development team Visual Studio 2012 sets a new standard for development tools, helping teams deliver superior results for their customers that help set them apart from their competitors.  In this session we’ll walk through new features in Visual Studio 2012 specifically focusing on how these improve Developer Productivity. Web Development in Visual Studio 2012 and .NET 4.5 D’Arcy Lussier, Online Business Systems It’s an exciting time to be a web developer in the Microsoft ecosystem! The launch of Visual Studio 2012 and .NET 4.5 brings new tooling and features, and the ASP.NET team is continually releasing updates for MVC, SignalR, Web API, and other platform features. In this session we’ll take a tour of the new features and technologies available for Microsoft web developers here in 2012! Microsoft Cloud Development with Azure and Visual Studio 2012 Tyler Doerksen, Imaginet Microsoft’s public cloud platform is nearing its third year of public availability, supporting web site/service hosting, storage, relational databases, virtual machines, virtual networks and much more. Windows Azure provides both power and flexibility.  But to capture this power you need to have the right tools!  This session will demonstrate the primary ways you can harness Windows Azure with the .NET platform.  We’ll explain cloud service development, packaging, deployment, testing and show how Visual Studio 2012 with the Windows Azure SDK and other Microsoft tools can be used to develop for and manage Windows Azure.Harness the power of the cloud from the comfort of Visual Studio 2012!

    Read the article

  • Delphi - WndProc() in thread never called

    - by Robert Oschler
    I had code that worked fine when running in the context of the main VCL thread. This code allocated it's own WndProc() in order to handle SendMessage() calls. I am now trying to move it to a background thread because I am concerned that the SendMessage() traffic is affecting the main VCL thread adversely. So I created a worker thread with the sole purpose of allocating the WndProc() in its thread Execute() method to ensure that the WndProc() existed in the thread's execution context. The WndProc() handles the SendMessage() calls as they come in. The problem is that the worker thread's WndProc() method is never triggered. Note, doExecute() is part of a template method that is called by my TThreadExtended class which is a descendant of Delphi's TThread. TThreadExtended implements the thread Execute() method and calls doExecute() in a loop. I triple-checked and doExecute() is being called repeatedly. Also note that I call PeekMessage() right after I create the WndProc() in order to make sure that Windows creates a message queue for the thread. However something I am doing is wrong since the WndProc() method is never triggered. Here's the code below: // ========= BEGIN: CLASS - TWorkerThread ======================== constructor TWorkerThread.Create; begin FWndProcHandle := 0; inherited Create(false); end; // --------------------------------------------------------------- // This call is the thread's Execute() method. procedure TWorkerThread.doExecute; var Msg: TMsg; begin // Create the WndProc() in our thread's context. if FWndProcHandle = 0 then begin FWndProcHandle := AllocateHWND(WndProc); // Call PeekMessage() to make sure we have a window queue. PeekMessage(Msg, FWndProcHandle, 0, 0, PM_NOREMOVE); end; if Self.Terminated then begin // Get rid of the WndProc(). myDeallocateHWnd(FWndProcHandle); end; // Sleep a bit to avoid hogging the CPU. Sleep(5); end; // --------------------------------------------------------------- procedure TWorkerThread.WndProc(Var Msg: TMessage); begin // THIS CODE IS NEVER CALLED. try if Msg.Msg = WM_COPYDATA then begin // Is LParam assigned? if (Msg.LParam > 0) then begin // Yes. Treat it as a copy data structure. with PCopyDataStruct(Msg.LParam)^ do begin ... // Here is where I do my work. end; end; // if Assigned(Msg.LParam) then end; // if Msg.Msg = WM_COPYDATA then finally Msg.Result := 1; end; // try() end; // --------------------------------------------------------------- procedure TWorkerThread.myDeallocateHWnd(Wnd: HWND); var Instance: Pointer; begin Instance := Pointer(GetWindowLong(Wnd, GWL_WNDPROC)); if Instance <> @DefWindowProc then begin // Restore the default windows procedure before freeing memory. SetWindowLong(Wnd, GWL_WNDPROC, Longint(@DefWindowProc)); FreeObjectInstance(Instance); end; DestroyWindow(Wnd); end; // --------------------------------------------------------------- // ========= END : CLASS - TWorkerThread ======================== Thanks, Robert

    Read the article

  • Background changes by itself and procedure repeats many times until I release the mouse button

    - by Robert
    Dear community, I am a student, and I'm working on a little slots game (if the same random number comes up 3 timed, you win). I use Borland Pascal 7. I use graph to make this a bit more visual, but when I start the game my background turns from black to grey, and the other problem is that if I click the game start button, the game runs many times until I release the mouse button. How can I solve this? Here is my full program: program slots; uses mymouse,graph,crt; var gdriver,gmode,coin:integer; m:mouserec; a,b,c,coins:string; procedure gomb(x1,y1,x2,y2:integer;szoveg:string); var j,n:integer; begin setcolor(blue); rectangle(x1,y1,x2,y2); setfillstyle(1,blue); floodfill(x1+2,y1+2,blue); setcolor(0); outtextxy((x1+x2)div 2 -textwidth(szoveg) div 2 ,(y1+y2) div 2-textheight(szoveg) div 2,szoveg); end; procedure randomal(var a,b,c:string); begin randomize; STR(random(2)+1,a); STR(random(2)+1,b); STR(random(2)+1,c); end; procedure menu; begin; settextstyle(0,0,1); outtextxy(20,10,'Meno menu'); gomb(20,20,90,50,'Teglalap'); gomb(20,60,90,90,'Inditas'); gomb(20,100,90,130,'Harmadik'); gomb(20,140,90,170,'Negyedik'); end; procedure teglalap(x1,x2,y1,y2,tinta:integer); begin setcolor(tinta); rectangle(x1,x2,y1,y2); end; procedure jatek(var a,b,c:string;var coin:integer;coins:string); begin; clrscr; menu; randomal(a,b,c); if ((a=b) AND (b=c)) then coin:=coin+1 else coin:=coin-1; settextstyle(0,0,3); setbkcolor(black); outtextxy(200,20,a); outtextxy(240,20,b); outtextxy(280,20,c); STR(coin,coins); outtextxy(400,400,coins); end; procedure eger; begin; mouseinit; mouseon; menu; repeat getmouse(m); if (m.left) and (m.x20) ANd (m.x<90) and (m.y20) and (m.y<50) then teglalap(90,90,300,300,blue); if (m.left) and (m.x20) AND (m.x<90) and (m.y60) and (m.y<90) then jatek(a,b,c,coin,coins); until ((m.left) and (m.x20) ANd (m.x<140) and (m.y140) and (m.y<170)); end; begin coin:=50; gdriver:=detect; initgraph(gdriver, gmode, ''); eger; end. Thank you very much, Robert

    Read the article

  • Large number of soft page faults when assigning a TJpegImage to a TBitmap

    - by Robert Oschler
    I have a Delphi 6 Pro application that processes incoming jpeg frames from a streaming video server. The code works but I recently noticed that it generates a huge number of soft page faults over time. After doing some investigation, the page faults appear to be coming from one particular graphics operation. Note, the uncompressed bitmaps in question are 320 x 240 or about 300 KB in size so it's not due to the handling of large images. The number of page faults being generated isn't tolerable. Over an hour it can easily top 1000000 page faults. I created a stripped down test case that executes the code I have included below on a timer, 10 times a second. The page faults appear to happen when I try to assign the TJpegImage to a TBitmap in the GetBitmap() method. I know this because I commented out that line and the page faults do not occur. The assign() triggers a decompression operation on the part of TJpegImage as it pushes the decompressed bits into a newly created bitmap that GetBitmap() returns. When I run Microsoft's pfmon utility (page fault monitor), I get a huge number of soft page fault error lines concerning RtlFillMemoryUlong, so it appears to happen during a memory buffer fill operation. One puzzling note. The summary part of pfmon's report where it shows which DLL caused what page fault does not show any DLL names in the far left column. I tried this on another system and it happens there too. Can anyone suggest a fix or a workaround? Here's the code. Note, IReceiveBufferForClientSocket is a simple class object that holds bytes in an accumulating buffer. function GetBitmap(theJpegImage: TJpegImage): Graphics.TBitmap; begin Result := TBitmap.Create; Result.Assign(theJpegImage); end; // --------------------------------------------------------------- procedure processJpegFrame(intfReceiveBuffer: IReceiveBufferForClientSocket); var theBitmap: TBitmap; theJpegStream, theBitmapStream: TMemoryStream; theJpegImage: TJpegImage; begin theBitmap := nil; theJpegImage := TJPEGImage.Create; theJpegStream:= TMemoryStream.Create; theBitmapStream := TMemoryStream.Create; try // 2 // ************************ BEGIN JPEG FRAME PROCESSING // Load the JPEG image from the receive buffer. theJpegStream.Size := intfReceiveBuffer.numBytesInBuffer; Move(intfReceiveBuffer.bufPtr^, theJpegStream.Memory^, intfReceiveBuffer.numBytesInBuffer); theJpegImage.LoadFromStream(theJpegStream); // Convert to bitmap. theBitmap := GetBitmap(theJpegImage); finally // Free memory objects. if Assigned(theBitmap) then theBitmap.Free; if Assigned(theJpegImage) then theJpegImage.Free; if Assigned(theBitmapStream) then theBitmapStream.Free; if Assigned(theJpegStream) then theJpegStream.Free; end; // try() end; // --------------------------------------------------------------- procedure TForm1.Timer1Timer(Sender: TObject); begin processJpegFrame(FIntfReceiveBufferForClientSocket); end; // --------------------------------------------------------------- procedure TForm1.FormCreate(Sender: TObject); var S: string; begin FIntfReceiveBufferForClientSocket := TReceiveBufferForClientSocket.Create(1000000); S := loadStringFromFile('c:\test.jpg'); FIntfReceiveBufferForClientSocket.assign(S); end; // --------------------------------------------------------------- Thanks, Robert

    Read the article

  • Design patter to keep track UITableView rows correspondance to underlying data in constant time.

    - by DenNukem
    When my model changes I want to animate changes in UITableView by inserting/deleting rows. For that I need to know the ordinal of the given row (so I can construct NSIndexPath), which I find hard to do in better-than-linear time. For example, consider that I have a list of addressbook entries which are manualy sorted by the user, i.e. there is no ordering "key" that represents the sort order. There is also a corresponding UITableView that shows one row per addressbook entry. When UITableView queries the datasource I query the NSMUtableArray populated with my entries and return required data in constant time for each row. However, if there is a change in underlying model I am getting a notification "Joe Smith, id#123 has been removed". Now I have a dilemma. A naive approach would be to scan the array, determine the index at which Joe Smith is and then ask UITableView to remove that precise row from the view, also removing it form the array. However, the scan will take linear time to finish. Now I could have an NSDictionary which allows me to find Joe Smith in constant time, but that doesn't do me a lot of good because I still need to find his ordinal index within the array in order to instruct UITableView to remove that row, which is again a linear search. I could further decide to store each object's ordinal inside the object itself to make it constant, but it will become outdated after first such update as all subsequent index values will have changed due to removal of an object. So what is the correct design pattern to accurately reflect model changes in the UITableView in costant (or at least logarithmic) time?

    Read the article

  • ASP.NET Ajax - Asynch request has separate session???

    - by Marcus King
    We are writing a search application that saves the search criteria to session state and executes the search inside of an asp.net updatepanel. Sometimes when we execute multiple searches successively the 2nd or 3rd search will sometimes return results from the first set of search criteria. Example: our first search we do a look up on "John Smith" - John Smith results are displayed. The second search we do a look up on "Bob Jones" - John Smith results are displayed. We save all of the search criteria in session state as I said, and read it from session state inside of the ajax request to format the DB query. When we put break points in VS everything behaves as normal, but without them we get the original search criteria and results. My guess is because they are saved in session, that the ajax request somehow gets its own session and saves the criteria to that, and then retrieves the criteria from that session every time, but the non-async stuff is able to see when the criteria is modified and saves the changes to state accordingly, but because they are from two different sessions there is a disparity in what is saved and read. EDIT::: To elaborate more, there was a suggestion of appending the search criteria to the query string which normally is good practice and I agree thats how it should be but following our requirements I don't see it as being viable. They want it so the user fills out the input controls hits search and there is no page reload, the only thing they see is a progress indicator on the page, and they still have the ability to navigate and use other features on the current page. If I were to add criteria to the query string I would have to do another request causing the whole page to load, which depending on the search criteria can take a really long time. This is why we are using an ajax call to perform the search and why we aren't causing another full page request..... I hope this clarifies the situation.

    Read the article

  • C++ help with getline function with ifstream

    - by John
    So I am writing a program that deals with reading in and writing out to a file. I use the getline() function because some of the lines in the text file may contain multiple elements. I've never had a problem with getline until now. Here's what I got. The text file looks like this: John Smith // Client name 1234 Hollow Lane, Chicago, IL // Address 123-45-6789 // SSN Walmart // Employer 58000 // Income 2 // Number of accounts the client has 1111 // Account Number 2222 // Account Number ifstream inFile("ClientInfo.txt"); if(inFile.fail()) { cout << "Problem opening file."; } else { string name, address, ssn, employer; double income; int numOfAccount; getline(inFile, name); getline(inFile, address); // I'll stop here because I know this is where it fails. When I debugged this code, I found that name == "John", instead of name == "John Smith", and Address == "Smith" and so on. Am I doing something wrong. Any help would be much appreciated.

    Read the article

  • Changing FileNames using RegEx and Recursion

    - by yeahumok
    Hello I'm trying to rename files that my program lists as having "illegal characters" for a SharePoint file importation. The illegal characters I am referring to are: ~ # % & * {} / \ | : < ? - "" What i'm trying to do is recurse through the drive, gather up a list of filenames and then through Regular Expressions, pick out file names from a List and try to replace the invalid characters in the actual filenames themselves. Anybody have any idea how to do this? So far i have this: (please remember, i'm a complete n00b to this stuff) class Program { static void Main(string[] args) { string[] files = Directory.GetFiles(@"C:\Documents and Settings\bob.smith\Desktop\~Test Folder for [SharePoint] %testing", "*.*", SearchOption.AllDirectories); foreach (string file in files) { Console.Write(file + "\r\n"); } Console.WriteLine("Press any key to continue..."); Console.ReadKey(true); string pattern = " *[\\~#%&*{}/:<>?|\"-]+ *"; string replacement = " "; Regex regEx = new Regex(pattern); string[] fileDrive = Directory.GetFiles(@"C:\Documents and Settings\bob.smith\Desktop\~Test Folder for [SharePoint] %testing", "*.*", SearchOption.AllDirectories); StreamWriter sw = new StreamWriter(@"C:\Documents and Settings\bob.smith\Desktop\~Test Folder for [SharePoint] %testing\File_Renames.txt"); foreach(string fileNames in fileDrive) { string sanitized = regEx.Replace(fileNames, replacement); sw.Write(sanitized + "\r\n"); } sw.Close(); } } So what i need to figure out is how to recursively search for these invalid chars, replace them in the actual filename itself. Anybody have any ideas?

    Read the article

  • SQL Server, how to join a table in a "rotated" format (returning columns instead of rows)?

    - by Joshua Carmody
    Sorry for the lame title, my descriptive skills are poor today. In a nutshell, I have a query similar to the following: SELECT P.LAST_NAME, P.FIRST_NAME, D.DEMO_GROUP FROM PERSON P JOIN PERSON_DEMOGRAPHIC PD ON PD.PERSON_ID = P.PERSON_ID JOIN DEMOGRAPHIC D ON D.DEMOGRAPHIC_ID = PD.DEMOGRAPHIC_ID This returns output like this: LAST_NAME FIRST_NAME DEMO_GROUP --------------------------------------------- Johnson Bob Male Smith Jane Female Smith Jane Teacher Beeblebrox Zaphod Male Beeblebrox Zaphod Alien Beeblebrox Zaphid Politician I would prefer the output be similar to the following: LAST_NAME FIRST_NAME Male Female Teacher Alien Politician --------------------------------------------------------------------------------------------------------- Johnson Bob 1 0 0 0 0 Smith Jane 0 1 1 0 0 Beeblebrox Zaphod 1 0 0 1 1 The number of rows in the DEMOGRAPHIC table varies, so I can't say with certainty how many columns I need. The query needs to be flexible. Yes, it would be trivial to do this in code. But this query is one piece of a complicated set of stored procedures, views, and reporting services, many of which are outside my sphere of influence. I need to produce this output inside the database to avoid breaking the system. Any ideas? This is MS SQL Server 2005, by the way. Thanks.

    Read the article

  • Filter entities that match all pairs

    - by Jon
    I have an entity (let's say Person) with a set of arbitrary attributes with a known subset of values. I need to search for all of these entities that match all my filter conditions. For example, my table structures look like this: Person: id | name 1 | John Doe 2 | Jane Roe 3 | John Smith Attribute: id | attr_name 1 | Sex 2 | Eye Color ValidValue: id | attr_id | value_name 1 | 1 | Male 2 | 1 | Female 3 | 2 | Blue 4 | 2 | Green 5 | 2 | Brown PersonAttributes id | person_id | attr_id | value_id 1 | 1 | 1 | 1 2 | 1 | 2 | 3 3 | 2 | 1 | 2 4 | 2 | 2 | 4 5 | 3 | 1 | 1 6 | 3 | 2 | 4 In JPA, I have entities built for all of these tables. What I'd like to do is perform a search for all entities matching a given set of attribute-value pairs. For instance, I'd like to be able to find all males (John Doe and John Smith), all people with green eyes (Jane Roe or John Smith), or all females with green eyes (Jane Roe). I see that I can already take advantage of the fact that I only really need to match on value_id, since that's already unique and tied to the attr_id. But where can I go from there?

    Read the article

  • SQL View with Data from two tables

    - by Alex
    Hello! I can't seem to crack this - I have two tables (Persons and Companies), and I'm trying to create a view that: 1) shows all persons 2) also returns companies by themselves once, regardless of how many persons are related to it 3) orders by name across both tables To clarify, some sample data: (Table: Companies) Id Name 1 Banana 2 ABC Inc. 3 Microsoft 4 Bigwig (Table: Persons) Id Name RelatedCompanyId 1 Joe Smith 3 2 Justin 3 Paul Rudd 4 4 Anjolie 5 Dustin 4 The output I'm looking for is something like this: Name PersonName CompanyName RelatedCompanyId ABC Inc. NULL ABC Inc. NULL Anjolie Anjolie NULL NULL Banana NULL Banana NULL Bigwig NULL Bigwig NULL Dustin Dustin Bigwig 4 Joe Smith Joe Smith Microsoft 3 Justin Justin NULL NULL Microsoft NULL Microsoft NULL Paul Rudd Paul Rudd Bigwig 4 As you can see, the new "Name" column is ordered across both tables (the company names appear correctly in between the person names), and each company appears exactly once, regardless of how many people are related to it. Can this even be done in SQL?! P.S. I'm trying to create a view so I can use this later for easy data retrieval, fulltext indexing and make the programming side simpler by just querying the view.

    Read the article

  • Query MySQL data from Excel (or vice-versa)

    - by Charles
    I'm trying to automate a tedious problem. I get large Excel (.xls or .csv, whatever's more convenient) files with lists of people. I want to compare these against my MySQL database.* At the moment I'm exporting MySQL tables and reading them from an Excel spreadsheet. At that point it's not difficult to use =LOOKUP() and such commands to do the work I need, and of course the various text processing I need to do is easy enough to do in Excel. But I can't help but think that this is more work than it needs to be. Is there some way to get at the MySQL data directly from Excel? Alternately, is there a way I could access a reasonably large (~10k records) csv file in a sql script? This seems to be rather basic, but I haven't managed to make it work so far. I found an ODBC connection for MySQL but that doesn't seem to do what I need. In particular, I'm testing whether the name matches or whether any of four email addresses match. I also return information on what matched for the benefit of the next person to use the data, something like "Name 'Bob Smith' not found, but 'Robert Smith' matches on email address robert.smith@foo".

    Read the article

  • How can I 'transpose' my data using SQL and remove duplicates at the same time?

    - by Remnant
    I have the following data structure in my database: LastName FirstName CourseName John Day Pricing John Day Marketing John Day Finance Lisa Smith Marketing Lisa Smith Finance etc... The data shows employess within a business and which courses they have shown a preference to attend. The number of courses per employee will vary (i.e. as above, John has 3 courses and Lisa 2). I need to take this data from the database and pass it to a webpage view (asp.net mvc). I would like the data that comes out of my database to match the view as much as possible and want to transform the data using SQl so that it looks like the following: LastName FirstName Course1 Course2 Course3 John Day Pricing Marketing Finance Lisa Smith Marketing Finance Any thoughts on how this may be achieved? Note: one of the reasons I am trying this approach is that the original data structure does not easily lend itself to be iterated over using the typical mvc syntax: <% foreach (var item in Model.courseData) { %> Because of the duplication of names in the orignal data I would end up with lots of conditionals in my View which I would like to avoid. I have tried transforming the data using c# in my ViewModel but have found it tough going and feel that I could lighten the workload by leveraging SQL before I return the data. Thanks.

    Read the article

  • Match entities fulfilling filter (strict superset of search)

    - by Jon
    I have an entity (let's say Person) with a set of arbitrary attributes with a known subset of values. I need to search for all of these entities that match all my filter conditions. That is, given a set of Attributes A, I need to find all people that have a set of Attributes that are a superset of A. For example, my table structures look like this: Person: id | name 1 | John Doe 2 | Jane Roe 3 | John Smith Attribute: id | attr_name 1 | Sex 2 | Eye Color ValidValue: id | attr_id | value_name 1 | 1 | Male 2 | 1 | Female 3 | 2 | Blue 4 | 2 | Green 5 | 2 | Brown PersonAttributes id | person_id | attr_id | value_id 1 | 1 | 1 | 1 2 | 1 | 2 | 3 3 | 2 | 1 | 2 4 | 2 | 2 | 4 5 | 3 | 1 | 1 6 | 3 | 2 | 4 In JPA, I have entities built for all of these tables. What I'd like to do is perform a search for all entities matching a given set of attribute-value pairs. For instance, I'd like to be able to find all males (John Doe and John Smith), all people with green eyes (Jane Roe or John Smith), or all females with green eyes (Jane Roe). I see that I can already take advantage of the fact that I only really need to match on value_id, since that's already unique and tied to the attr_id. But where can I go from there? I've been trying to do something like the following, given that the ValidValue is unique in all cases: select distinct p from Person p join p.personAttributes a where a.value IN (:values) Then I've tried putting my set of required values in as "values", but that gives me errors no matter how I try to structure that. I also have to get a little more complicated, as follows, but at this point I'd be happy with solving the first problem cleanly. However, if it's possible, the Attribute table actually has a field for default value: id | attr_name | default_value 1 | Sex | 1 2 | Eye Color | 5 If the value you're searching on happens to be the default value, I want it to return any people that have no explicit value set for that attribute, because in the application logic, that means they inherit the default value. Again, I'm more concerned about the primary question, but if someone who can help with that also has some idea of how to do this one, I'd be extremely grateful.

    Read the article

  • Design pattern to keep track UITableView rows correspondance to underlying data in constant time.

    - by DenNukem
    When my model changes I want to animate changes in UITableView by inserting/deleting rows. For that I need to know the ordinal of the given row (so I can construct NSIndexPath), which I find hard to do in better-than-linear time. For example, consider that I have a list of addressbook entries which are manualy sorted by the user, i.e. there is no ordering "key" that represents the sort order. There is also a corresponding UITableView that shows one row per addressbook entry. When UITableView queries the datasource I query the NSMUtableArray populated with my entries and return required data in constant time for each row. However, if there is a change in underlying model I am getting a notification "Joe Smith, id#123 has been removed". Now I have a dilemma. A naive approach would be to scan the array, determine the index at which Joe Smith is and then ask UITableView to remove that precise row from the view, also removing it form the array. However, the scan will take linear time to finish. Now I could have an NSDictionary which allows me to find Joe Smith in constant time, but that doesn't do me a lot of good because I still need to find his ordinal index within the array in order to instruct UITableView to remove that row, which is again a linear search. I could further decide to store each object's ordinal inside the object itself to make it constant, but it will become outdated after first such update as all subsequent index values will have changed due to removal of an object. So what is the correct design pattern to accurately reflect model changes in the UITableView in costant (or at least logarithmic) time?

    Read the article

  • [Java] Nested methods vs "piped" methods, which is better?

    - by Michael Mao
    Hi: Since uni, I've programming in Java for 3 years, although I am not fully dedicated to this language, I have spent quite some time in it, nevertheless. I understand both ways, just curious which style do you prefer. public class Test{ public static void main(String[] args) { System.out.println(getAgent().getAgentName()); } private static Agent getAgent() { return new Agent(); }} class Agent{ private String getAgentName() { return "John Smith"; }} I am pretty happy with nested method calls such like the following public class Test{ public static void main(String[] args) { getAgentName(getAgent()); } private static void getAgentName(Agent agent) { System.out.println(agent.getName()); } private static Agent getAgent() { return new Agent(); }} class Agent { public String getName(){ return "John Smith"; }} They have identical output I saw "John Smith" twice. I wonder, if one way of doing this has better performance or other advantages over the other. Personally I prefer the latter, since for nested methods I can certainly tell which starts first, and which is after. The above code is but a sample, The code that I am working with now is much more complicated, a bit like a maze... So switching between the two styles often blows my head in no time.

    Read the article

  • how to join tables sql server

    - by Rick
    Im having some trouble with joining two tables. This is what my two tables look like: Table 1 Customer_ID CustomerName Add. 1000 John Smith 1001 Mike Coles 1002 Sam Carter Table 2 Sensor_ID Location Temp CustIDFK 1000 NY 70 1002 NY 70 1000 ... ... 1001 1001 1002 Desired: Sensor_ID Location Temp CustIDFK 1000 NY 70 John Smith 1002 NY 70 Sam Carter 1000 ... ... John Smith 1001 Mike Coles 1001 1002 I have made Customer_ID from table 1 my primary key, created custIDFK in table 2 and set that as my foreign key. I am really new to sql server so I am still having trouble with the whole relationship piece of it. My goal is to match one customer_ID with one Sensor_ID. The problem is that the table 2 does not have "unique IDs" since they repeat so I cant set that to my foreign key. I know I will have to do either an inner join or outer join, I just dont know how to link the sensor id with customer one. I was thinking of giving my sensor_ID a unique ID but the data that is being inserted into table 2 is coming from another program. Any suggestions?

    Read the article

< Previous Page | 15 16 17 18 19 20 21 22 23 24 25 26  | Next Page >