I'm using Dataloader to Upsert a Child Account to Parent Account using an external ID.  When the Upsert is complete, it's creating a new account, it's not not connecting the Child Account to the Parent Account.  ((See Answer Below))
I'm using Dataloader to Upsert a Child Account to Parent Account using an external ID.  When the Upsert is complete, the Child overwrites the parent, it's not not connecting the Child Account to the Parent Account.  ((See Answer Below))
I have a list of items   John ID Matt ID John ID Scott ID Matt ID John ID Lucas ID   I want to shove them back into a list like so which also means I want to sort by the highest number of duplicates.   John ID 3 Matt ID 2 Scott ID 1 Lucas ID 1   Let me know how I can do this with LINQ and C#.  Thanks All  EDIT 2 Showing Code:      List&lt;game&gt; inventory = new List&lt;game&gt;();     drinkingforDataContext db = new drinkingforDataContext();     foreach (string item in tbTitle.Text.Split(' '))     {          List&lt;game&gt; getItems = (from dfg in db.drinkingfor_Games                                where dfg.game_Name.Contains(tbTitle.Text)                                select new game                                {                                    gameName = dfg.game_Name,                                    gameID = Boomers.Utilities.Guids.Encoder.EncodeURLs(dfg.uid)                                }).ToList&lt;game&gt;();          for (int i = 0; i &lt; getItems.Count(); i++)         {             inventory.Add(getItems[i]);         }     }      var items = (from xx in inventory                  group xx by xx into g                  let count = g.Count()                  orderby count descending                  select new                     {                         Count = count,                         gameName = g.Key.gameName,                         gameID = g.Key.gameID                     });      lvRelatedGames.DataSource = items;     lvRelatedGames.DataBind();   This query displays these results:   1 hello world times 1 hello world times 1 Hello World. 1 hello world times 1 hello world times 1 hello world times 1 Hello World. 1 hello world times   It gives me the count and name, but it doesn't give me the ID of the game....  It should display:   6 hello world times   234234 2 Hello World.  23432432 Do I need a visa to transit (or layover) in the Schengen area? The question is:     Are there square matrices $A,B$ over $\mathbb{C}$ s.t. $A^2+B^2=AB$ and $BA-AB$ is non-singular?   From $A^2+B^2=AB$ one could obtain $A^3+B^3=0$. Can we get something from this?  Edit:  $$A^2+B^2=AB\implies\\ A(A^2+B^2)=A^2B \implies\\ A^3+AB^2=A^2B \implies \\ A^3+(A^2+B^2)B=A^2B \implies \\  A^3+A^2B+B^3=A^2B \implies \\ A^3+B^3=0 $$ Stack Overflow, Stack Exchange, Area 51: What's the difference in a nutshell? Stack Overflow, Stack Exchange, Area 51: What's the difference in a nutshell? I've read the faq's and they all seem to be the same to me - Just Q &amp; A on a variety of topics.  What's the difference in a nutshell? If I have a software engineering question, which site is best for me to use? Generated Frattini Lemma Let $A$ be a normal subgroup of a group $G$. Let $B$ be a subgroup of   $A$ with the property that whenever $B_1 \leq A$ is conjugate to $B$   in $G$ then it is conjugate to $B$ in $A$. Prove that $G=AN_G(B)$   Help me some hints. Egyptian fractions with prime power denominators summing to 1? Inspired by        Can we solve the equation $$1=\frac{1}{a_1}+\frac{1}{a_2}+\frac{1}{a_3}+\cdots +\frac{1}{a_n}$$ where $a_1,a_2,a_3,\cdots ,a_n$ are distinct prime powers (primes are allowed) ?   I tried a modified greedy-algorithm with different starting vectors and brute force with $6$ entris with limit $200$, but did not find a representation. Custom sorting (non-alphabetical) How to find a Java Memory Leak How do you find a memory leak in Java (using, for example, JHat)? I have tried to load the heap dump up in JHat to take a basic look. However, I do not understand how I am supposed to be able to find the root reference () or whatever it is called. Basically, I can tell that there are several hundred megabytes of hash table entries ([java.util.HashMap$Entry or something like that), but maps are used all over the place... Is there some way to search for large maps, or perhaps find general roots of large object trees?  [Edit] Ok, I've read the answers so far but let's just say I am a cheap bastard (meaning I am more interested in learning how to use JHat than to pay for JProfiler). Also, JHat is always available since it is part of the JDK. Unless of course there is no way with JHat but brute force, but I can't believe that can be the case.  Also, I do not think I will be able to actually modify (adding logging of all map sizes) and run it for long enough for me to notice the leak. Can I purge configuration files after I've removed the package? I was doing a package removal with apt-get remove but then realized I should have done a --purge along with it to remove the configuration files.  Can I remove the packages configuration files easily or do I need to reinstall the package and then remove with a --purge? Prove Equivalence Relation in G Hei, guys!  I'm having some trouble with the next problem:  Let $A$ and $B$ be subgroups of $G$. Show that $\sim$ is an equivalence relation when it is defined as follows: $g\sim g'\Leftrightarrow g' = agb$ for some $a$ from $A$, $b$ from $B$.  Should I prove this is valid for any a and b? It says for some elements a and b. But I might as well take the unit element.   Could you give me a clue on how to solve it?  Cheers! Are there any official specifications regarding the torque for camera mounts? I've been wondering why I've never seen any official specifications of the maximum allowed torque that can be exerted upon lens mounts. It seems to me like a very useful specification, but I can't seem to find it from any manufacturer.  indicates that there might be no specifications for Nikon mounts. Are there really no manufacturer that publish these specification of their mounts? Why does String.split need pipe delimiter to be escaped? How do I disable the profiles button in Chrome? Since Chrome version 38, there's a pretty ugly button in the title bar of the Chrome window that allows you to switch profiles quickly.  Since I'm the only one that uses my computer, this is not really useful to me, and I'd rather reclaim the space for more open tabs.  I've looked in the settings but don't see a way to disable it.  How can I get rid of the button? The mdframed environment fails to break into several pages (slides) when used in a frame environment from the beamer class.  In the other hand, the boitecoloriee environment from the boites package can be broken into several pages.  Here is a document that demonstrates the issue. It should not be compiled directly into pdf because boitecoloriee uses pstricks.  \documentclass{beamer} \usepackage{xcolor,boites,boites_exemples,pstricks} \usepackage{mdframed} \usepackage{lipsum}  \begin{document}  \begin{frame}[allowframebreaks]{Using \texttt{boitecoloriee}}   \begin{boitecoloriee}     \lipsum[1-2]   \end{boitecoloriee} \end{frame}  \begin{frame}[allowframebreaks]{Using \texttt{mdframed}}   \begin{mdframed}     \lipsum[1-2]   \end{mdframed} \end{frame}  \end{document}   Maybe is there a way to fix mdframed to work in slides too. Any clues? Why does my pilot light keep going out? My furnace pilot light keeps going out so I changed the thermocouple. Now the furnace will come on and heat up to the degree set on my thermostat, then the pilot light will go out and the furnace will not come back on.    Could the thermostat be bad and cause the pilot light to go out? List of CSS features not supported by IE6 If $p,q,r$ are all primes,and $p|qr-1$,$q|pr-1$ and $r|pq-1$,find all possible values of $pqr$. If $p,q,r$ are all primes,and $p|qr-1$$~~~~~~~~~~~~~$$q|pr-1$$~~~~~~~~~~$ and $~r|pq-1$. Find all possible values of $pqr$.    My work: $qr-1=pk_1$ $pr-1=qk_2$ $pq-1=rk_3$ From the above equations, we can conclude that either $k_1,k_2,k_3$ are all even or one of the primes is $2$. I can also get that, $p^2q^2r^2=(pk_1+1)(qk_2+1)(rk_3+1)$ Now, I cannot proceed. Please help! How do I handle the window close event (user clicking the 'X' button) in a Python Tkinter program? Only squares instead of letters and numbers are displayed in my calculator and other apps in Ubuntu 18.04 I don't know what I did wrong in my Ubuntu 18.04 OS. For some reason some of my apps look like this:    This also happens to other gnome apps like pdf-reviewer and Logs. Window title, menu bar etc. are all blank, display only squares.  *Problem solved: I downloaded Google Fonts, saved them in a new folder, they can be applied system-wide, but after I did some font settings using Google Fonts it didn't work. I changed the font of Interface with Tweaks-Tool, that was what causing the problem. If $G$ is a compact topological group, how to show that a finite index subgroup of $G$ is open ? I really don't know where/how to start...  PS : I precise that by "compact" I mean that it is hausdorff and that any recovering of $G$ by open sets has a finite sub-recovering (sorry if I wasn't unclear)