I desire to list all inodes in current directory that are regular files (i.e. not directories, links, or special files), with ls -la (ll).  I went to the man ls searching for type and found only this which I didn't quite understand in that regard:     --indicator-style=WORD      append indicator with style WORD to entry names: none (default), slash   (-p),  file-type  (--file-type),                 classify (-F)   How could I list only regular files with ls -la (ll as my shortcut in Ubuntu 18.04)?
I can use ls -ld */ to list all the directory entries in the current directory. Is there a similarly easy way to just list all the regular files in the current directory? I know I can use find  find . -maxdepth 1 -type f   or stat  stat -c "%F %n" * | grep "regular file" | cut -d' ' -f 3-   but these do not strike me as being overly elegant. Is there a nice short way to list only the regular files (I don't care about devices, pipes, etc.) but not the sub-directories of the current directory? Listing symbolic links as well would be a plus, but is not a necessity.
.NET Casting Generic List I originally read this book in the mid- to late '70s.   The premise was a bureaucracy whose job it was to manipulate events in human history by making the smallest possible change that would effect the desired outcome. Not time cops in the sense of going after law breakers.  The intent was to maintain a policy of non-interference as much as possible but when interference was warranted then to make the least possible change and to do so invisibly.  For example, they might take someone's keys off the dresser and put them just out of sight underneath the dresser where they plausibly might have fallen.  The subject would never know of the manipulation but would then be delayed getting out of the house and the ripples grew from there to avert a war or otherwise affect events on a large scale.  After reading that, whenever I would lose something - especially in an improbable way such as dropping a screw at my feet and then finding it on the other side of the room half an hour later - I would take some consolation in the thought that I had just averted some global catastrophe.  I was pretty scatterbrained as a kid (we call that ADHD nowadays) so I experienced this a lot.  Given that I've spent so much time pondering the ideas from the book, I'd love to re-read it. Update (March, 2012): This has been rolled out to all sites in the network.    Behind the scenes we've been hard at work making some changes to how we track reputation.  Here are some of the issues we're aiming to address with these changes:   Reputation Skew (your actual reputation doesn't match what's shown) Up/Down votes oddities (mostly with the daily rep cap, the magical +2) Historical Deletes (not impacting rep immediately, contributing to skew) Unaccepts (display issues in the profile) User Deletion (magically missing rep, another skew contributor)   To be clear: reputation values are not changing, every action in the system is still worth the same amount.   Here’s what will be different:   Your reputation will be correct at all times Deletions will have a much more immediate effect on reputation, not waiting on a recalc  (but reputation sync takes up to 5 minutes on a delete/undelete action; as to not block the user's response thread, it's offloaded to a background queue) Recalcs will no longer be necessary Up/Down vote reversals will restore the correct reputation amount Up/Down vote reversals will correctly adjust to the reputation cap The reputation history in your profile will be more detailed and accurate (e.g. when a post is deleted, you'll see that in the reputation tab of your profile)   This means your reputation will go up and down more than it has previously, but it will be in sync.  To think of it more easily: imagine that a recalc will be done after every action in the system.  Probably the biggest impact many will be concerned with is that you may see your reputation drop in cases where it didn't seem like it did before  This was effectively happening before, but the results of that change were not applied immediately, but on the next rep recalc.  Post deletion is the biggest factor here, previously it didn't (immediately) account for the reputation impact...that will no longer be the case.  Reputation changes from the deletion will now be applied within the hour, and most other changes will be instant.  Now the part that will make everyone throw vegetables our way:  this will require a global recalc to get everything in sync.  We'll be rolling it out first here on meta, then the rest of the network...the enabling of the detailed rep view and global recalc on each individual site will coincide.  During the rollout you will see empty reputation tabs on profiles as we transition to the new storage behind the scenes, they'll be restored as the recalc rolls though each user.  We’ll put up a blog post on  before the network-wide rollout.  If you have any questions about this change or details I may have left out, please do so in answers below so that we can clear up as much as possible before this rolls out. How to enable linking floating point library in TurboC? What are the requirements for a (beta) site logo? I have a file with values organized in columns, and separated by commas, as in the file below:   324,01,1,113333600000,1,, 016,01,1,134954200000,1,, 770,01,1,109069200000,1,, 853,01,1,111518800000,1,,   When I use the following awk command, the delimiter is being changed from commas to spaces   Code:  awk -F, '{$4=$4/1024}{print $0}'   The output becomes:   324 01 1 110677343.75 1   016 01 1 131791210.93 1   770 01 1 106512890.62 1   853 01 1 108905078.12 1    How can I change the value of the field without changing the delimiter? Is there a benchmark tool for Ubuntu? Is there a benchmark tool to measure computer performance for Ubuntu like SuperPI, 3DMark, or PCMark? I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   Also I'm unable to install updates using the terminal. How do I find out word count in pages 5.2.2 I often write short articles and am limited to 100 words per document.   Can I find word counts in pages 5.2.2? Parsing XML, JSON, and newer data file formats in UNIX using command line utilities The Unix environment has some excellent tools for parsing text in various forms. However, of late, the data is not in the traditional (historical) formats (CSV, TSV, record-based or some other delimiter-based) it used to be before. Data these days is exchanged in structured formats like XML/JSON.  I know there are some good tools like sed, awk and Perl which can chew down nearly any form of data out there. However, to work with this sort of structured data, often one has to write a complete program, and, given the little time available to extract information, one has to sit down and figure out the whole logic of what one wants to query and put it down programmatically. Sometimes this is not OK – basically because the information extracted from those files acts as inputs for further work; also because of the time it takes to search for the appropriate solution and code it up. A command line tool is needed with sufficient switches to find, query and dump data.  I'm looking for tools that take a XML/JSON or other forms of structured data and dump it into other formats like csv, etc., so that from there one could use other commands to get any information out of it.  Are there any command line utilities you know of which do this kind of a job? Are there already awk/Perl scripts available to this? I know we can use both Present Simple and Present Continuous to describe future actions. But I don't know when to use the correct form.   For example:  We fly to Paris next week.  We are flying to Paris next week.   These sentences both seem correct to me.  Can anyone explain me how to correctly use these tenses? What are attributes in .NET? Images broken on a Stack Overflow blog post On the  blog post, nearly all the images are broken. I assume this is because they are all hosted on stackoverflow.blog/wp-content/uploads/ rather than zgab33vy595fw5zq-zippykid.netdna-ssl.com/wp-content/uploads/, and they got destroyed in the removal of Blog Overflow. I looked around at a few other blog posts, and this post seems to be the only one having an issue. Let $I = \langle 2\rangle$. Prove $I[x]$ is not a maximal ideal of $\mathbb Z[x]$ even though $I$ is a maximal ideal of $\mathbb Z$.   My professor mentioned that I should try adding something to it to prove that $I[x]$ is not the maximal ideal. I want to assume he meant to add $ \langle 2 \rangle$ to $I[x]$? Can you make a bonus-action attack from Two-Weapon Fighting before you take your action? The rules on  state:     When you take the Attack action and attack with a light melee weapon that you’re holding in one hand, you can use a bonus action to attack with a different light melee weapon that you’re holding in the other hand.   However, the description of  states:     You choose when to take a bonus action during your turn, unless the bonus action’s timing is specified   So, can you attack with your bonus action first? Is it true that a dihedral group is nonabelian?  I'm not sure if the result is true. I checked it for some lower order and I think the result may correct.   But I failed to prove/disprove the result. From the third week ( when does it actually begin) This describes a certain natural process that takes 15 weeks  It describes what a certain component looks like at some point in time during a naturallly occurring process  What I don't get is if it means it appears this way starting in the third week or after ?  Here's the full sentence  "The malleus first appears as a cartilage model from the third week"  Thanks again for you support guys Give a combinatorial proof to show the following for all integers $n \geq 2$. $$2^{n-2} n (n -1) = \sum\limits_{k=2}^n k (k - 1) \binom{n}{k}.$$  I'm completely stumped. I just have no idea how to do this. What I've tried so far has been simplifying the right hand side slightly to $\sum\limits_{k=2}^n \binom{n}{k - 2}$, and then proving that this somehow is equal to some manipulation of the left hand side. I can't seem to find any breakthroughs that way though.  If anyone could help out or point me in the right direction that would be great.  EDIT: I've actually just realized my simplification of the right hand side is wrong. Now I'm even more stuck. When should I use a List vs a LinkedList What Happened to TK-421?