You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

44 lines
2.4 KiB
HTML

5 years ago
<!DOCTYPE html>
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>Tasks of the Contingent Librarian</title>
<link rel="stylesheet" type="text/css" href="tasks.css">
<script src="tasks.js"></script>
</head>
<body>
<div class="card"><DOCUMENT_FRAGMENT><div class="mw-parser-output"><h1><span class="mw-headline" id="indexing">indexing</span><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/mw-mediadesign/index.php?title=User:Simon/Indexing&amp;action=edit&amp;section=1" title="Edit section: indexing">edit</a><span class="mw-editsection-bracket">]</span></span></h1>
<p>see also <a href="Human_reading.html" title="User:Simon/Human reading">human reading</a>, <a href="Inter-depending.html" title="User:Simon/Inter-depending">inter-depending</a>, <a href="Scanning.html" title="User:Simon/Scanning">scanning</a>
</p><p>Most books contain an index. Most books are also indexed in some type of cataloguing system, to present the collection and inter-relationships between the texts contained within, and those outside of the library. This set of cards is an unbound index, which can be reshuffled, added to and reduced as the reader pleases. Reducing a text to an index opens it up for the reader to complete it as they read, drawing on what they have read before and creating a mental network of associations. A book is a hyper-index, forever pointing outwards to other books, libraries, readers and writers. <i>I use my index finger to trace over the text, moving down the page as my eyes scan for keywords</i>.
</p><p>Image: Alejandro Cesarco, <i>Index</i>, exhibited at Witte de With Contemporary, September 2019-January 2020
</p>
<!--
NewPP limit report
Cached time: 20200620082439
5 years ago
Cache expiry: 86400
Dynamic content: false
CPU time usage: 0.003 seconds
Real time usage: 0.004 seconds
5 years ago
Preprocessor visited node count: 2/1000000
Preprocessor generated node count: 8/1000000
Postexpand include size: 0/2097152 bytes
Template argument size: 0/2097152 bytes
Highest expansion depth: 2/40
Expensive parser function count: 0/100
Unstrip recursion depth: 0/20
Unstrip postexpand size: 0/5000000 bytes
-->
<!--
Transclusion expansion time report (%,ms,calls,template)
100.00% 0.000 1 -total
-->
<!-- Saved in parser cache with key wdka_mw_mediadesign-mw_:pcache:idhash:31451-0!canonical and timestamp 20200620082439 and revision id 174174
5 years ago
-->
</div></DOCUMENT_FRAGMENT></div>
</body>
</html>