I am using this to convert text to hash.  How should I convert the hash text to its original. It is needed to display the text.  C#:  private string HashPassword(string sText) { Byte[] data = System.Text.Encoding.UTF8.GetBytes(sText); Byte[] hash = new System.Security.Cryptography.SHA256CryptoServiceProvider().                ComputeHash(data); return Convert.ToBase64String(hash); }
The current top-voted to  states:     Another one that's not so much a security issue, although it is security-related, is complete and abject failure to grok the difference between hashing a password and encrypting it. Most commonly found in code where the programmer is trying to provide unsafe "Remind me of my password" functionality.   What exactly is this difference? I was always under the impression that hashing was a form of encryption. What is the unsafe functionality the poster is referring to?
Minecraft's got an "Open to LAN" feature, which can be used to set up a local server when two computers running Minecraft are on the same network. Some young relatives of mine use this to play together whenever they're in the same house, but they'd like to be able to play together from their respective residences.  A server is not optimal because it's a bit complex. I've tried using Tunngle to spoof that the computers are on the same connection to no avail.  How can I convince Minecraft's "Open to LAN" that their two separate computers are on the same network? List the files containing a particular word in their text Search functionality in lightning:datatable? Is there a way to search across all rows/columns in a lightning:datatable to narrow down the list, just like jQuery DataTables? If so, how do implement that?  Can I somehow do it all on the client-side to make it super fast (some sort of DOM manipulation)  I'm having some issues with the lightning:datatable not updating. I have attached my code below, maybe you can help me spot the issue:  Markup:  &lt;aura:component extends="c:Base" controller="AccountBrowserForm"&gt; &lt;aura:handler name="init" value="{! this }" action="{! c.doInit }"/&gt; &lt;aura:attribute name="selectedAccountId" type="Id" access="public" /&gt; &lt;aura:attribute name="accounts" type="Object"/&gt; &lt;aura:attribute name="mycolumns" type="List"/&gt; &lt;aura:attribute name="sortedBy" type="String" /&gt; &lt;aura:attribute name="sortedDirection" type="Boolean" default="true" /&gt;  &lt;aura:registerEvent name="AccountFilterChange" type="c:AccountFilterChange" /&gt;  &lt;aura:attribute name="backingdata" type="List" /&gt; &lt;aura:attribute name="filter" type="String" /&gt; &lt;lightning:input type="text" onchange="{!c.filter}" value="{!v.filter}" label="Filter" /&gt;  &lt;lightning:datatable aura:id="lightningTable"                      data="{! v.accounts }"                      columns="{! v.mycolumns }"                      keyField="Id"                      onrowaction="{! c.handleRowAction }"                      onsort="{!c.updateColumnSorting}"                      sortedBy="{!v.sortedBy}"                      sortedDirection="{!v.sortedDirection}"                      hideCheckboxColumn="true" /&gt;     Controller:  doInit: function (component, event, helper) {     helper.callServer(component, "c.getAccounts", $A.getCallback(function (response) {         component.set("v.accounts", response);         component.set("v.backingdata", response);         console.log(component.get("v.backingdata") + " /// BACKING DATA INSIDE ")         console.log(component.get("v.accounts") + " // ACCOUTN DATA INSIDE")          component.set('v.mycolumns', [{                 type: "button",                 typeAttributes: {                     label: '',                     iconName: 'utility:add',                     name: 'selectRecord',                     title: 'selectRecord',                     disabled: false,                     value: 'edit',                     variant: {                         fieldName: 'variantValue'                     },                 }             },             {label: 'Name', fieldName: 'Name', type: 'text', sortable: true},             {label: 'Street', fieldName: 'BillingStreet', type: 'text', sortable: true},             {label: 'Postal Code', fieldName: 'BillingPostalCode', type: 'text', sortable: true},             {label: 'City', fieldName: 'BillingCity', type: 'text', sortable: true},             {label: 'Country', fieldName: 'BillingCountry', type: 'text', sortable: true},         ]);          console.log(component.get("v.backingdata") + " *** BACKING DATA OUTSIDE *** ")         console.log(component.get("v.accounts") + " *** ACCOUNT DATA OUTSIDE *** ")     })) },  filter: function (component, event, helper) {     var data = component.get("v.backingdata"),         term = component.get("v.filter"),         results = data,         regex;     try {         regex = new RegExp(term, "i");         // filter checks each row, constructs new array where function returns true         results = data.filter(row =&gt; regex.test(row.name) || regex.test(row.age.toString()));     } catch (e) {         // invalid regex, use full list     }     component.set("v.accounts", results); },   For some reason the filter function is completely unresponsive. Also, does it matter that I'm populating the component with a response from a callback function. @sfdcfox, I noticed in your example that you simple created an array with dummy data. My "myaccounts" attribute is of type object How to find out if my system is i386 or x86_64 before installing Ubuntu? I am using Windows as of now and want to install Ubuntu. I want to find out if my system is i386 or x86_64? How do I do that? Cannot get grub menu to timeout (or go away) Issue with particles in blender donut tutorial Alright, I'm toying around with converting a PIL image object back and forth to a numpy array so I can do some faster pixel by pixel transformations than PIL's PixelAccess object would allow.  I've figured out how to place the pixel information in a useful 3D numpy array by way of:  pic = Image.open("foo.jpg") pix = numpy.array(pic.getdata()).reshape(pic.size[0], pic.size[1], 3)   But I can't seem to figure out how to load it back into the PIL object after I've done all my awesome transforms.  I'm aware of the putdata() method, but can't quite seem to get it to behave. I have a matrix:  $$ A=\begin{bmatrix}1 &amp; a \\ 0 &amp; 1\end{bmatrix} $$  which satisfies: $A\left( e_{1}\right)=e_{1},A\left( e_{2}\right)=ae_{1}+e_{2}, a\neq 0$  I need compute all powers $A^{n}, n\in \mathbb{Z}$ and find their matrices.  $$ A^n= \begin{bmatrix}1 &amp; na \\ 0 &amp; 1\end{bmatrix} $$  Is it true?  Is there a basis of $V$ (if $V$ is a 2-dimensional real vector space with basis $\left\{e_{1},e_{2}\right\}$) so that the matrix of $A$ is diagonal? Feature request - links underlined I would like to capture the contents of AJAX requests using Greasemonkey.  Does anybody know how to do this? How to install "vanilla" TeXLive on Debian or Ubuntu? Debian and Ubuntu have very good texlive packaging. But I'd like to use tlmgr to have a more fine-grained control about upgrades and which packages I want to be installed.   So how do I install "vanilla" TeXLive on Debian/Ubuntu?   Also how do I make dpkg aware that I have TeXLive installed? Mysterious cord running from wall. Safe? My wife and I are preparing to sell our home and are discovering some weird things. Our home was built in 1958, so it is older. We found this in a corner that had some furniture in front of it.   We are wondering    What kind of wiring is this?  Is it safe to handle or remove? Is it possible to put commands in /etc/motd? Can I put shell commands in the /etc/motd login banner file? I have tried:   $(uptime)   and  `uptime`   Is this possible? When I need to generate unique id's based on some information hashing is typical choice. However, sometimes that id needs to be of a particular size.  I've seen a lot of schemes (HMAC-MD5-96 in SSH, CGA in SeND for IPv6) that use a portion of a hash, so I'm thinking it might be alright to use it that way.    Which properties of a hash are preserved and which do not apply anymore?  Obviously, with less bits, the chance of collision goes up, but can I still rely on the partial hash for uniform character distribution?  What about the ?  I'm guessing that if a hash modifies the entire hash upon the smallest change to the input, that would imply that a portion of that hash would be equally well changed.  Am I thinking about this correctly?  Also, would these behaviors be different for different hashing algorithms? Are mixed geometry types allowed in shapefiles? Does the shapefile support mixed geometry types (ie. point and polygon all in the same file)? Inserting random numbers into a table in MYSQL My linear algebra professor proved that      Diagonalizable matrices with complex values are dense in set of $n \times n$ complex matrices.   He defined a metric (I believe) that was somehow related to the usual metric on $\mathbb{R}^{n^2}$.  Then somehow proved that diagonalizable matrices were dense because for any matrix $A$ if $\det(A - \lambda I) = 0$ on an open subset, then $\det(A - \lambda I)$ was the zero polynomial.  I Googled around a bit and found some stuff talking about the Zariski topology, and I am not sure this is what I want. Most of what I have found on this topology is much more general than what he was doing.  Does anyone know any resources that would explain how to go about proving this statement?  Edit: I found out how to prove this the way my professor did.  We define the norm of a matrix by $$ |A| = \max\{|Ax| : |x| = 1 \}.$$ Now we have a distance $d(A, B) &lt; \epsilon$. You can prove that if $(A - B)_{ij} &lt; \epsilon/n$, then $|A - B| &lt; \epsilon$.  Let $p(x)$ be the characteristic polynomial of $A$, an $n \times n$ matrix.  $$p(x) = \prod_1^n (x - x_i) = x^n + (-1)\sigma_1 x^{n - 1} + \cdots + (-1)^n\sigma_n$$ where $\sigma_1, \ldots, \sigma_n$ are the elementary symmetric polynomials of $x_1, \ldots, x_n$ which are the eigenvalues.  The discriminant of the characteristic polynomial is a symmetric polynomial, therefore it can be written in terms of the elementary symmetric polynomials, which in turn can be written in terms of the entries of the matrix.  But since the discriminant is a polynomial, it only has finitely many roots. Therefore for $\epsilon &gt; 0$, by changing the entries of the matrix less than $\epsilon / n$ we can find a new matrix $B$ such that $|B - A| &lt; \epsilon$ and the discriminant is not zero.   The discriminant being not zero means $B$ has distinct eigenvalues, thus has a basis of eigenvectors. Therefore, it is diagonalizable.  Thus the set of diagonalizable matrices is dense in the set of matrices with respect to that metric. Add leading zeroes to number in Java? How do you remove Nvidia's proprietary drivers? I always seem to have grief with Nvidia drivers and have often had to re-install Ubuntu: is there a better way to remove them? When I first installed the drivers, the display came up on 640 by 480.  I managed to set 2 screens to 1024 by 780 which was usable, but then Ubuntu recommended installing proprietary drivers (nvidia-current-updates 295.40-ubuntu1). After doing this and re-booting it shows LAPTOP and offers only 640 by 480 on a single screen.   Is there any way to revert to the original driver? Is there any way to find out if the new drivers work before installing them? - For years I have been hoping that it would be all fixed in the latest release… I always seem to fall for this! Statistical inference when the sample "is" the population