<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.itcollege.ee/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jkuzmin</id>
	<title>ICO wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.itcollege.ee/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jkuzmin"/>
	<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php/Special:Contributions/Jkuzmin"/>
	<updated>2026-05-08T02:53:57Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115652</id>
		<title>Talk:Finger</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115652"/>
		<updated>2016-12-08T18:39:10Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Author: Jevgeni Kuzmin &amp;lt;br/&amp;gt;&lt;br /&gt;
Group: A21&lt;br /&gt;
&lt;br /&gt;
Hinnang oli tehtud 8.12.16 kell 20:30&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; border=&amp;quot;1&amp;quot; &lt;br /&gt;
|- &lt;br /&gt;
! KRITEERIUM &lt;br /&gt;
! KAAL &lt;br /&gt;
! HINNANG &lt;br /&gt;
! SELGITUS &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Skoop &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Sisaldab piisavalt infot esmakasutajale.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Artikli tutvustus ja versioon &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Artikli tutvustus on lühike ja konkreetne&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sissejuhatus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,2&lt;br /&gt;
| Sissejuhatus võiks olla suurem&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Tehniliselt korrektne &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Tehniliselt tundub kõik korras olevat.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kasutatud kirjandus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Viidatud kirjandus on olemas.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Näited kasutamiseks/käsud &lt;br /&gt;
| 1 &lt;br /&gt;
| 0,4&lt;br /&gt;
| Näited saaks rohkem olla&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sisu &lt;br /&gt;
| 4 &lt;br /&gt;
| 3,5&lt;br /&gt;
| Sisu võiks alati rohkem olla, aga põhiline on välja toodud, vähemalt esmaseks tutvumiseks.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Ülesehitus &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Peatükid on loogilises järjekorras.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kirjavead ja õigekiri &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Töö on kirjutatud inglise keeles, loodan, et koik on õigesti kirjutatud&lt;br /&gt;
|&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kokku &lt;br /&gt;
| 10 &lt;br /&gt;
| 8,6&lt;br /&gt;
| &lt;br /&gt;
|- &lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115650</id>
		<title>Talk:Finger</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115650"/>
		<updated>2016-12-08T18:37:44Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Author: Jevgeni Kuzmin &lt;br /&gt;
