This file is indexed.

/usr/share/jed/jed-extra/drop-in/look.sl is in jed-extra 2.5.6-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
% look.sl
%
% $Id: look.sl,v 1.10 2007/04/21 10:14:47 paul Exp paul $
% 
% Copyright (c) 2003-2007 Paul Boekholt.
% Released under the terms of the GNU GPL (version 2 or later).
%
% This file provides completion of words from the system dictionary.  This
% was adapted from the BSD look program.
provide ("look");

require("ispell_common");
use_namespace("ispell");
private variable fp, word, l;
private variable keys_string = "0123456789abcdefghijklmnopqrstuvwxyz";
private variable look_max_hits = strlen(keys_string);
private variable keys = Char_Type[look_max_hits];
init_char_array(keys, keys_string);

private define skip_past_newline(p)
{
   variable s;
   ()=fseek(fp, p, SEEK_SET);
   ()=fgets(&s, fp);
   return ftell(fp);
}

private define compare(p)
{
   variable s;
   ()=fseek(fp, p, SEEK_SET);
   ()=fgets(&s, fp);
   return strncmp(word, strlow(s), l);
}

private define binary_search(front, back)
{
   ()=fseek(fp, front, SEEK_SET);
   variable p = (back - front) / 2;
   p = skip_past_newline(p);

   while (p < back and back > front) 
     {
	if (compare(p) > 0) front = p;
	else back = p;
	p = front + (back - front) / 2;
	p=skip_past_newline(p);
     }
   return front;
}

private define linear_search(front)
{
   variable c, s, result = 0;
   ()=fseek(fp, front, SEEK_SET);
   loop (look_max_hits)
     {
	if (-1 == fgets(&s, fp)) break;
	c =  (strncmp(word, strlow(s), l));
	if (c > 0) continue;
	if (c < 0) break;
	s;
     }
}

% Case insensitive binary search dictionary lookup. Returns matches as an
% array of words.
define look(w, file)
{
   word=w;
   l=strlen(w);
   fp = fopen(file, "r");
   if (fp == NULL) throw RunTimeError, sprintf("could not open file %s", file);
   variable front, back, result;
   ()=fseek(fp, 0, SEEK_SET);
   front = ftell(fp);
   ()=fseek(fp, 0, SEEK_END);
   back = ftell(fp);
   front = binary_search(front, back);
   result = [w, linear_search(front)];
   result = result[[1:]];
   ()=fclose(fp);
   return result;
}


% Complete word by looking it up in the system dictionary.
% Has little to do with ispell, but in Emacs it's called ispell-complete.

public define ispell_complete()
{
   variable word, new_word, buf = whatbuf, cbuf = "*completions*",
     num_win = nwindows, obuf, completions, i, wordlen;
   _pop_n(_NARGS);
   push_spot();
   push_mark();
   ispell_beginning_of_word();	       %  The Dutch dictionary does have
   				       %  "-'" chars in words
   word = strlow(bufsubstr());
   wordlen = strlen(word);
   pop_spot();
   if (ispell_wordlist == "") return message ("no wordlist");
   completions = look(word, ispell_wordlist);
   !if (length(completions)) return message ("no completions");
   % try to complete a part
   variable first_completion = completions[0];
   variable last_completion = completions[-1];
   if (length(completions) < look_max_hits - 1
       and not strncmp (first_completion, last_completion, 1 + strlen (word)))
     {
	% is there a simple way to find a common beginning of two strings?
	variable len = strlen (first_completion);
	% Either first_completion is a substring of last_completion,
	% or they differ somewhere, so this won't give an array range error
	_for i (0, strlen(first_completion), 1)
	  {
	     if (first_completion[i] != last_completion[i])
	       break;
	  }
	i--;

	insert (strtrim_end(first_completion[[wordlen:i]], "\n"));
	return;
     }

   obuf = pop2buf_whatbuf(cbuf);
   erase_buffer;
   _for i (0,  length(completions) - 1, 1)
      {
    	vinsert ("(%c)  %s", keys[i], completions[i]);
      }

   buffer_format_in_columns;
   bob;
   insert ("completions for " + word + "\n");


   set_buffer_modified_flag(0);
   message ("Enter choice (SPACE to leave unchanged)");

   update_sans_update_hook(0);
   try
     {
	i  = getkey();
     }
   finally
     {
	sw2buf(obuf);
	pop2buf(buf);
	if (num_win == 1) onewindow();
	bury_buffer(cbuf);
     }
   if (i != ' ')
     {
	i = wherefirst (i == keys);
	if (i != NULL)
	  if (i < length(completions))
	    insert (strtrim_end(completions[i][[wordlen:]]));
     }
}