Group: A21&lt;br /&gt;
&lt;br /&gt;
Hinnang oli tehtud 8.12.16 kell 20:30&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; border=&amp;quot;1&amp;quot; &lt;br /&gt;
|- &lt;br /&gt;
! KRITEERIUM &lt;br /&gt;
! KAAL &lt;br /&gt;
! HINNANG &lt;br /&gt;
! SELGITUS &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Skoop &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Sisaldab piisavalt infot esmakasutajale.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Artikli tutvustus ja versioon &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Artikli tutvustus on lühike ja konkreetne&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sissejuhatus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,2&lt;br /&gt;
| Sissejuhatus võiks olla suurem&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Tehniliselt korrektne &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Tehniliselt tundub kõik korras olevat.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kasutatud kirjandus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Viidatud kirjandus on olemas.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Näited kasutamiseks/käsud &lt;br /&gt;
| 1 &lt;br /&gt;
| 0,4&lt;br /&gt;
| Näited saaks rohkem olla&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sisu &lt;br /&gt;
| 4 &lt;br /&gt;
| 3,5&lt;br /&gt;
| Sisu võiks alati rohkem olla, aga põhiline on välja toodud, vähemalt esmaseks tutvumiseks.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Ülesehitus &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Peatükid on loogilises järjekorras.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kirjavead ja õigekiri &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Töö on kirjutatud inglise keeles, loodan, et koik on õigesti kirjutatud&lt;br /&gt;
|&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kokku &lt;br /&gt;
| 10 &lt;br /&gt;
| 8,6&lt;br /&gt;
| &lt;br /&gt;
|- &lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115649</id>
		<title>Talk:Finger</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115649"/>
		<updated>2016-12-08T18:36:28Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{| class=&amp;quot;wikitable&amp;quot; border=&amp;quot;1&amp;quot; &lt;br /&gt;
|- &lt;br /&gt;
! KRITEERIUM &lt;br /&gt;
! KAAL &lt;br /&gt;
! HINNANG &lt;br /&gt;
! SELGITUS &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Skoop &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Sisaldab piisavalt infot esmakasutajale.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Artikli tutvustus ja versioon &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Artikli tutvustus on lühike ja konkreetne&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sissejuhatus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,2&lt;br /&gt;
| Sissejuhatus võiks olla suurem&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Tehniliselt korrektne &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Tehniliselt tundub kõik korras olevat.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kasutatud kirjandus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Viidatud kirjandus on olemas.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Näited kasutamiseks/käsud &lt;br /&gt;
| 1 &lt;br /&gt;
| 0,4&lt;br /&gt;
| Näited saaks rohkem olla&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sisu &lt;br /&gt;
| 4 &lt;br /&gt;
| 3,5&lt;br /&gt;
| Sisu võiks alati rohkem olla, aga põhiline on välja toodud, vähemalt esmaseks tutvumiseks.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Ülesehitus &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Peatükid on loogilises järjekorras.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kirjavead ja õigekiri &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Töö on kirjutatud inglise keeles, loodan, et koik on õigesti kirjutatud&lt;br /&gt;
|&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kokku &lt;br /&gt;
| 10 &lt;br /&gt;
| 8,6&lt;br /&gt;
| &lt;br /&gt;
|- &lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115648</id>
		<title>Talk:Finger</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Talk:Finger&amp;diff=115648"/>
		<updated>2016-12-08T18:34:04Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: Created page with &amp;quot;{| class=&amp;quot;wikitable&amp;quot; border=&amp;quot;1&amp;quot;  |-  ! KRITEERIUM  ! KAAL  ! HINNANG  ! SELGITUS  |-    |-  | Skoop  | 0,5  | 0,5 | Sisaldab piisavalt infot esmakasutajale. |-   |-  | Artikli...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{| class=&amp;quot;wikitable&amp;quot; border=&amp;quot;1&amp;quot; &lt;br /&gt;
|- &lt;br /&gt;
! KRITEERIUM &lt;br /&gt;
! KAAL &lt;br /&gt;
! HINNANG &lt;br /&gt;
! SELGITUS &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Skoop &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Sisaldab piisavalt infot esmakasutajale.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Artikli tutvustus ja versioon &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Artikli tutvustus on lühike ja konkreetne&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sissejuhatus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,2&lt;br /&gt;
| Sissejuhatus võiks olla suurem&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Tehniliselt korrektne &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Tehniliselt tundub kõik korras olevat.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kasutatud kirjandus &lt;br /&gt;
| 0,5 &lt;br /&gt;
| 0,5&lt;br /&gt;
| Viidatud kirjandus on olemas.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Näited kasutamiseks/käsud &lt;br /&gt;
| 1 &lt;br /&gt;
| 0,4&lt;br /&gt;
| Näited saaks rohkem olla&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Sisu &lt;br /&gt;
| 4 &lt;br /&gt;
| 3,5&lt;br /&gt;
| Sisu võiks alati rohkem olla, aga põhiline on välja toodud, vähemalt esmaseks tutvumiseks.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Ülesehitus &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Peatükid on loogilises järjekorras.&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kirjavead ja õigekiri &lt;br /&gt;
| 1 &lt;br /&gt;
| 1&lt;br /&gt;
| Töö on kirjutatud inglise keeles, loodan, et koik on õigesti kirjutatud&lt;br /&gt;
| -&lt;br /&gt;
&lt;br /&gt;
|- &lt;br /&gt;
| Kokku &lt;br /&gt;
| 10 &lt;br /&gt;
| 8,6&lt;br /&gt;
| &lt;br /&gt;
|- &lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Finger&amp;diff=115642</id>
		<title>Finger</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Finger&amp;diff=115642"/>
		<updated>2016-12-08T18:23:18Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Author */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Finger}}&lt;br /&gt;
&lt;br /&gt;
= Author =&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Nimi:&#039;&#039;&#039; Aleksandr Laada A21&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Esitamise kuupaev:&#039;&#039;&#039; 07.12.2016&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Retsensioon:&#039;&#039;&#039; [[Talk:Finger]] Jevgeni Kuzmin A21&lt;br /&gt;
== Description ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;finger&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility displays information about the system users.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Syntax==&lt;br /&gt;
&lt;br /&gt;
 finger [-options] [user ...] [user@host ...]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&lt;br /&gt;
Options are:&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-4&#039;&#039;&#039;   -  Forces finger to use IPv4 addresses only.&lt;br /&gt;
*&#039;&#039;&#039;-6&#039;&#039;&#039;   -  Forces finger to use IPv6 addresses only.&lt;br /&gt;
*&#039;&#039;&#039;-s&#039;&#039;&#039;   -  Display the user&#039;s login name, real name, terminal name and write status (as a &amp;lt;nowiki&amp;gt;``*&#039;&#039;&amp;lt;/nowiki&amp;gt; before the terminal name if write permission is denied), idle time, login time, and either office location and office phone number, or the remote host.&lt;br /&gt;
Unknown devices as well as nonexistent idle and login times are displayed as single asterisks.&lt;br /&gt;
*&#039;&#039;&#039;-h&#039;&#039;&#039;   -  When used in conjunction with the -s option, the name of the remote host is displayed instead of the office location and office phone.&lt;br /&gt;
*&#039;&#039;&#039;-o&#039;&#039;&#039;   -  When used in conjunction with the -s option, the office location and office phone information is displayed instead of the name of the remote host.&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-g&#039;&#039;&#039;   -  This option restricts the gecos output to only the users&#039; real name.  It also has the side-effect of restricting the output of the remote host when used in conjunction with the -h option.&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-k&#039;&#039;&#039;   -   Disable all use of the user accounting database.&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-l&#039;&#039;&#039;   -   Produce a multi-line format displaying all of the information described for the -s option as well as the user&#039;s home directory, home phone number, login shell, mail status, and the contents of the files .forward, .plan, .project and .pubkey from the user&#039;s home directory.&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-p&#039;&#039;&#039;   -   Prevent the -l option of finger from displaying the contents of the .forward, .plan, .project and .pubkey files.&lt;br /&gt;
&lt;br /&gt;
*&#039;&#039;&#039;-m&#039;&#039;&#039;   -   Prevent matching of user names.  User is usually a login name; however, matching will also be done on the users&#039; real names-, unless the -m option is supplied.  All name matching performed by finger is case insensitive.&lt;br /&gt;
&lt;br /&gt;
===Notice===&lt;br /&gt;
&lt;br /&gt;
*If no options are specified, finger defaults to the -l style output if operands are provided, otherwise to the -s style. Note that some fields may be missing, in either format, if information is not available for them.&lt;br /&gt;
&lt;br /&gt;
*If no arguments are specified, finger will print an entry for each user currently logged into the system.&lt;br /&gt;
&lt;br /&gt;
*The finger utility may be used to look up users on a remote machine.  The format is to specify a user as ``user@host&#039;&#039;, or ``@host&#039;&#039;, where the default output format for the former is the -l style, and the default output format for the latter is the -s style.  The -l option is the only option that may be passed to a remote machine.&lt;br /&gt;
&lt;br /&gt;
*If the file .nofinger exists in the user&#039;s home directory, and the program is not run with superuser privileges, finger behaves as if the user in question does not exist.&lt;br /&gt;
&lt;br /&gt;
*The optional finger.conf configuration file can be used to specify aliases.  Since finger is invoked by fingerd, aliases will work for both local and network queries.&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
&lt;br /&gt;
1. View detail about a particular user&lt;br /&gt;
&lt;br /&gt;
finger command will display login, username, home directory, shell information about a particular user as shown below.&lt;br /&gt;
&lt;br /&gt;
 $ finger sathiya&lt;br /&gt;
 Login: sathiya                          Name: (null)&lt;br /&gt;
 Directory: /home/sathiya                Shell: /bin/bash&lt;br /&gt;
 On since Mon Nov  1 18:45 (IST) on :0 (messages off)&lt;br /&gt;
 On since Mon Nov  1 18:46 (IST) on pts/0 from :0.0&lt;br /&gt;
 New mail received Fri May  7 10:33 2010 (IST) &lt;br /&gt;
 Unread since Sat Jun  7 12:59 2008 (IST)&lt;br /&gt;
 No Plan.&lt;br /&gt;
2. View login details and Idle status about an user&lt;br /&gt;
&lt;br /&gt;
You can use finger -s option to view the login detail for a particular user.&lt;br /&gt;
&lt;br /&gt;
 $ finger -s root&lt;br /&gt;
 Login     Name       		Tty      Idle  Login Time   Office     Office Phone&lt;br /&gt;
 root         root           *1    19d Wed 17:45&lt;br /&gt;
 root         root           *2     3d Fri 16:53&lt;br /&gt;
 root         root           *3        Mon 20:20&lt;br /&gt;
 root         root           *ta    2  Tue 15:43&lt;br /&gt;
 root         root           *tb    2  Tue 15:44&lt;br /&gt;
&lt;br /&gt;
==Files==&lt;br /&gt;
&lt;br /&gt;
 /etc/finger.conf - alias definition data base&lt;br /&gt;
&lt;br /&gt;
 /var/log/utx.lastlogin - last login data base&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;finger&amp;lt;/code&amp;gt; This variable may be set with favored options to finger.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&lt;br /&gt;
*To use Finger, it is necessary for the host computer to run the Finger daemon (a program running in the background) which will answer Finger requests. &lt;br /&gt;
&lt;br /&gt;
*Finger is not designed to log requests.  So finding out who is Fingering you is complicated.&lt;br /&gt;
&lt;br /&gt;
==Bugs==&lt;br /&gt;
&lt;br /&gt;
*The finger utility does not recognize multibyte characters.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;finger&amp;lt;/code&amp;gt; command appeared in 3.0BSD&lt;br /&gt;
&lt;br /&gt;
Finger was one of the first computer network applications. It enabled people to see who else was using the computer system as well as find basic information on that user.  (Zimmerman 1991)&lt;br /&gt;
&lt;br /&gt;
Last version: 0.17-15&lt;br /&gt;
&lt;br /&gt;
==Standarts==&lt;br /&gt;
&lt;br /&gt;
* [https://tools.ietf.org/html/rfc742 RFC 742](December 1977)&lt;br /&gt;
* [https://tools.ietf.org/html/rfc1288 RFC 1288](December 1991)&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
http://www.unix.com/man-page/freebsd/1/finger/&lt;br /&gt;
&lt;br /&gt;
http://www.rajivshah.com/Case_Studies/Finger/Finger.htm#_Toc484593855&lt;br /&gt;
&lt;br /&gt;
http://linux.101hacks.com/unix/finger/&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115391</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115391"/>
		<updated>2016-12-06T11:39:18Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Author */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Author=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
[[Uniq:Retsensioon]] Aleksandr Laada A21&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;NOTES&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115390</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115390"/>
		<updated>2016-12-06T11:38:54Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Author */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Author=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
[Uniq:Retsensioon] Aleksandr Laada A21&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;NOTES&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115368</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115368"/>
		<updated>2016-12-05T19:17:07Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Autor */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Author=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;NOTES&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115367</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115367"/>
		<updated>2016-12-05T19:15:14Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;NOTES&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115366</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115366"/>
		<updated>2016-12-05T19:13:44Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Related commands */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;NOTES&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115365</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115365"/>
		<updated>2016-12-05T19:13:16Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Related commands */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Notes&#039;&#039;&#039;&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115364</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115364"/>
		<updated>2016-12-05T19:12:53Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Notes */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115363</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115363"/>
		<updated>2016-12-05T19:11:26Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115362</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115362"/>
		<updated>2016-12-05T19:08:15Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Options */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
*&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
*&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115361</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115361"/>
		<updated>2016-12-05T18:42:37Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kasutatud materjalid */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115359</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115359"/>
		<updated>2016-12-05T18:38:54Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kasutatud materjalid */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Kasutatud materjalid==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
http://www.computerhope.com/unix/uuniq.htm&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115358</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115358"/>
		<updated>2016-12-05T18:35:52Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kasutatud materjalid */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Kasutatud materjalid==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category: Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115357</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115357"/>
		<updated>2016-12-05T18:34:44Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Kasutatud materjalid==&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115356</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115356"/>
		<updated>2016-12-05T18:32:39Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Synopsis==&lt;br /&gt;
   uniq [-c | -d | -u] [-i] [-f num] [-s chars] [input_file [output_file]]&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115355</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115355"/>
		<updated>2016-12-05T18:29:29Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kasutatud materjalid */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
https://web.archive.org/web/20051028205957/http://www.linuxmanpages.com/man1/uniq.1.php&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115354</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115354"/>
		<updated>2016-12-05T17:49:52Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Options */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines. &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115353</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115353"/>
		<updated>2016-12-05T17:49:31Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Options */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
delimit-method={none(default),prepend,separate} Delimiting is done with blank lines.&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115352</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115352"/>
		<updated>2016-12-05T17:47:47Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kasutatud materjalid */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
https://www.freebsd.org/cgi/man.cgi?query=uniq&amp;amp;sektion=1&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115351</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115351"/>
		<updated>2016-12-05T17:45:02Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Kasutatud materjalid=&lt;br /&gt;
http://www.thegeekstuff.com/2013/05/uniq-command-examples &amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115350</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115350"/>
		<updated>2016-12-05T17:35:16Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Examples */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -D myfile.txt&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115349</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115349"/>
		<updated>2016-12-05T17:20:47Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Examples */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115348</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115348"/>
		<updated>2016-12-05T17:19:01Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==What is the uniq command in UNIX?==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command in UNIX is a command line utility for reporting or filtering repeated lines in a file. It can remove duplicates, show a count of occurrences, show only repeated lines, ignore certain characters and compare on specific fields. The command expects adjacent comparison lines so it is often combined with the &#039;&#039;&#039;&amp;lt;code&amp;gt;sort&amp;lt;/code&amp;gt;&#039;&#039;&#039; command.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115347</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115347"/>
		<updated>2016-12-05T16:56:05Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Options */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; - Print all duplicate lines &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115344</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=115344"/>
		<updated>2016-12-05T16:52:56Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; - report or filter out repeated lines in a file. &lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility reads the specified input_file comparing adjacent lines, and writes a copy of each unique input line to the output_file.  If input_file is a single dash (`-&#039;) or absent, the standard input is read. If output_file is absent, standard output is used for output.  The second and succeeding copies of identical adjacent input lines are not written. Repeated lines in the input will not be detected if they are not adjacent, so it may be necessary to sort the files first.&lt;br /&gt;
&lt;br /&gt;
==Options==&lt;br /&gt;
&#039;&#039;&#039;-c&#039;&#039;&#039;, --count; - Precede each output line with the count of the number of times the line occurred in the input, followed by a single space.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-d &#039;&#039;&#039;, --repeated ; - Only output lines that are repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-D &#039;&#039;&#039;, --all-repeated; &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-f &#039;&#039;&#039;, --skip-fields=N ; - Ignore the first num fields in each input line when doing comparisons. A field is a string of non-blank characters separated from adjacent fields by blanks. Field numbers are one based, i.e., the first field is field one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-i &#039;&#039;&#039;, --ignore-case ; -  Case insensitive comparison of lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-s &#039;&#039;&#039;, --skip-chars=N ; - Ignore the first chars characters in each input line when doing comparisons. If specified in conjunction with the -f option, the first chars characters after the first num fields will be ignored. Character numbers are one based, i.e., the first character is character one.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-u &#039;&#039;&#039;, --unique ; -  Only output lines that are not repeated in the input.&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;-w &#039;&#039;&#039;, --check-chars=N ; - Compare no more than N characters in lines.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
Let&#039;s say we have an eight-line text file, myfile.txt, which contains the following text:&lt;br /&gt;
&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here are several ways to run uniq on this file, and the output it creates:&lt;br /&gt;
   uniq myfile.txt&lt;br /&gt;
&lt;br /&gt;
This is a line.&lt;br /&gt;
 &lt;br /&gt;
This is also a line.&lt;br /&gt;
 &lt;br /&gt;
This is also also a line.&lt;br /&gt;
   uniq -c myfile.txt&lt;br /&gt;
&lt;br /&gt;
3 This is a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
2 This is also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
1  &amp;lt;br/&amp;gt;&lt;br /&gt;
1 This is also also a line.&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
   uniq -d myfile.txt&lt;br /&gt;
This is a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
This is also a line. &amp;lt;br/&amp;gt;&lt;br /&gt;
   uniq -u myfile.txt&lt;br /&gt;
This is also also a line.&lt;br /&gt;
==Environment==&lt;br /&gt;
The LANG, LC_ALL, LC_COLLATE and LC_CTYPE environment variables affect the execution of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; as described in [https://www.freebsd.org/cgi/man.cgi?query=environ&amp;amp;sektion=7&amp;amp;apropos=0&amp;amp;manpath=FreeBSD+10.3-RELEASE+and+Ports environ(7)].&lt;br /&gt;
&lt;br /&gt;
==Exit status==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility exits 0 on success, and &amp;gt;0 if an error occurs.&lt;br /&gt;
&lt;br /&gt;
==Compatibility==&lt;br /&gt;
The historic +number and -number options have been deprecated but are still supported in this implementation.&lt;br /&gt;
&lt;br /&gt;
==Standards==&lt;br /&gt;
The &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; utility conforms to IEEE Std 1003.1-2001 (``POSIX.1&#039;&#039;) as amended by Cor. 1-2002.&lt;br /&gt;
&lt;br /&gt;
==History==&lt;br /&gt;
A &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; command appeared in Version 3 AT&amp;amp;T UNIX.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; does not detect repeated lines unless they are adjacent. You may want to sort the input first, or use &#039;&#039;&#039;&amp;lt;code&amp;gt;sort -u&amp;lt;/code&amp;gt;&#039;&#039;&#039; instead of &#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==Related commands==&lt;br /&gt;
[http://www.computerhope.com/unix/ucomm.htm comm] — Compare two sorted files line by line.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upack.htm pack] — Compress files using a Huffman algorithm.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/upcat.htm pcat] — Print the uncompressed contents of a compressed file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/usort.htm sort] — Sort the lines in a text file.&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://www.computerhope.com/unix/uuncompr.htm uncompress] — Extract files from compressed archives.&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114734</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114734"/>
		<updated>2016-11-16T13:47:26Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
=Kirjeldus=&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; on Unix&#039;i vahend, mis annab võimalusi väljendada või sorteerida korduvaid read juba sorteeritud failis. Korduvaid read ei erista kui nad pole pandud üksteise järel, seepärast on kasulik eelnevalt sorteerida faili.&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; eirab korduvaid elemente -d - kuvab ainult read, mis on korduvad (ühekordselt) -D - kuvab ainult read, mis on korduvalt (kõik esinemised).&lt;br /&gt;
&lt;br /&gt;
Artikkel annab lühiülevaate &amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt; kasutamisest ja toob mõned näited ning räägib vajaminevatest parameetritest (võtmetest).&lt;br /&gt;
&lt;br /&gt;
==Võtmed==&lt;br /&gt;
&#039;&#039;-c &#039;&#039;, --count; - näitab mitu korda rida kordatakse failis&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-d &#039;&#039;, --repeated ; - printida ainult korduvaid read&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-D &#039;&#039;, --all-repeated; printida kõik duplikaat read&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-f &#039;&#039;, --skip-fields=N ; - mitte võrrelda esimest N &amp;quot;fields&amp;quot;  &amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-i &#039;&#039;, --ignore-case ; -  ignoreerida erinevusi juhul kui võrreldakse teiste readega&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-s &#039;&#039;, --skip-chars=N ; - mitte võrrelda N esiment tähti&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-u &#039;&#039;, --unique ; -  prinditakse ainult ainulaadsed read&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;-w &#039;&#039;, --check-chars=N ; - võrrelda mitte rohkem kui N tähti reas&amp;lt;br/&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114732</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114732"/>
		<updated>2016-11-16T13:15:09Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kirjeldus */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
=Kirjeldus=&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; on Unix&#039;i vahend, mis annab võimalusi väljendada või sorteerida korduvaid read juba sorteeritud failis. Korduvaid read ei erista kui nad pole pandud üksteise järel, seepärast on kasulik eelnevalt sorteerida faili.&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; eirab korduvaid elemente -d - kuvab ainult read, mis on korduvad (ühekordselt) -D - kuvab ainult read, mis on korduvalt (kõik esinemised).&lt;br /&gt;
&lt;br /&gt;
Artikkel annab lühiülevaate &amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt; kasutamisest ja toob mõned näited ning räägib vajaminevatest parameetritest (võtmetest).&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114731</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114731"/>
		<updated>2016-11-16T13:14:54Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Kirjeldus */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
=Kirjeldus=&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; on Unix&#039;i vahend, mis annab võimalusi väljendada või sorteerida korduvaid read juba sorteeritud failis. Korduvaid read ei erista kui nad pole pandud üksteise järel, seepärast on kasulik eelnevalt sorteerida faili.&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; eirab korduvaid elemente -d - kuvab ainult read, mis on korduvad (ühekordselt) -D - kuvab ainult read, mis on korduvalt (kõik esinemised).&lt;br /&gt;
&lt;br /&gt;
//Artikkel annab lühiülevaate &amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt; kasutamisest ja toob mõned näited ning räägib vajaminevatest parameetritest (võtmetest).&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114730</id>
		<title>Uniq</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Uniq&amp;diff=114730"/>
		<updated>2016-11-16T13:13:55Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: Created page with &amp;quot;{{DISPLAYTITLE:Uniq}}  =Autor=  Jevgeni Kuzmin, A21  16.11.2016  =Kirjeldus=  &amp;#039;&amp;#039;&amp;#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&amp;#039;&amp;#039;&amp;#039;on Unix&amp;#039;i vahend, mis annab võimalusi väljendada või sorteerida korduva...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Uniq}}&lt;br /&gt;
&lt;br /&gt;
=Autor=&lt;br /&gt;
&lt;br /&gt;
Jevgeni Kuzmin, A21&lt;br /&gt;
&lt;br /&gt;
16.11.2016&lt;br /&gt;
&lt;br /&gt;
=Kirjeldus=&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039;on Unix&#039;i vahend, mis annab võimalusi väljendada või sorteerida korduvaid read juba sorteeritud failis. Korduvaid read ei erista kui nad pole pandud üksteise järel, seepärast on kasulik eelnevalt sorteerida faili.&#039;&#039;&#039;&amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt;&#039;&#039;&#039; eirab korduvaid elemente -d - kuvab ainult read, mis on korduvad (ühekordselt) -D - kuvab ainult read, mis on korduvalt (kõik esinemised).&lt;br /&gt;
&lt;br /&gt;
//Artikkel annab lühiülevaate &amp;lt;code&amp;gt;uniq&amp;lt;/code&amp;gt; kasutamisest ja toob mõned näited ning räägib vajaminevatest parameetritest (võtmetest).&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Osadmin_referaadi_teemad&amp;diff=113251</id>
		<title>Osadmin referaadi teemad</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Osadmin_referaadi_teemad&amp;diff=113251"/>
		<updated>2016-10-31T13:24:20Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Vabad teemad */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Artikli kondikava=&lt;br /&gt;
.. on kirjeldatud [[Artikli kondikava|eraldi artiklis]].&lt;br /&gt;
&lt;br /&gt;
=Artikli teema valimine=&lt;br /&gt;
&lt;br /&gt;
* Teema peab olema seotud OSadmin ainega (sh Linuxiga). Võimalusel võib tuua sama käsu kasutamisvõimalused ka MS Windows&#039;is (nt cmd, Powershell&#039;is). Tuua kindlasti ka näiteid, milleks ja kuidas kasutada käsitletud teemat sysadminni töös.&lt;br /&gt;
*Teema valib tudeng käesolevalt viki lehelt kus kirjutab oma nime ja õppegrupi veel valimata teema taha ja tõstab selle [[#Valitud teemad|valitud teemade]] alla.&lt;br /&gt;
*Kui soovitakse valida teemat, mida nimekirjas ei ole siis lepitakse õppejõuga kokku ja kirjutatakse teema [[Osadmin referaadi teemad|käesolevasse viki artiklisse]]&lt;br /&gt;
* Valitud teema koos lingiga palun kirja panna aine veebivormi, [[:Category:Operatsioonisüsteemide administreerimine ja sidumine#Õpimapp|mille lingi leiab õpimapi alt]].&lt;br /&gt;
*Artikkel tuleb esitada [https://wiki.itcollege.ee/ EIK&#039;i vikisse]&lt;br /&gt;
*Leida kaastudeng kes hindab artiklit alamlehe &#039;&#039;discussion&#039;&#039; all (vt [http://enos.itcollege.ee/~edmund/materials/viki-artikkel/hindamismudel-viki-artiklile.html hindamismudel]) - palun hinnangu juurde kirja panna ka tudengi nimi, õppegrupp ja kuupäev, millal hinnang kirjutati&lt;br /&gt;
*Kui artikkel on valmis ja kaastudengi poolt hinnatud, siis tuleb sellest [[:Category:Operatsioonisüsteemide administreerimine ja sidumine#Õppejõud|õppejõule teada anda]], et saaks tagasisidet anda ja hinnata&lt;br /&gt;
* Kui tekib küsimusi, mida võiks täiendamist vajavatele artiklitele juurde kirjutada siis vajadusel suhelda [[:Category:Operatsioonisüsteemide_administreerimine_ja_sidumine#Õppejõud|aine õppejõuga]]. Üldiselt tasub vaadata antud käsu man-lehte, teiste vikide artikleid ja mõelda kuidas võiks antud käsust kasu olla süsteemiadministraatorile.&lt;br /&gt;
* Kui leitakse käesolevast vikist otsinguga, et konkreetne teema on puudu või vajab täiendamist siis võib selle ise siia kirjutada &amp;amp;&amp;amp; suhelda vajadusel [[:Category:Operatsioonisüsteemide_administreerimine_ja_sidumine#Õppejõud|aine õppejõuga]].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#FF0000&amp;quot;&amp;gt;NB! Kindlasti lisada aine kategooria artikli lõppu: &amp;lt;nowiki&amp;gt;[[Category:Operatsioonisüsteemide administreerimine ja sidumine]]&amp;lt;/nowiki&amp;gt;&amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
=Valitud teemad=&lt;br /&gt;
* [[Ubuntu terminali kiirjuhis]] Margit Kont A21&lt;br /&gt;
* [[DDoS]] Katariina Purru	A21&lt;br /&gt;
* [[Lsblk]] Margus Sumla	A21&lt;br /&gt;
* [[Social engineering]] (artikli täiendamine) Triinu Tamm	A21&lt;br /&gt;
* [[Tmux]] Siim Saar	A21&lt;br /&gt;
* [[Byobu]] Peep Oks	AK21&lt;br /&gt;
* [[Mosh]] Kristiina Sikkar	AK21&lt;br /&gt;
* [[Ubuntu Estonian Remix]] + [https://github.com/estobuntu/ubuntu-estonian-remix GitHub&#039;i varamu] Tarmo Oja AK11&lt;br /&gt;
* [https://linuxjourney.com linuxjourney.com] tõlkimine [https://github.com/utiskak/linuxjourney/ GitHub&#039;i varamus] Kadri Kartašev	A21&lt;br /&gt;
* [[Midnight Commander]] Erik Sõlg A21&lt;br /&gt;
* [[Livepatch]] - Martin Kraus A31&lt;br /&gt;
** https://www.ubuntu.com/server/livepatch&lt;br /&gt;
* [[Flash-Friendly File System (F2FS)]] Veiko Villo A21&lt;br /&gt;
* [[Uniq]] Jevgeni Kuzmin A21&lt;br /&gt;
&lt;br /&gt;
=Vabad teemad=&lt;br /&gt;
* [[Touch]]&lt;br /&gt;
* [[File]]&lt;br /&gt;
* [[History]]&lt;br /&gt;
* [[Journalctl]]&lt;br /&gt;
* [[Bash konfiguratsioonifailid]] (artikli täiendamine)&lt;br /&gt;
* [[Keskkonna muutujad]] (artikli täiendamine)&lt;br /&gt;
* [[Grep kasutamine]] (artikli täiendamine)&lt;br /&gt;
* [[GPT]] (artikli täiendamine)&lt;br /&gt;
* [[Head]] + täiendada [[Tail]]&lt;br /&gt;
* [[Ldd]] + [[Pwd]] + [[Ln]] (artikli täiendamine) - sisuliselt uue kirjutamine&lt;br /&gt;
* [[Login]] + [[Logout]]&lt;br /&gt;
* [[Lsb_release]]&lt;br /&gt;
* [[Passwd]]&lt;br /&gt;
* [[Rm]]&lt;br /&gt;
* [[Apropos]]&lt;br /&gt;
* [[Finger]]&lt;br /&gt;
* [[Whatis]]&lt;br /&gt;
* [[More]]&lt;br /&gt;
* [[Mcedit]] + [[Mcview]]&lt;br /&gt;
** Midnight Commander&#039;i alamprogrammid&lt;br /&gt;
* [[Stdin]] + [[Stdout]] + [[Stderr]]&lt;br /&gt;
* [[Join]]&lt;br /&gt;
* [[Split]]&lt;br /&gt;
* [[Tr]]&lt;br /&gt;
* [[PHORONIX TEST SUITE]] (artikli täiendamine)&lt;br /&gt;
* [[Wc]] + [[Nl]]&lt;br /&gt;
* [[Setuid]] + [[Setgid]]&lt;br /&gt;
* [[Signaalid_ja_kill]] (artikli täiendamine)&lt;br /&gt;
* [[/proc]]&lt;br /&gt;
* [[Debiani varamu loomine]]&lt;br /&gt;
* [[Seadmed Linuxis]] - vt https://linuxjourney.com/lesson/dev-directory ja seal all olevad teemad&lt;br /&gt;
* [[FHS]] - Filesystem Hierarchy - vt ka [http://enos.itcollege.ee/~edmund/osadmin/est/failisysteemi-hierarhia/failisysteemi-hierarhia_OSadmin.pdf loeng sellel teemal]&lt;br /&gt;
* [[Linux Kernel]] - vt ka https://linuxjourney.com/lesson/kernel-overview&lt;br /&gt;
* [[Init]] (artikli täiendamine)&lt;br /&gt;
&lt;br /&gt;
==Mahukamad teemad==&lt;br /&gt;
* [[Bash]] &lt;br /&gt;
** [https://linux.die.net/man/1/bash ~103 lk man-leht], mida võiks jagada ~3 lk tudengi kohta - nii võiks ~33 tudengit leida siit võimaluse viki artikli kirjutamiseks.&lt;br /&gt;
* [[Bash-builtins]]&lt;br /&gt;
** &#039;&#039;man bash-builtins&#039;&#039; on ~31 lk -&amp;gt; üks tudeng võib võtta mitu sisemist käsku (eriti kui need on lühikesed st väikese mahuga), mis annaks ~3 lk tudengi kohta -&amp;gt; ~10 tudengit. Siin tasub luua eraldi kategooria &amp;lt;nowiki&amp;gt;[[Category:Bash-builtins]]&amp;lt;/nowiki&amp;gt;, mida lisaks ainekategooriale lisada uuelt realt iga käsu artikli lõppu - tubli algatus oleks ka olemasolevad bash-builtins käskude artiklid üles otsida ja &amp;lt;nowiki&amp;gt;[[Category:Bash-builtins]]&amp;lt;/nowiki&amp;gt; kategooria sinna lõppu lisada.&lt;br /&gt;
** &#039;&#039;man bash-builtins&#039;&#039; kirjutab: &#039;&#039;bash  defines the following built-in commands: :, ., [, alias, bg, bind, break, builtin, case, cd, command, compgen, complete, continue, declare, dirs, disown,  echo, enable, eval,  exec,  exit, export,  fc,  fg, getopts, hash, help, history, if, jobs, kill, let, local, logout, popd, printf, pushd, pwd, read, readonly, return, set, shift, shopt, source, suspend, test, times,  trap, type,  typeset,  ulimit, umask,  unalias, unset, until, wait, while&#039;&#039;.&lt;br /&gt;
* [[Graafiline teavitus sõltumata sisseloginud kasutajast]] - libnotify vms abil.&lt;br /&gt;
** Näiteks soovitakse ajastatud toimingu (CRON) abil ajastada tarkvarauuendust ja kasutajaid oleks vaja graafiliselt teavitada, eriti Ubuntu külalise kasutajat/kasutajaid (tavaliselt kodukataloogiga /tmp/guest-&amp;lt;hash&amp;gt;).&lt;br /&gt;
** Luua viki artikkel, mis kirjeldab globaalselt CRON&#039;i kaudu tarkvarauuenduse käivitamist ja kasutajanimest sõltumata sisseloginud kasutaja(te) graafiliselt teavitamist 5, 4, 3, 2, 1 minut + viimane minut iga 5 sekundi tagant + uuendamise ajal on pidevalt teade ekraanil, et toimub tarkvara automaatne uuendamine ja peale seda taaskäivitamine ning palutakse arvutit mitte välja lülitada ega mitte ühtegi rakendust kasutada.&lt;br /&gt;
** Peale uuendamist peaks arvuti automaatselt uuendama alglaaduri GRUB (juhul kui paigaldati uus tuum), korrastama teegid, eemaldama edukalt paigaldatud tarkvarapakettide failid kõvakettalt ning tegema taaskäivituse.&lt;br /&gt;
** Lisaks kontrolliks süsteemi lisatud kasutajaid ning keelaks tavakasutajatel CRON&#039;i kasutamise turvakaalutlustel.&lt;br /&gt;
** Eriti viisakas oleks kui peale taaskäivitamist kontrollitakse paigaldatud tuumi ja selle päiseid ning millelt hetkel masin töötab ja eemaldatakse kõik peale kahe viimase versiooni juhuks kui uusim ei tööta.&lt;br /&gt;
** Samal ajal teavitaks graafiliselt kasutajat, et paigaldusjärgne hooldus (üleliigsete tuumade ja selle päiste eemaldamine) on käimas ning palutakse pisut oodata kuniks see lõpule jõuab.&lt;br /&gt;
** Peale seda teavitaks graafiliselt, et süsteemi uuendamine ja hooldus on lõpule viidud ning sooviks edukat kasutamist.&lt;br /&gt;
** Lahendus luuakse ilmselt skriptimise abil - viki artiklis tuua ära loodud skriptide lähtekood koos selgitustega.&lt;br /&gt;
** Edasiarendusena võiks olla lahendatud mainitud funktsionaalsuse keskne seadistamine ja seadistuste haldamine võrgupõhiselt organisatsiooni võrgus.&lt;br /&gt;
* [[ID-kaarditarkvara Ubuntu guest kasutajaga]]&lt;br /&gt;
&lt;br /&gt;
=Viiteid=&lt;br /&gt;
* https://viki.pingviin.org/Kategooria:Linuxi_k%C3%A4sud&lt;br /&gt;
* https://viki.pingviin.org/Peamised_Linuxi_käsud_algajatel&lt;br /&gt;
* https://linuxjourney.com/&lt;br /&gt;
* [https://linux.die.net/man/ Linux man-pages]&lt;br /&gt;
* [https://linux.die.net Linux docs]&lt;br /&gt;
&lt;br /&gt;
=Varasemad operatsioonisüsteemide referaadid=&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2011 Sügis]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2011 kevad‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2012 Sügis‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2013 Sügis‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2014 Sügis]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2015 Sügis‎]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=Osadmin_referaadi_teemad&amp;diff=113247</id>
		<title>Osadmin referaadi teemad</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=Osadmin_referaadi_teemad&amp;diff=113247"/>
		<updated>2016-10-31T13:20:56Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Valitud teemad */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Artikli kondikava=&lt;br /&gt;
.. on kirjeldatud [[Artikli kondikava|eraldi artiklis]].&lt;br /&gt;
&lt;br /&gt;
=Artikli teema valimine=&lt;br /&gt;
&lt;br /&gt;
* Teema peab olema seotud OSadmin ainega (sh Linuxiga). Võimalusel võib tuua sama käsu kasutamisvõimalused ka MS Windows&#039;is (nt cmd, Powershell&#039;is). Tuua kindlasti ka näiteid, milleks ja kuidas kasutada käsitletud teemat sysadminni töös.&lt;br /&gt;
*Teema valib tudeng käesolevalt viki lehelt kus kirjutab oma nime ja õppegrupi veel valimata teema taha ja tõstab selle [[#Valitud teemad|valitud teemade]] alla.&lt;br /&gt;
*Kui soovitakse valida teemat, mida nimekirjas ei ole siis lepitakse õppejõuga kokku ja kirjutatakse teema [[Osadmin referaadi teemad|käesolevasse viki artiklisse]]&lt;br /&gt;
* Valitud teema koos lingiga palun kirja panna aine veebivormi, [[:Category:Operatsioonisüsteemide administreerimine ja sidumine#Õpimapp|mille lingi leiab õpimapi alt]].&lt;br /&gt;
*Artikkel tuleb esitada [https://wiki.itcollege.ee/ EIK&#039;i vikisse]&lt;br /&gt;
*Leida kaastudeng kes hindab artiklit alamlehe &#039;&#039;discussion&#039;&#039; all (vt [http://enos.itcollege.ee/~edmund/materials/viki-artikkel/hindamismudel-viki-artiklile.html hindamismudel]) - palun hinnangu juurde kirja panna ka tudengi nimi, õppegrupp ja kuupäev, millal hinnang kirjutati&lt;br /&gt;
*Kui artikkel on valmis ja kaastudengi poolt hinnatud, siis tuleb sellest [[:Category:Operatsioonisüsteemide administreerimine ja sidumine#Õppejõud|õppejõule teada anda]], et saaks tagasisidet anda ja hinnata&lt;br /&gt;
* Kui tekib küsimusi, mida võiks täiendamist vajavatele artiklitele juurde kirjutada siis vajadusel suhelda [[:Category:Operatsioonisüsteemide_administreerimine_ja_sidumine#Õppejõud|aine õppejõuga]]. Üldiselt tasub vaadata antud käsu man-lehte, teiste vikide artikleid ja mõelda kuidas võiks antud käsust kasu olla süsteemiadministraatorile.&lt;br /&gt;
* Kui leitakse käesolevast vikist otsinguga, et konkreetne teema on puudu või vajab täiendamist siis võib selle ise siia kirjutada &amp;amp;&amp;amp; suhelda vajadusel [[:Category:Operatsioonisüsteemide_administreerimine_ja_sidumine#Õppejõud|aine õppejõuga]].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#FF0000&amp;quot;&amp;gt;NB! Kindlasti lisada aine kategooria artikli lõppu: &amp;lt;nowiki&amp;gt;[[Category:Operatsioonisüsteemide administreerimine ja sidumine]]&amp;lt;/nowiki&amp;gt;&amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
=Valitud teemad=&lt;br /&gt;
* [[Ubuntu terminali kiirjuhis]] Margit Kont A21&lt;br /&gt;
* [[DDoS]] Katariina Purru	A21&lt;br /&gt;
* [[Lsblk]] Margus Sumla	A21&lt;br /&gt;
* [[Social engineering]] (artikli täiendamine) Triinu Tamm	A21&lt;br /&gt;
* [[Tmux]] Siim Saar	A21&lt;br /&gt;
* [[Byobu]] Peep Oks	AK21&lt;br /&gt;
* [[Mosh]] Kristiina Sikkar	AK21&lt;br /&gt;
* [[Ubuntu Estonian Remix]] + [https://github.com/estobuntu/ubuntu-estonian-remix GitHub&#039;i varamu] Tarmo Oja AK11&lt;br /&gt;
* [https://linuxjourney.com linuxjourney.com] tõlkimine [https://github.com/utiskak/linuxjourney/ GitHub&#039;i varamus] Kadri Kartašev	A21&lt;br /&gt;
* [[Midnight Commander]] Erik Sõlg A21&lt;br /&gt;
* [[Livepatch]] - Martin Kraus A31&lt;br /&gt;
** https://www.ubuntu.com/server/livepatch&lt;br /&gt;
* [[Flash-Friendly File System (F2FS)]] Veiko Villo A21&lt;br /&gt;
* [[Uniq]] Jevgeni Kuzmin A21&lt;br /&gt;
&lt;br /&gt;
=Vabad teemad=&lt;br /&gt;
* [[Touch]]&lt;br /&gt;
* [[File]]&lt;br /&gt;
* [[History]]&lt;br /&gt;
* [[Journalctl]]&lt;br /&gt;
* [[Bash konfiguratsioonifailid]] (artikli täiendamine)&lt;br /&gt;
* [[Keskkonna muutujad]] (artikli täiendamine)&lt;br /&gt;
* [[Grep kasutamine]] (artikli täiendamine)&lt;br /&gt;
* [[GPT]] (artikli täiendamine)&lt;br /&gt;
* [[Head]] + täiendada [[Tail]]&lt;br /&gt;
* [[Ldd]] + [[Pwd]] + [[Ln]] (artikli täiendamine) - sisuliselt uue kirjutamine&lt;br /&gt;
* [[Login]] + [[Logout]]&lt;br /&gt;
* [[Lsb_release]]&lt;br /&gt;
* [[Passwd]]&lt;br /&gt;
* [[Rm]]&lt;br /&gt;
* [[Apropos]]&lt;br /&gt;
* [[Finger]]&lt;br /&gt;
* [[Whatis]]&lt;br /&gt;
* [[More]]&lt;br /&gt;
* [[Mcedit]] + [[Mcview]]&lt;br /&gt;
** Midnight Commander&#039;i alamprogrammid&lt;br /&gt;
* [[Stdin]] + [[Stdout]] + [[Stderr]]&lt;br /&gt;
* [[Join]]&lt;br /&gt;
* [[Split]]&lt;br /&gt;
* [[Tr]]&lt;br /&gt;
* [[PHORONIX TEST SUITE]] (artikli täiendamine)&lt;br /&gt;
* [[Uniq]]&lt;br /&gt;
* [[Wc]] + [[Nl]]&lt;br /&gt;
* [[Setuid]] + [[Setgid]]&lt;br /&gt;
* [[Signaalid_ja_kill]] (artikli täiendamine)&lt;br /&gt;
* [[/proc]]&lt;br /&gt;
* [[Debiani varamu loomine]]&lt;br /&gt;
* [[Seadmed Linuxis]] - vt https://linuxjourney.com/lesson/dev-directory ja seal all olevad teemad&lt;br /&gt;
* [[FHS]] - Filesystem Hierarchy - vt ka [http://enos.itcollege.ee/~edmund/osadmin/est/failisysteemi-hierarhia/failisysteemi-hierarhia_OSadmin.pdf loeng sellel teemal]&lt;br /&gt;
&lt;br /&gt;
==Mahukamad teemad==&lt;br /&gt;
* [[Bash]] &lt;br /&gt;
** [https://linux.die.net/man/1/bash ~103 lk man-leht], mida võiks jagada ~3 lk tudengi kohta - nii võiks ~33 tudengit leida siit võimaluse viki artikli kirjutamiseks.&lt;br /&gt;
* [[Bash-builtins]]&lt;br /&gt;
** &#039;&#039;man bash-builtins&#039;&#039; on ~31 lk -&amp;gt; üks tudeng võib võtta mitu sisemist käsku (eriti kui need on lühikesed st väikese mahuga), mis annaks ~3 lk tudengi kohta -&amp;gt; ~10 tudengit. Siin tasub luua eraldi kategooria &amp;lt;nowiki&amp;gt;[[Category:Bash-builtins]]&amp;lt;/nowiki&amp;gt;, mida lisaks ainekategooriale lisada uuelt realt iga käsu artikli lõppu - tubli algatus oleks ka olemasolevad bash-builtins käskude artiklid üles otsida ja &amp;lt;nowiki&amp;gt;[[Category:Bash-builtins]]&amp;lt;/nowiki&amp;gt; kategooria sinna lõppu lisada.&lt;br /&gt;
** &#039;&#039;man bash-builtins&#039;&#039; kirjutab: &#039;&#039;bash  defines the following built-in commands: :, ., [, alias, bg, bind, break, builtin, case, cd, command, compgen, complete, continue, declare, dirs, disown,  echo, enable, eval,  exec,  exit, export,  fc,  fg, getopts, hash, help, history, if, jobs, kill, let, local, logout, popd, printf, pushd, pwd, read, readonly, return, set, shift, shopt, source, suspend, test, times,  trap, type,  typeset,  ulimit, umask,  unalias, unset, until, wait, while&#039;&#039;.&lt;br /&gt;
* [[Graafiline teavitus sõltumata sisseloginud kasutajast]] - libnotify vms abil.&lt;br /&gt;
** Näiteks soovitakse ajastatud toimingu (CRON) abil ajastada tarkvarauuendust ja kasutajaid oleks vaja graafiliselt teavitada, eriti Ubuntu külalise kasutajat/kasutajaid (tavaliselt kodukataloogiga /tmp/guest-&amp;lt;hash&amp;gt;).&lt;br /&gt;
** Luua viki artikkel, mis kirjeldab globaalselt CRON&#039;i kaudu tarkvarauuenduse käivitamist ja kasutajanimest sõltumata sisseloginud kasutaja(te) graafiliselt teavitamist 5, 4, 3, 2, 1 minut + viimane minut iga 5 sekundi tagant + uuendamise ajal on pidevalt teade ekraanil, et toimub tarkvara automaatne uuendamine ja peale seda taaskäivitamine ning palutakse arvutit mitte välja lülitada ega mitte ühtegi rakendust kasutada.&lt;br /&gt;
** Peale uuendamist peaks arvuti automaatselt uuendama alglaaduri GRUB (juhul kui paigaldati uus tuum), korrastama teegid, eemaldama edukalt paigaldatud tarkvarapakettide failid kõvakettalt ning tegema taaskäivituse.&lt;br /&gt;
** Lisaks kontrolliks süsteemi lisatud kasutajaid ning keelaks tavakasutajatel CRON&#039;i kasutamise turvakaalutlustel.&lt;br /&gt;
** Eriti viisakas oleks kui peale taaskäivitamist kontrollitakse paigaldatud tuumi ja selle päiseid ning millelt hetkel masin töötab ja eemaldatakse kõik peale kahe viimase versiooni juhuks kui uusim ei tööta.&lt;br /&gt;
** Samal ajal teavitaks graafiliselt kasutajat, et paigaldusjärgne hooldus (üleliigsete tuumade ja selle päiste eemaldamine) on käimas ning palutakse pisut oodata kuniks see lõpule jõuab.&lt;br /&gt;
** Peale seda teavitaks graafiliselt, et süsteemi uuendamine ja hooldus on lõpule viidud ning sooviks edukat kasutamist.&lt;br /&gt;
** Lahendus luuakse ilmselt skriptimise abil - viki artiklis tuua ära loodud skriptide lähtekood koos selgitustega.&lt;br /&gt;
** Edasiarendusena võiks olla lahendatud mainitud funktsionaalsuse keskne seadistamine ja seadistuste haldamine võrgupõhiselt organisatsiooni võrgus.&lt;br /&gt;
* [[ID-kaarditarkvara Ubuntu guest kasutajaga]]&lt;br /&gt;
&lt;br /&gt;
=Viiteid=&lt;br /&gt;
* https://viki.pingviin.org/Kategooria:Linuxi_k%C3%A4sud&lt;br /&gt;
* https://viki.pingviin.org/Peamised_Linuxi_käsud_algajatel&lt;br /&gt;
* https://linuxjourney.com/&lt;br /&gt;
* [https://linux.die.net/man/ Linux man-pages]&lt;br /&gt;
* [https://linux.die.net Linux docs]&lt;br /&gt;
&lt;br /&gt;
=Varasemad operatsioonisüsteemide referaadid=&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2011 Sügis]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2011 kevad‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2012 Sügis‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2013 Sügis‎]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2014 Sügis]]&lt;br /&gt;
*[[Operatsioonisüsteemide referaadid 2015 Sügis‎]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Operatsioonisüsteemide administreerimine ja sidumine]]&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=93035</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=93035"/>
		<updated>2015-10-19T18:21:44Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Essee */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: 22.10.2015 kell 10:00&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Õppeaine eesmärgiks on tutvustada IT maailma ning motiveerida tudengeid süvenema oma õpingutesse. Igat loengut pidasid erinevate erialade esindajad.&lt;br /&gt;
&lt;br /&gt;
Esimene loeng  toimus juba augusti lõpus, kus Inga Vau, Margus Ernits, Merle Varendi ja Juri Tretjakov rääkisid meiega õppekorraldusest  ja sisekorrast. Mulle meeldis väga, et  peaaegu kõik meie loengud olid salvestaud. Kasulik oli ka teada saada, et tudengil on võimalus TTÜ raamatukogu kasutada ning võtta osa erinevate klubide tegevustest. Sain aru, kuidas toimub kumulatiivne EAP arvestus semestri lõpus. Kui üliõpilane soovib jääda riigieelarvelisele kohale, tuleb semestris saada vähemalt 27 EAP. Kui saada semestris 25 EAP, siis tuleb järgmisel semestril arve 2 EAP eest. Punktide arvestus käib kumulatiivselt. See tähendab, et kui järgmisel semestril võtab üliõpilane 27 EAP, siis ülejärgmisel semestril tuleb ikka arve nende 2 EAP eest. Seepärast tuleks tudengil võtta järgmisel semestril 29 EAP. Merle Varendi rääkis esimeses loengus stipendiumitest ja õppetoetustest. Firma stipendiumile on võimalik kandideerida alates kevadsemestrist. (1)&lt;br /&gt;
&lt;br /&gt;
Teise loengu viis läbi Tiina Seeman. Ta on hingelt ja ametilt projektijuht. Ta rääkis meile juhtimisest. Ta selgitas meile, mis on projektijuhtimine ja miks see on vajalik. Ilma juhtimeseta lähevad asjad halvasti. Tegemist on rohkem ühiskonnaga. On vaja arendada oskust  planeerida, näiteks kui palju raha on olemas, millele raha kulutada, mida on vaja osta jne. Ta näitas meile tabeli, kust sai teada, miks projektid feilivad (läbi kukuvad) ja  enamus põhjustest olid:   lõppkasutaja kaasatus - 19%, tegevjuhtide kaasatus - 16% ja selge skoop kõikidele osapooltele. Tiina Seeman näitas meile projektijuhtimise erinevaid dimensioone: skoop, kvaliteet, aeg, pingutus ja raha. Kuidas  projektiplaani teha? Kõigepealt  tuleb riskid läbi  mõelda, planeerida, millele raha kulutada ja teha skoopi. Ta näitas meile “IT” etapid  ja “IT” rollid projektis, mis on väga tähtsad juhtimisel. (2)&lt;br /&gt;
&lt;br /&gt;
Kolmanda loengu viis läbi Elar Lang, kes hetkel tegeleb veebirakenduste turvalisust puudutavate küsimustega, mille käigus korraldab ta samuti vastavaid koolitusi. Antud loeng põhineb tudengite motiveerimisele. Ta rääkis õppimisest ja  enda  kogemustest. Ta rääkis meile sellest, et kuulsad ja edukad ning tuntud üle terve maailma inimesed   ei käinud ülikoolis, näiteks Bill Gates, Steve Jobs, Mark Zuckerberk.  Kõik nad on suutnud kõrgeid eesmärke seada ning neid saavutada. Nad  õppisid õppima ning kohanema olukorraga.  Ja tänapäeval peavad väga tähtsaks paljud inimesed  motot:  Pidevalt uued tehnoloogiad – pidev vajadus ajaga kaasas olla.(3)&lt;br /&gt;
Kooli eesmärgiks on  anda sissejuhatus erinevatesse teemadesse ja laiendada taustateadmisi ja silmaringi. Mulle meeldis Elar Langi mõte: “Edukus ei ole juhus. See on sinu valik.” On vaja arendada enda eesmärgid, näiteks, miks sa õpid ülikoolis, mida tahad elus saavutada jne.  Veel Elar Lang rääkis, et elus on väga tähtis suhtlemine, sest ei ole vahet, kui hea spetsialist Sa oled, kui suhtlemine on probleemne. Programmeerimisest aru saamist on vaja igas rollis.(3)&lt;br /&gt;
&lt;br /&gt;
Neljanda loengu viis läbi Taavi Tuisk. Ta on süsteemiadministraator ja ta alustas oma karjääri TTÜ-s. Ta rääkis meile, süsteemiadministraatori tööst, tema kohustustest ja rollist asutuses. Süsteemiadministratoril peab olema tugev stressitaluvus, leidlikkus, tervislik paranoia, programmeerimisoskus ja ametieetika. &amp;quot;Pimedal keskajal&amp;quot; olid üsna unikaalsed süsteemid, puudulik või puuduv dokumentatsioon, &amp;lt;bugine&amp;gt; ja pööraselt kallis karbitarkvara, olid kehvad töövahendid ja kehvavõitu maine. Ta andis meile nõu, et ei tohi oma nina võõrastesse asjadesse ja dokumentidesse toppida.   On vaja valida töökohti, kus on arenemise võimalus  ja perspektiiv, mitte kus inimene teeb natuke tööd ja pärast tegeleb oma asjadega.(4)&lt;br /&gt;
&lt;br /&gt;
Viiendas loengus räägiti testimisest ja tarkvara kvaliteedist. Loegu viis läbi Kert Suvi, kes veenis auditooriumi, et testimine pole pelgalt projekti tüütuim etapp, mille vajalikkuses paljud kahtlevad, vaid see on oluline protsess, mida tuleks teha kogu projekti vältel, et lõpp-produkt oleks kvaliteetne ja turvaline. Ta rääkis taustadest, vingidest, &amp;lt;feilidest&amp;gt;, võimalustest, pikast ja tihedast arutelust ning näitas meile palju kassipilte. Ta selgitas meile,  miks  viiakse teste läbi, kust sai see oma alguse.  Selgus, et testitakse kõigepealt selleks, et informatsiooni saada ja teiseks riskide maandamiseks. Selles valdkonnas on 2 probleemi, esimene on see, et testitakse  vähe ja teine on see, et spetsialiste on vähe. Spetsialiste on vähe seepärast, et see ei ole „seksikas“ töö, testijad saavad väikest palka (umbes 800 eurot) ja testida oskab igaüks. Kahjuks testimine on kallis ja see ei loo väärtusi. Testija – on professionaalne skeptik ja pessimist, temal puudub pime usk,  tal on masside mõtlemisest teistsugune arusaam,  ta on tugev analüütik ja tal on kavatus.(5)&lt;br /&gt;
&lt;br /&gt;
Kuuenda loengu viis läbi Targo Tennisberg. Ta on töötanud erinevates nii väiksemates kui ka suuremates ettevõtetes, kes tegutsesid tarkvara tootmisega. Ta rääkis meile IT ellujäämiskursusest. Tehnoloogiat loovad üksikud tippteadlased ja insenerid. Hea projekt sõltub ajast, skoobist, ressurssidest ja kvaliteedist. Ta andis meile edu võtmed: probleemide ennetamine ja riskide maandamine (mitte see, kui ägedat koodi sa oskad kirjutada), valmisolek teha tegevusi, mis jäävad väljapoole sinu ametikirjeldusest, efektiivse kommunikatsiooni võime ja valmisolek ootamatusteks. Kuidas saada head töökohta? On vaja olla taiplik, teha asjad õigeaegselt ära ja olla hea tiimikaaslane. Targo Tennisberg rääkis, et kõiki oskusi võib omandada ka iseseisvalt, seepärast kool ei ole oluline. Koolis olulised on saavutused. Konkreetsetest teadmistest tähtsam on võime õppida. Diplomist tähtsam on võime asju lõpule viia. Loengutest tähtsam on võime koostööd teha. Kool pakub praktilisi võimalusi nende harjutamiseks. (6)&lt;br /&gt;
Enamiku Eesti ettevõtete kasumimarginaal on vähem kui  10%. Suur raha on tiražeerimises. IT muutub tarbeaineks – kaup, millele on olemas nõudlus, aga mida pakutakse turul ilma kvalitatiivsete erinevusteta.(6)&lt;br /&gt;
&lt;br /&gt;
Seitsmenda loengu viis läbi Tanel Unt. Ta on IT ettevõtja ja tihti tegeleb start-uppidega. Oma sõpradega alustas ta start-uppi, nad tahtsid teha oma digiboksi aga see oli liiga raske. Nii nad hakkasid tootma tarkvara ja pakkusid seda teistele inimestele. Tanel Unt andis meile nõu - õppima õppida, sest tänapäeval meie maailm nii kiiresti muutub, näiteks erinevad uued tehnoloogiad luuakse, aga selleks, et neid jälgida on vaja palju õppida iseseisvalt. Ta soovis meile uskuda iseendasse, õppida, kuidas oma kapitali suurendada, alustada väikestest ettevõttest ja vaadata, kuidas see läheb.(7)&lt;br /&gt;
Kui te otsustasite, et tahate saada ettevõtjaks, siis Tanel Unt soovib minna koolitusele, kus räägitakse sellest kuidas heaks ettevõtjaks saada. Kui te tegelete ise ettevõtmisega, saate ise otsustada millele kulutada kapitali, mida teha ja mida arendada. Tanel Unt ütles, et on vaja luua rõhkkonda ja mõnikord nalja heita teiste inimeste üle, sest kui sa käid tööl ainult töötamiseks, siis ei ole huvitav seda teha.(7)&lt;br /&gt;
Ta täpsustas, et on olemas risk.  Kui te ainult alustasite tegelema ettevõtmisega ja teie juurde tuleb tõsine klient, siis see on suur vastutus ja parem loobuda sellest . Parem alustada väikestest klientidest. Statistika näitab, et üks kümnest start-upist on õnnestuv.(7)&lt;br /&gt;
&lt;br /&gt;
Viimase loengu viisid läbi Oleg Bogdanov ja Oliver Kadak. Oliver Kadak rääkis meile  andmeanalüüsi olulisusest. Andmeid, mida analüüsida, on igas valdkonnas: näiteks igal ravimil on oma andmebaas, kus kirjeldatakse kõik sümptomid ja erinevad reaktsioonid nendele. Igale uuele tootele, mis läheb turule, tehakse analüüs ja prognoos: kui palju kliente on oodatav, millised on nende ootused.(8)&lt;br /&gt;
Veel Olive Kadak täpsustas meile, mis on sortimendianalüüs. Näiteks, poes erinevad nätsud pandud kassa kõrvale selle jaoks, et inimesed ostaksid midagi veel. See on ka strateegia, kuhu panna tooted, et neid oleks ostetud.(8)&lt;br /&gt;
Teine esineja oli Oleg Bogdanov. Ta on matemaatik-teoreetik ja koodikirjutaja. Oma esimesed masinkoodi programmid on ta kirjutanud aastal 1974. Ta töötas laevaprogrammeerijana, on tegelenud kosmoseuuringutega, kirjutas programmi haiglatele jne.(8)&lt;br /&gt;
&lt;br /&gt;
Antud aine raames sain parema ülevaate IT-maailmas levivatest tendentsidest, õppimise tähtsusest ja väärtusest, mis andis mulle motivatsiooni igavate ainete õppimiseks. Meeldis kuulata huvitavaid inimesi, kes teavad, mida nad elus tahavad saavutada ning oskavad oma teadmisi ka teistele jagada. Tänu nendele loengutele sain aru, et IT valdkond on väga lai ning käsitleb teemasid põhjalikult ja sügavalt. Sain aru, et selle eriala omandamiseks on kõige tähtsam õppima õppida, uskuda iseendasse ja suhelda teiste inimestega.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Kasutatud allikad&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
(1) https://echo360.e-ope.ee/ess/echo/presentation/5c75a38e-e103-474a-9e39-42aa330f4305?ec=true&lt;br /&gt;
&lt;br /&gt;
(2) https://echo360.e-ope.ee/ess/echo/presentation/e2cded4a-d03a-4ed5-95e9-de354ce58f36?ec=true&lt;br /&gt;
&lt;br /&gt;
(3) https://echo360.e-ope.ee/ess/echo/presentation/ce07046a-a6aa-41bb-8fe8-9f256a6d627f?ec=true&lt;br /&gt;
&lt;br /&gt;
(4) https://echo360.e-ope.ee/ess/echo/presentation/8e2141b7-9e98-49dc-a05d-6ca0edd3c19c?ec=true&lt;br /&gt;
&lt;br /&gt;
(5) https://echo360.e-ope.ee/ess/echo/presentation/00379be2-bb86-4935-9b4f-aad720ee4cc0?ec=true&lt;br /&gt;
&lt;br /&gt;
(6) https://echo360.e-ope.ee/ess/echo/presentation/45c455bb-ef01-4f3e-a722-5ba40ecbe8ee?ec=true&lt;br /&gt;
&lt;br /&gt;
(7) https://echo360.e-ope.ee/ess/echo/presentation/95e9f82e-debe-4f6c-833a-5dabb639600d?ec=true&lt;br /&gt;
&lt;br /&gt;
(8) https://echo360.e-ope.ee/ess/echo/presentation/f0d2dfac-5f77-47e6-8e60-abe8d9b9679d?ec=true&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Kordussoorituse aja määrab õppejõud kooskõlas õppeosakonnas koostatud ajakavaga.&lt;br /&gt;
&lt;br /&gt;
5. Riigi finantseeritaval (RF) õppekohal olevale üliõpilasele on kordussooritus [http://www.itcollege.ee/tudengile/oppetoo/oppekorraldus-eeskiri/#Eksamite%20ja%20arvestuste%20korraldus õppekorralduse eeskirja punkti 5.2.7.] kohaselt tasuta, tasulisel (OF) õppekohal olevale üliõpilasele on kordussoorituse maksumuseks nii [http://willie.itcollege.ee/?url=kordussooritused ÕIS-i] kui ka [http://www.itcollege.ee/tudengile/finantsinfo/pangarekvisiidid/ õppeteenuste tasumäärade nimekirja] kohaselt 20 eurot.&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus?&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Üliõpilasel (alates sisseastumine 2013/14) on õigus saada vajaduspõhist õppetoetust, kui:&lt;br /&gt;
&lt;br /&gt;
a) ta on Eesti kodanik või viibib Eestis pikaajalise elaniku elamisloa või tähtajalise  elamisloa või alalise või tähtajalise elamisõiguse alusel; &lt;br /&gt;
&lt;br /&gt;
b) ta õpib täiskoormusega ja on algavaks semestriks täitnud kumulatiivselt eelmistel semestritel õppekava kohaselt täitmisele kuuluva õppe mahu või ta õpib täiskoormusega esimesel semestril;&lt;br /&gt;
&lt;br /&gt;
c) tema Õppetoetuste ja õppelaenu seaduse § 51 alusel arvestatud keskmine sissetulek kuus ei ületa igaks aastaks riigieelarvega kehtestatud vajaduspõhise õppetoetuse saamiseks arvestatava keskmise sissetuleku ülemmäära. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.2.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult)&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Õppetoetuste eraldamist korraldab Haridus- ja Teadusministeerium, tema hallatav riigiasutus või tema volitatud riigi asutatud sihtasutus. Üliõpilane esitab vajaduspõhiste õppetoetuste taotluse riigiportaalis www.eesti.ee viieks õppekuuks kaks korda õppeaastas – septembris (septembriks, oktoobriks, novembriks, detsembriks ja jaanuariks) ja veebruaris (veebruariks, märtsiks, aprilliks, maiks ja juuniks). Vajaduspõhist õppetoetust makstakse riigieelarvest Haridus- ja Teadusministeeriumi eelarve kaudu igal õppekuul vastava õppekuu eest igale Õppetoetuste ja õppelaenu seaduse § 5 lõikes 21 nimetatud tingimustele vastavale üliõpilasele, kes on seda taotlenud. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.6.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Põhitoetus ja täiendav toetus määratakse vastavalt taotlejate paremusjärjestusele, lähtudes esimese kriteeriumina õppekava kohaselt täitmisele kuuluva õppemahu täitmise protsendist. Päeva-/õhtuõppe tudengite puhul võetakse õppemahu täitmise arvutamisel aluseks nominaalmaht. Kuna kaugõppe õppekava on hajutatud neljale aastale, võetakse kaugõppurite õppemahu täitmise arvutamisel aluseks 75% nominaalmahust. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 6.2.]]&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91748</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91748"/>
		<updated>2015-10-15T19:17:56Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: 22.10.2015 kell 10:00&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Õppeaine eesmärgiks on tutvustada IT maailma ning motiveerida tudengeid süvenema oma õpingutesse. Igat loengut pidasid erinevate erialade esindajad.&lt;br /&gt;
&lt;br /&gt;
Esimene loeng  toimus juba augusti lõpus, kus Inga Vau, Margus Ernits, Merle Varendi ja Juri Tretjakov rääkisid meiega õppekorraldusest  ja sisekorrast. Mulle meeldis väga, et  peaaegu kõik meie loengud olid salvestaud. Kasulik oli ka teada saada, et tudengil on võimalus TTÜ raamatukogu kasutada ning võtta osa erinevate klubide tegevustest. Sain aru, kuidas toimub kumulatiivne EAP arvestus semestri lõpus. Kui üliõpilane soovib jääda riigieelarvelisele kohale, tuleb semestris saada vähemalt 27 EAP. Kui saada semestris 25 EAP, siis tuleb järgmisel semestril arve 2 EAP eest. Punktide arvestus käib kumulatiivselt. See tähendab, et kui järgmisel semestril võtab üliõpilane 27 EAP, siis ülejärgmisel semestril tuleb ikka arve nende 2 EAP eest. Seepärast tuleks tudengil võtta järgmisel semestril 29 EAP. Merle Varendi rääkis esimeses loengus stipendiumitest ja õppetoetustest. Firma stipendiumile on võimalik kandideerida alates kevadsemestrist. (1)&lt;br /&gt;
&lt;br /&gt;
Teise loengu viis läbi Tiina Seeman. Ta on hingelt ja ametilt projektijuht. Ta rääkis meile juhtimisest. Ta selgitas meile, mis on projektijuhtimine ja miks see on vajalik. Ilma juhtimeseta lähevad asjad halvasti. Tegemist on rohkem ühiskonnaga. On vaja arendada oskust  planeerida, näiteks kui palju raha on olemas, millele raha kulutada, mida on vaja osta jne. Ta näitas meile tabeli, kust sai teada, miks projektid feilivad (läbi kukuvad) ja  enamus põhjustest olid:   lõppkasutaja kaasatus - 19%, tegevjuhtide kaasatus - 16% ja selge skoop kõikidele osapooltele. Tiina Seeman näitas meile projektijuhtimise erinevaid dimensioone: skoop, kvaliteet, aeg, pingutus ja raha. Kuidas  projektiplaani teha? Kõigepealt  tuleb riskid läbi  mõelda, planeerida, millele raha kulutada ja teha skoopi. Ta näitas meile “IT” etapid  ja “IT” rollid projektis, mis on väga tähtsad juhtimisel. (2)&lt;br /&gt;
&lt;br /&gt;
Kolmanda loengu viis läbi Elar Lang, kes hetkel tegeleb veebirakenduste turvalisust puudutavate küsimustega, mille käigus korraldab ta samuti vastavaid koolitusi. Antud loeng põhineb tudengite motiveerimisele. Ta rääkis õppimisest ja  enda  kogemustest. Ta rääkis meile sellest, et kuulsad ja edukad ning tuntud üle terve maailma inimesed   ei käinud ülikoolis, näiteks Bill Gates, Steve Jobs, Mark Zuckerberk.  Kõik nad on suutnud kõrgeid eesmärke seada ning neid saavutada. Nad  õppisid õppima ning kohanema olukorraga.  Ja tänapäeval peavad väga tähtsaks paljud inimesed  motot:  Pidevalt uued tehnoloogiad – pidev vajadus ajaga kaasas olla.(3)&lt;br /&gt;
Kooli eesmärgiks on  anda sissejuhatus erinevatesse teemadesse ja laiendada taustateadmisi ja silmaringi. Mulle meeldis Elar Langi mõte: “Edukus ei ole juhus. See on sinu valik.” On vaja arendada enda eesmärgid, näiteks, miks sa õpid ülikoolis, mida tahad elus saavutada jne.  Veel Elar Lang rääkis, et elus on väga tähtis suhtlemine, sest ei ole vahet, kui hea spetsialist Sa oled, kui suhtlemine on probleemne. Programmeerimisest aru saamist on vaja igas rollis.(3)&lt;br /&gt;
&lt;br /&gt;
Neljanda loengu viis läbi Taavi Tuisk. Ta on süsteemiadministraator ja ta alustas oma karjääri TTÜ-s. Ta rääkis meile, süsteemiadministraatori tööst, tema kohustustest ja rollist asutuses. Süsteemiadministratoril peab olema tugev stressitaluvus, leidlikkus, tervislik paranoia, programmeerimisoskus ja ametieetika. Pimedal keskajal olid üsna unikaalsed süsteemid, puudulik või puuduv dokumentatsioon, bugine ja pööraselt kallis karbitarkvara, olid kehvad töövahendid ja kehvavõitu maine. Ta andis meile nõu, et ei tohi oma nina võõrastesse asjadesse ja dokumentidesse toppida.   On vaja valida töökohti, kus on arenemise võimalus  ja perspektiiv, mitte kus inimene teeb natuke tööd ja pärast tegeleb oma asjadega.(4)&lt;br /&gt;
&lt;br /&gt;
Viiendas loengus räägiti testimisest ja tarkvara kvaliteedist. Loegu viis läbi Kert Suvi, kes veenis auditooriumi, et testimine pole pelgalt projekti tüütuim etapp, mille vajalikkuses paljud kahtlevad, vaid see on oluline protsess, mida tuleks teha kogu projekti vältel, et lõpp-produkt oleks kvaliteetne ja turvaline. Ta rääkis taustadest, vingidest, feilidest, võimalustest, pikast ja tihedast arutelust ning näitas meile palju kassipilte. Ta selgitas meile,  miks  viiakse teste läbi, kust sai see oma alguse.  Selgus, et testitakse kõigepealt selleks, et informatsiooni saada ja teiseks riskide maandamiseks. Selles valdkonnas on 2 probleemi, esimene on see, et testitakse  vähe ja teine on see, et spetsialiste on vähe. Spetsialiste on vähe seepärast, et see ei ole „seksikas“ töö, testijad saavad väikest palka (umbes 800 eurot) ja testida oskab igaüks. Kahjuks testimine on kallis ja see ei loo väärtusi. Testija – on professionaalne skeptik ja pessimist, temal puudub pime usk,  tal on masside mõtlemisest teistsugune arusaam,  ta on tugev analüütik ja tal on kavatus.(5)&lt;br /&gt;
&lt;br /&gt;
Kuuenda loengu viis läbi Targo Tennisberg. Ta on töötanud erinevates tarkvara tootmisega nii väiksemates kui ka suuremates ettevõtetes. Ta rääkis meile IT ellujäämiskursusest. Tehnoloogiat loovad üksikud tippteadlased ja insenerid. Hea projekt sõltub ajast, skoobist, ressurssidest ja kvaliteedist. Ta andis meile edu võtmed: probleemide ennetamine ja riskide maandamine (mitte see, kui ägedat koodi sa oskad kirjutada), valmisolek teha tegevusi, mis jäävad väljapoole sinu ametikirjeldusest, efektiivse kommunikatsiooni võime ja valmisolek ootamatusteks. Kuidas saada head töökohta? On vaja olla taiplik, teha asjad õigeaegselt ära ja olla hea tiimikaaslane. Targo Tennisberg rääkis, et kõiki oskusi võib omandada ka iseseisvalt, seepärast kool ei ole oluline. Koolis olulised on saavutused. Konkreetsetest teadmistest tähtsam on võime õppida. Diplomist tähtsam on võime asju lõpule viia. Loengutest tähtsam on võime koostööd teha. Kool pakub praktilisi võimalusi nende harjutamiseks. (6)&lt;br /&gt;
Enamiku Eesti ettevõtete kasumimarginaal on vähem kui  10%. Suur raha on tiražeerimises. IT muutub tarbeaineks – kaup, millele on olemas nõudlus, aga mida pakutakse turul ilma kvalitatiivsete erinevusteta.(6)&lt;br /&gt;
&lt;br /&gt;
Seitsmenda loengu viis läbi Tanel Unt. Ta on IT ettevõtja ja tihti tegeleb start-uppidega. Oma sõpradega alustas ta start-uppi, nad tahtsid teha oma digiboksi aga see oli liiga raske. Nii nad tegid tavalised tarkvarad teistele inimestele. Tanel Unt andis meile nõu - õppima õppida, sest tänapäeval meie maailm nii kiiresti muutub, näiteks erinevad uued tehnoloogiad luuakse, aga selleks, et neid jälgida on vaja palju õppida iseseisvalt. Ta soovis meile uskuda iseendasse, õppida, kuidas oma kapitali suurendada, alustada väikestest ettevõttest ja vaadata, kuidas see läheb.(7)&lt;br /&gt;
Kui te otsustasite, et tahate saada ettevõtjaks, siis Tanel Unt soovib minna koolitusele, kus räägitakse sellest kuidas heaks ettevõtjaks saada. Kui te tegelete ise ettevõtmisega, saate ise otsustada millele kulutada kapitali, mida teha ja mida arendada. Tanel Unt ütles, et on vaja luua rõhkkonda ja mõnikord nalja heita teiste inimeste üle, sest kui sa käid tööl ainult töötamiseks, siis ei ole huvitav seda teha.(7)&lt;br /&gt;
Ta täpsustas, et on olemas risk.  Kui te ainult alustasite tegelema ettevõtmisega ja teie juurde tuleb suur klient, siis on ka suur vastutus. Parem alustada väikestest klientidest. Statistika näitab, et üks kümnest start-upist on õnnestuv.(7)&lt;br /&gt;
&lt;br /&gt;
Viimase loengu viisid läbi Oleg Bogdanov ja Oliver Kadak. Oliver Kadak rääkis meile  andmeanalüüsi olulisusest. Andmeid, mida analüüsida, on igas valdkonnas: näiteks igal ravimil on oma andmebaas, kus kirjeldatakse kõik sümptomid ja erinevad reaktsioonid nendele. Igale uuele tootele, mis läheb turule tehakse analüüs ja prognoos, kui palju kliente on oodatav ja millised on nende ootused.(8)&lt;br /&gt;
Sortimendianalüüs – näiteks on poes erinevad kommid pandud kassa kõrvale, sest väikesed lapsed tahavad seda süüa ja nende vanemad ostavad oma lapsele seda. See on ka strateegia, kuhu panna tooted, et neid oleks ostetud.(8)&lt;br /&gt;
Teine esineja oli Oleg Bogdanov. Ta on matemaatik-teoreetik ja koodikirjutaja. Oma esimesed masinkoodi programmid on ta kirjutanud aastal 1974. Ta töötas laevaprogrammeerijana, on tegelenud kosmoseuuringutega, kirjutas programmi haiglatele jne.(8)&lt;br /&gt;
&lt;br /&gt;
Antud aine raames sain parema ülevaate IT-maailmas levivatest tendentsidest, õppimise tähtsusest ja väärtusest, mis andis mulle motivatsiooni igavate ainete õppimiseks. Meeldis kuulata huvitavaid inimesi, kes teavad, mida nad elus tahavad saavutada ning oskavad oma teadmisi ka teistele jagada. Tänu nendele loengutele sain aru, et IT valdkond on väga lai ning käsitleb teemasid põhjalikult ja sügavalt. Sain aru, et selle eriala omandamiseks on kõige tähtsam õppima õppida, uskuda iseendasse ja suhelda teiste inimestega.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Kasutatud allikad&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
(1) https://echo360.e-ope.ee/ess/echo/presentation/5c75a38e-e103-474a-9e39-42aa330f4305?ec=true&lt;br /&gt;
&lt;br /&gt;
(2) https://echo360.e-ope.ee/ess/echo/presentation/e2cded4a-d03a-4ed5-95e9-de354ce58f36?ec=true&lt;br /&gt;
&lt;br /&gt;
(3) https://echo360.e-ope.ee/ess/echo/presentation/ce07046a-a6aa-41bb-8fe8-9f256a6d627f?ec=true&lt;br /&gt;
&lt;br /&gt;
(4) https://echo360.e-ope.ee/ess/echo/presentation/8e2141b7-9e98-49dc-a05d-6ca0edd3c19c?ec=true&lt;br /&gt;
&lt;br /&gt;
(5) https://echo360.e-ope.ee/ess/echo/presentation/00379be2-bb86-4935-9b4f-aad720ee4cc0?ec=true&lt;br /&gt;
&lt;br /&gt;
(6) https://echo360.e-ope.ee/ess/echo/presentation/45c455bb-ef01-4f3e-a722-5ba40ecbe8ee?ec=true&lt;br /&gt;
&lt;br /&gt;
(7) https://echo360.e-ope.ee/ess/echo/presentation/95e9f82e-debe-4f6c-833a-5dabb639600d?ec=true&lt;br /&gt;
&lt;br /&gt;
(8) https://echo360.e-ope.ee/ess/echo/presentation/f0d2dfac-5f77-47e6-8e60-abe8d9b9679d?ec=true&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Kordussoorituse aja määrab õppejõud kooskõlas õppeosakonnas koostatud ajakavaga.&lt;br /&gt;
&lt;br /&gt;
5. Riigi finantseeritaval (RF) õppekohal olevale üliõpilasele on kordussooritus [http://www.itcollege.ee/tudengile/oppetoo/oppekorraldus-eeskiri/#Eksamite%20ja%20arvestuste%20korraldus õppekorralduse eeskirja punkti 5.2.7.] kohaselt tasuta, tasulisel (OF) õppekohal olevale üliõpilasele on kordussoorituse maksumuseks nii [http://willie.itcollege.ee/?url=kordussooritused ÕIS-i] kui ka [http://www.itcollege.ee/tudengile/finantsinfo/pangarekvisiidid/ õppeteenuste tasumäärade nimekirja] kohaselt 20 eurot.&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus?&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Üliõpilasel (alates sisseastumine 2013/14) on õigus saada vajaduspõhist õppetoetust, kui:&lt;br /&gt;
&lt;br /&gt;
a) ta on Eesti kodanik või viibib Eestis pikaajalise elaniku elamisloa või tähtajalise  elamisloa või alalise või tähtajalise elamisõiguse alusel; &lt;br /&gt;
&lt;br /&gt;
b) ta õpib täiskoormusega ja on algavaks semestriks täitnud kumulatiivselt eelmistel semestritel õppekava kohaselt täitmisele kuuluva õppe mahu või ta õpib täiskoormusega esimesel semestril;&lt;br /&gt;
&lt;br /&gt;
c) tema Õppetoetuste ja õppelaenu seaduse § 51 alusel arvestatud keskmine sissetulek kuus ei ületa igaks aastaks riigieelarvega kehtestatud vajaduspõhise õppetoetuse saamiseks arvestatava keskmise sissetuleku ülemmäära. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.2.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult)&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Õppetoetuste eraldamist korraldab Haridus- ja Teadusministeerium, tema hallatav riigiasutus või tema volitatud riigi asutatud sihtasutus. Üliõpilane esitab vajaduspõhiste õppetoetuste taotluse riigiportaalis www.eesti.ee viieks õppekuuks kaks korda õppeaastas – septembris (septembriks, oktoobriks, novembriks, detsembriks ja jaanuariks) ja veebruaris (veebruariks, märtsiks, aprilliks, maiks ja juuniks). Vajaduspõhist õppetoetust makstakse riigieelarvest Haridus- ja Teadusministeeriumi eelarve kaudu igal õppekuul vastava õppekuu eest igale Õppetoetuste ja õppelaenu seaduse § 5 lõikes 21 nimetatud tingimustele vastavale üliõpilasele, kes on seda taotlenud. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.6.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Põhitoetus ja täiendav toetus määratakse vastavalt taotlejate paremusjärjestusele, lähtudes esimese kriteeriumina õppekava kohaselt täitmisele kuuluva õppemahu täitmise protsendist. Päeva-/õhtuõppe tudengite puhul võetakse õppemahu täitmise arvutamisel aluseks nominaalmaht. Kuna kaugõppe õppekava on hajutatud neljale aastale, võetakse kaugõppurite õppemahu täitmise arvutamisel aluseks 75% nominaalmahust. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 6.2.]]&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91744</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91744"/>
		<updated>2015-10-15T18:47:38Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Essee */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: 22.10.2015 kell 10:00&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Õppeaine eesmärgiks on tutvustada IT maailma ning motiveerida tudengeid süvenema oma õpingutesse. Igat loengut pidasid erinevate erialade esindajad.&lt;br /&gt;
&lt;br /&gt;
Esimene loeng  toimus juba augusti lõpus, kus Inga Vau, Margus Ernits, Merle Varendi ja Juri Tretjakov rääkisid meiega õppekorraldusest  ja sisekorrast. Mulle meeldis väga, et  peaaegu kõik meie loengud olid salvestaud. Kasulik oli ka teada saada, et tudengil on võimalus TTÜ raamatukogu kasutada ning võtta osa erinevate klubide tegevustest. Sain aru, kuidas toimub kumulatiivne EAP arvestus semestri lõpus. Kui üliõpilane soovib jääda riigieelarvelisele kohale, tuleb semestris saada vähemalt 27 EAP. Kui saada semestris 25 EAP, siis tuleb järgmisel semestril arve 2 EAP eest. Punktide arvestus käib kumulatiivselt. See tähendab, et kui järgmisel semestril võtab üliõpilane 27 EAP, siis ülejärgmisel semestril tuleb ikka arve nende 2 EAP eest. Seepärast tuleks tudengil võtta järgmisel semestril 29 EAP. Merle Varendi rääkis esimeses loengus stipendiumitest ja õppetoetustest. Firma stipendiumile on võimalik kandideerida alates kevadsemestrist. (1)&lt;br /&gt;
&lt;br /&gt;
Teise loengu viis läbi Tiina Seeman. Ta on hingelt ja ametilt projektijuht. Ta rääkis meile juhtimisest. Ta selgitas meile, mis on projektijuhtimine ja miks see on vajalik. Ilma juhtimeseta lähevad asjad halvasti. Tegemist on rohkem ühiskonnaga. On vaja arendada oskust  planeerida, näiteks kui palju raha on olemas, millele raha kulutada, mida on vaja osta jne. Ta näitas meile tabeli, kust sai teada, miks projektid feilivad (läbi kukuvad) ja  enamus põhjustest olid:   lõppkasutaja kaasatus - 19%, tegevjuhtide kaasatus - 16% ja selge skoop kõikidele osapooltele. Tiina Seeman näitas meile projektijuhtimise erinevaid dimensioone: skoop, kvaliteet, aeg, pingutus ja raha. Kuidas  projektiplaani teha? Kõigepealt  tuleb riskid läbi  mõelda, planeerida, millele raha kulutada ja teha skoopi. Ta näitas meile “IT” etapid  ja “IT” rollid projektis, mis on väga tähtsad juhtimisel. (2)&lt;br /&gt;
&lt;br /&gt;
Kolmanda loengu viis läbi Elar Lang, kes hetkel tegeleb veebirakenduste turvalisust puudutavate küsimustega, mille käigus korraldab ta samuti vastavaid koolitusi. Antud loeng põhineb tudengite motiveerimisele. Ta rääkis õppimisest ja  enda  kogemustest. Ta rääkis meile sellest, et kuulsad ja edukad ning tuntud üle terve maailma inimesed   ei käinud ülikoolis, näiteks Bill Gates, Steve Jobs, Mark Zuckerberk.  Kõik nad on suutnud kõrgeid eesmärke seada ning neid saavutada. Nad  õppisid õppima ning kohanema olukorraga.  Ja tänapäeval peavad väga tähtsaks paljud inimesed  motot:  Pidevalt uued tehnoloogiad – pidev vajadus ajaga kaasas olla.(3)&lt;br /&gt;
Kooli eesmärgiks on  anda sissejuhatus erinevatesse teemadesse ja laiendada taustateadmisi ja silmaringi. Mulle meeldis Elar Langi mõte: “Edukus ei ole juhus. See on sinu valik.” On vaja arendada enda eesmärgid, näiteks, miks sa õpid ülikoolis, mida tahad elus saavutada jne.  Veel Elar Lang rääkis, et elus on väga tähtis suhtlemine, sest ei ole vahet, kui hea spetsialist Sa oled, kui suhtlemine on probleemne. Programmeerimisest aru saamist on vaja igas rollis.(3)&lt;br /&gt;
&lt;br /&gt;
Neljanda loengu viis läbi Taavi Tuisk. Ta on süsteemiadministraator ja ta alustas oma karjääri TTÜ-s. Ta rääkis meile, süsteemiadministraatori tööst, tema kohustustest ja rollist asutuses. Süsteemiadministratoril peab olema tugev stressitaluvus, leidlikkus, tervislik paranoia, programmeerimisoskus ja ametieetika. Pimedal keskajal olid üsna unikaalsed süsteemid, puudulik või puuduv dokumentatsioon, bugine ja pööraselt kallis karbitarkvara, olid kehvad töövahendid ja kehvavõitu maine. Ta andis meile nõu, et ei tohi oma nina võõrastesse asjadesse ja dokumentidesse toppida.   On vaja valida töökohti, kus on arenemise võimalus  ja perspektiiv, mitte kus inimene teeb natuke tööd ja pärast tegeleb oma asjadega.(4)&lt;br /&gt;
&lt;br /&gt;
Viiendas loengus räägiti testimisest ja tarkvara kvaliteedist. Loegu viis läbi Kert Suvi, kes veenis auditooriumi, et testimine pole pelgalt projekti tüütuim etapp, mille vajalikkuses paljud kahtlevad, vaid see on oluline protsess, mida tuleks teha kogu projekti vältel, et lõpp-produkt oleks kvaliteetne ja turvaline. Ta rääkis taustadest, vingidest, feilidest, võimalustest, pikast ja tihedast arutelust ning näitas meile palju kassipilte. Ta selgitas meile,  miks  viiakse teste läbi, kust sai see oma alguse.  Selgus, et testitakse kõigepealt selleks, et informatsiooni saada ja teiseks riskide maandamiseks. Selles valdkonnas on 2 probleemi, esimene on see, et testitakse  vähe ja teine on see, et spetsialiste on vähe. Spetsialiste on vähe seepärast, et see ei ole „seksikas“ töö, testijad saavad väikest palka (umbes 800 eurot) ja testida oskab igaüks. Kahjuks testimine on kallis ja see ei loo väärtusi. Testija – on professionaalne skeptik ja pessimist, temal puudub pime usk,  tal on masside mõtlemisest teistsugune arusaam,  ta on tugev analüütik ja tal on kavatus.(5)&lt;br /&gt;
&lt;br /&gt;
Kuuenda loengu viis läbi Targo Tennisberg. Ta on töötanud erinevates tarkvara tootmisega nii väiksemates kui ka suuremates ettevõtetes. Ta rääkis meile IT ellujäämiskursusest. Tehnoloogiat loovad üksikud tippteadlased ja insenerid. Hea projekt sõltub ajast, skoobist, ressurssidest ja kvaliteedist. Ta andis meile edu võtmed: probleemide ennetamine ja riskide maandamine (mitte see, kui ägedat koodi sa oskad kirjutada), valmisolek teha tegevusi, mis jäävad väljapoole sinu ametikirjeldusest, efektiivse kommunikatsiooni võime ja valmisolek ootamatusteks. Kuidas saada head töökohta? On vaja olla taiplik, teha asjad õigeaegselt ära ja olla hea tiimikaaslane. Targo Tennisberg rääkis, et kõiki oskusi võib omandada ka iseseisvalt, seepärast kool ei ole oluline. Koolis olulised on saavutused. Konkreetsetest teadmistest tähtsam on võime õppida. Diplomist tähtsam on võime asju lõpule viia. Loengutest tähtsam on võime koostööd teha. Kool pakub praktilisi võimalusi nende harjutamiseks. (6)&lt;br /&gt;
Enamiku Eesti ettevõtete kasumimarginaal on vähem kui  10%. Suur raha on tiražeerimises. IT muutub tarbeaineks – kaup, millele on olemas nõudlus, aga mida pakutakse turul ilma kvalitatiivsete erinevusteta.(6)&lt;br /&gt;
&lt;br /&gt;
Seitsmenda loengu viis läbi Tanel Unt. Ta on IT ettevõtja ja tihti tegeleb start-uppidega. Oma sõpradega alustas ta start-uppi, nad tahtsid teha oma digiboksi aga see oli liiga raske. Nii nad tegid tavalised tarkvarad teistele inimestele. Tanel Unt andis meile nõu - õppima õppida, sest tänapäeval meie maailm nii kiiresti muutub, näiteks erinevad uued tehnoloogiad luuakse, aga selleks, et neid jälgida on vaja palju õppida iseseisvalt. Ta soovis meile uskuda iseendasse, õppida, kuidas oma kapitali suurendada, alustada väikestest ettevõttest ja vaadata, kuidas see läheb.(7)&lt;br /&gt;
Kui te otsustasite, et tahate saada ettevõtjaks, siis Tanel Unt soovib minna koolitusele, kus räägitakse sellest kuidas heaks ettevõtjaks saada. Kui te tegelete ise ettevõtmisega, saate ise otsustada millele kulutada kapitali, mida teha ja mida arendada. Tanel Unt ütles, et on vaja luua rõhkkonda ja mõnikord nalja heita teiste inimeste üle, sest kui sa käid tööl ainult töötamiseks, siis ei ole huvitav seda teha.(7)&lt;br /&gt;
Ta täpsustas, et on olemas risk.  Kui te ainult alustasite tegelema ettevõtmisega ja teie juurde tuleb suur klient, siis on ka suur vastutus. Parem alustada väikestest klientidest. Statistika näitab, et üks kümnest start-upist on õnnestuv.(7)&lt;br /&gt;
&lt;br /&gt;
Viimase loengu viisid läbi Oleg Bogdanov ja Oliver Kadak. Oliver Kadak rääkis meile  andmeanalüüsi olulisusest. Andmeid, mida analüüsida, on igas valdkonnas: näiteks igal ravimil on oma andmebaas, kus kirjeldatakse kõik sümptomid ja erinevad reaktsioonid nendele. Igale uuele tootele, mis läheb turule tehakse analüüs ja prognoos, kui palju kliente on oodatav ja millised on nende ootused.(8)&lt;br /&gt;
Sortimendianalüüs – näiteks on poes erinevad kommid pandud kassa kõrvale, sest väikesed lapsed tahavad seda süüa ja nende vanemad ostavad oma lapsele seda. See on ka strateegia, kuhu panna tooted, et neid oleks ostetud.(8)&lt;br /&gt;
Teine esineja oli Oleg Bogdanov. Ta on matemaatik-teoreetik ja koodikirjutaja. Oma esimesed masinkoodi programmid on ta kirjutanud aastal 1974. Ta töötas laevaprogrammeerijana, on tegelenud kosmoseuuringutega, kirjutas programmi haiglatele jne.(8)&lt;br /&gt;
&lt;br /&gt;
Antud aine raames sain parema ülevaate IT-maailmas levivatest tendentsidest, õppimise tähtsusest ja väärtusest, mis andis mulle motivatsiooni igavate ainete õppimiseks. Meeldis kuulata huvitavaid inimesi, kes teavad, mida nad elus tahavad saavutada ning oskavad oma teadmisi ka teistele jagada. Tänu nendele loengutele sain aru, et IT valdkond on väga lai ning käsitleb teemasid põhjalikult ja sügavalt. Sain aru, et selle eriala omandamiseks on kõige tähtsam õppima õppida, uskuda iseendasse ja suhelda teiste inimestega.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Kasutatud allikad&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
(1) https://echo360.e-ope.ee/ess/echo/presentation/5c75a38e-e103-474a-9e39-42aa330f4305?ec=true&lt;br /&gt;
&lt;br /&gt;
(2) https://echo360.e-ope.ee/ess/echo/presentation/e2cded4a-d03a-4ed5-95e9-de354ce58f36?ec=true&lt;br /&gt;
&lt;br /&gt;
(3) https://echo360.e-ope.ee/ess/echo/presentation/ce07046a-a6aa-41bb-8fe8-9f256a6d627f?ec=true&lt;br /&gt;
&lt;br /&gt;
(4) https://echo360.e-ope.ee/ess/echo/presentation/8e2141b7-9e98-49dc-a05d-6ca0edd3c19c?ec=true&lt;br /&gt;
&lt;br /&gt;
(5) https://echo360.e-ope.ee/ess/echo/presentation/00379be2-bb86-4935-9b4f-aad720ee4cc0?ec=true&lt;br /&gt;
&lt;br /&gt;
(6) https://echo360.e-ope.ee/ess/echo/presentation/45c455bb-ef01-4f3e-a722-5ba40ecbe8ee?ec=true&lt;br /&gt;
&lt;br /&gt;
(7) https://echo360.e-ope.ee/ess/echo/presentation/95e9f82e-debe-4f6c-833a-5dabb639600d?ec=true&lt;br /&gt;
&lt;br /&gt;
(8) https://echo360.e-ope.ee/ess/echo/presentation/f0d2dfac-5f77-47e6-8e60-abe8d9b9679d?ec=true&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Korduseksamid on tasulisel õppekohal õppijatele tasulised, RF kohal on tasuta. Tasu suurus kehtestatakse rektori käskkirjaga ja arve kuvatakse ÕISis.&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.7]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus?&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Üliõpilasel (alates sisseastumine 2013/14) on õigus saada vajaduspõhist õppetoetust, kui:&lt;br /&gt;
&lt;br /&gt;
a) ta on Eesti kodanik või viibib Eestis pikaajalise elaniku elamisloa või tähtajalise  elamisloa või alalise või tähtajalise elamisõiguse alusel; &lt;br /&gt;
&lt;br /&gt;
b) ta õpib täiskoormusega ja on algavaks semestriks täitnud kumulatiivselt eelmistel semestritel õppekava kohaselt täitmisele kuuluva õppe mahu või ta õpib täiskoormusega esimesel semestril;&lt;br /&gt;
&lt;br /&gt;
c) tema Õppetoetuste ja õppelaenu seaduse § 51 alusel arvestatud keskmine sissetulek kuus ei ületa igaks aastaks riigieelarvega kehtestatud vajaduspõhise õppetoetuse saamiseks arvestatava keskmise sissetuleku ülemmäära. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.2.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult)&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Õppetoetuste eraldamist korraldab Haridus- ja Teadusministeerium, tema hallatav riigiasutus või tema volitatud riigi asutatud sihtasutus. Üliõpilane esitab vajaduspõhiste õppetoetuste taotluse riigiportaalis www.eesti.ee viieks õppekuuks kaks korda õppeaastas – septembris (septembriks, oktoobriks, novembriks, detsembriks ja jaanuariks) ja veebruaris (veebruariks, märtsiks, aprilliks, maiks ja juuniks). Vajaduspõhist õppetoetust makstakse riigieelarvest Haridus- ja Teadusministeeriumi eelarve kaudu igal õppekuul vastava õppekuu eest igale Õppetoetuste ja õppelaenu seaduse § 5 lõikes 21 nimetatud tingimustele vastavale üliõpilasele, kes on seda taotlenud. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.6.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Põhitoetus ja täiendav toetus määratakse vastavalt taotlejate paremusjärjestusele, lähtudes esimese kriteeriumina õppekava kohaselt täitmisele kuuluva õppemahu täitmise protsendist. Päeva-/õhtuõppe tudengite puhul võetakse õppemahu täitmise arvutamisel aluseks nominaalmaht. Kuna kaugõppe õppekava on hajutatud neljale aastale, võetakse kaugõppurite õppemahu täitmise arvutamisel aluseks 75% nominaalmahust. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 6.2.]]&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91100</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=91100"/>
		<updated>2015-10-03T18:59:06Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: 22.10.2015 kell 10:00&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Essee tuleb natuke hiljem&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Korduseksamid on tasulisel õppekohal õppijatele tasulised, RF kohal on tasuta. Tasu suurus kehtestatakse rektori käskkirjaga ja arve kuvatakse ÕISis.&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.7]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus?&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Üliõpilasel (alates sisseastumine 2013/14) on õigus saada vajaduspõhist õppetoetust, kui:&lt;br /&gt;
&lt;br /&gt;
a) ta on Eesti kodanik või viibib Eestis pikaajalise elaniku elamisloa või tähtajalise  elamisloa või alalise või tähtajalise elamisõiguse alusel; &lt;br /&gt;
&lt;br /&gt;
b) ta õpib täiskoormusega ja on algavaks semestriks täitnud kumulatiivselt eelmistel semestritel õppekava kohaselt täitmisele kuuluva õppe mahu või ta õpib täiskoormusega esimesel semestril;&lt;br /&gt;
&lt;br /&gt;
c) tema Õppetoetuste ja õppelaenu seaduse § 51 alusel arvestatud keskmine sissetulek kuus ei ületa igaks aastaks riigieelarvega kehtestatud vajaduspõhise õppetoetuse saamiseks arvestatava keskmise sissetuleku ülemmäära. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.2.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult)&#039;&#039;&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Õppetoetuste eraldamist korraldab Haridus- ja Teadusministeerium, tema hallatav riigiasutus või tema volitatud riigi asutatud sihtasutus. Üliõpilane esitab vajaduspõhiste õppetoetuste taotluse riigiportaalis www.eesti.ee viieks õppekuuks kaks korda õppeaastas – septembris (septembriks, oktoobriks, novembriks, detsembriks ja jaanuariks) ja veebruaris (veebruariks, märtsiks, aprilliks, maiks ja juuniks). Vajaduspõhist õppetoetust makstakse riigieelarvest Haridus- ja Teadusministeeriumi eelarve kaudu igal õppekuul vastava õppekuu eest igale Õppetoetuste ja õppelaenu seaduse § 5 lõikes 21 nimetatud tingimustele vastavale üliõpilasele, kes on seda taotlenud. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 2.6.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Põhitoetus ja täiendav toetus määratakse vastavalt taotlejate paremusjärjestusele, lähtudes esimese kriteeriumina õppekava kohaselt täitmisele kuuluva õppemahu täitmise protsendist. Päeva-/õhtuõppe tudengite puhul võetakse õppemahu täitmise arvutamisel aluseks nominaalmaht. Kuna kaugõppe õppekava on hajutatud neljale aastale, võetakse kaugõppurite õppemahu täitmise arvutamisel aluseks 75% nominaalmahust. [[http://www.itcollege.ee/tudengile/finantsinfo/riiklike-oppetoestuste-taotlemise-ja-maksmise-kord-eesti-infotehnoloogia-kolledzis/#toetused toetused, punkt 6.2.]]&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=90840</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=90840"/>
		<updated>2015-09-23T18:43:38Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: /* Erialatutvustuse aine arvestustöö */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: 22.10.2015 kell 10:00&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Essee tuleb natuke hiljem&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Korduseksamid on tasulisel õppekohal õppijatele tasulised, RF kohal on tasuta. Tasu suurus kehtestatakse rektori käskkirjaga ja arve kuvatakse ÕISis.&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.7]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus? Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult) Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;!!!&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
	<entry>
		<id>https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=90839</id>
		<title>User:Jkuzmin</title>
		<link rel="alternate" type="text/html" href="https://wiki.itcollege.ee/index.php?title=User:Jkuzmin&amp;diff=90839"/>
		<updated>2015-09-23T18:27:21Z</updated>

		<summary type="html">&lt;p&gt;Jkuzmin: Created page with &amp;quot; Category:Erialatutvustus 2015 (Päevaõpe) =Erialatutvustuse aine arvestustöö= Autor: Jevgeni Kuzmin  Esitamise kuupäev: ei tea  ==Essee==  Essee tuleb natuke hiljem...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; [[Category:Erialatutvustus 2015 (Päevaõpe)]]&lt;br /&gt;
=Erialatutvustuse aine arvestustöö=&lt;br /&gt;
Autor: Jevgeni Kuzmin&lt;br /&gt;
&lt;br /&gt;
Esitamise kuupäev: ei tea&lt;br /&gt;
&lt;br /&gt;
==Essee==&lt;br /&gt;
&lt;br /&gt;
Essee tuleb natuke hiljem&lt;br /&gt;
&lt;br /&gt;
==Õpingukorralduse küsimused==&lt;br /&gt;
===Küsimus A=== &lt;br /&gt;
Kukkusid eksamil läbi. Kaua on võimalik eksamit järele teha? Kellega kokku leppida, et kordussooritust teha? Kuidas toimub kordussooritusele registreerimine? Mis on tähtajad? Kui palju maksab, kui oled riigi finantseeritaval (RF) õppekohal? Kui palju maksab, kui oled tasulisel (OF) õppekohal?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
1. Võin teha korduseksamit kahe semestri jooksul pärast aine õpetamissemestri lõppu, kusjuures õppejõul on õigus anda täiendavaid  ülesandeid, mille täitmine on korduseksamile lubamise eelduseks. &lt;br /&gt;
&lt;br /&gt;
2. Korduseksamite tähtajad määrab ainet õpetav õppejõud kooskõlas õppeosakonnas koostatud ajakavaga. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#alused Õppekorralduse eeskiri punkt 5.3.6]&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
3. Eksamile/ arvestusele registreerumine on nõutav:&lt;br /&gt;
korduseksami ja -arvestuse puhul ÕISis;&lt;br /&gt;
üliõpilastel, kes soovivad sooritada eksamit/arvestust akadeemilisel puhkusel olles, esitades avalduse õppeosakonda.&lt;br /&gt;
Registreerumise ja soorituse vahele peab jääma vähemalt 2 tööpäeva. &amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.8 ja 5.2.12]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
4. Korduseksamid on tasulisel õppekohal õppijatele tasulised, RF kohal on tasuta. Tasu suurus kehtestatakse rektori käskkirjaga ja arve kuvatakse ÕISis.&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/eeskirjad-ja-juhendid/oppekorraldus-eeskiri/#eksamitekorraldus Õppekorralduse eeskiri punkt 5.2.7]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Küsimus 5===&lt;br /&gt;
Millised eeldused peavad olema täidetud vajaduspõhise õppetoetuse saamiseks ja millest sõltub toetuse suurus? Mida peab toetuse saamiseks tegema? (Vastake kokkuvõtlikult) Mis on minimaalne ainepunkide arv semestris õppetoetuse saamiseks?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastused&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;!!!&lt;br /&gt;
===Ülessanne===&lt;br /&gt;
Kui mitme EAP ulatuses tuleb tasuta õppides õppekulud osaliselt hüvitada aasta lõpuks, kui esimese semestri lõpuks on olemas X EAPd ja teise semestri lõpuks Y EAPd? Kui suur on teile esitatav arve? X ja Y väärtused võtke allpool olevast tabelist selliselt, et X väärtus vastab teie üliõpilaskoodi eelviimasele numbrile ja Y üliõpilaskoodi viimasele numbrile.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Vastus:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
X = 8 =&amp;gt; 27&lt;br /&gt;
&lt;br /&gt;
Y = 8 =&amp;gt; 27 &lt;br /&gt;
&lt;br /&gt;
Kogutud EAP: 27 + 27 = 54&lt;br /&gt;
&lt;br /&gt;
Vajalik EAP arv: 27+27= 54&lt;br /&gt;
&lt;br /&gt;
Puudjäärk: 54 - 54 = 0&lt;br /&gt;
&lt;br /&gt;
Maksma peab: 0*50 = 0€&amp;lt;ref&amp;gt;[http://www.itcollege.ee/tudengile/kkk/korgharidusreform-kkk/#Teine Kõrgharidusreform]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=Viited=&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jkuzmin</name></author>
	</entry>
</feed>