This file is indexed.

/usr/lib/R/site-library/bit/NEWS is in r-cran-bit 1.1-12-2.

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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
    CHANGES IN bit VERSION 1.1-12

NEW FEATURES

    o function still.identical() has been moved to here from package bit64
    o generic 'clone' and methods clone.default and clone.list have been moved to here from package ff

BUG FIXES

    o bit[bitwhich] is now subscripting properly (VALGRIND)
	o UBSAN should no longer complain about left shift of int
      (although that never was a problem)

	
	
    CHANGES IN bit VERSION 1.1-10


TUNING

    o function 'vecseq' now calls C-code when calling with the default 
	  parameters 'concat=TRUE, eval=TRUE' (wish of Matthew Dowle)

BUG FIXES

    o all.bit no longer ignores TRUE values in the second and following words
	  (spotted by Nelson Chen)

	
	
    CHANGES IN bit VERSION 1.1-9


NEW FEATURES

    o new function 'repeat.time' for adaptive timing

	
CODE ORGANIZATION

    o generics for sorting and ordering have been moved from 'ff' to 'bit'
	
	
	
    CHANGES IN bit VERSION 1.1-7


USER VISIBLE CHANGES

    o all calls to 'seq.int' have been replaced by 'seq_along' or 'seq_len'
    o most calls to 'cat' have been replaced by 'message'


BUG FIXES

    o chunk.default now works with chunk(from=2, to=3, by=1) thanks to Edwin de Jonge



    CHANGES IN bit VERSION 1.1-5


NEW FEATURES

    o new utility functions setattr() and setattributes() allow to set attributes 
      by reference (unlike attr()<- attributes()<- without copying the object)

    o new utility unattr() returns copy of input with attributes removed


USER VISIBLE CHANGES

    o certain operations like creating a bit object are even faster now: need 
      half the time and RAM through the use of setattr() instead of attr()<-

    o [.bit now decorates its logical return vector with attr(,'vmode')='boolean',
      i.e. we retain the information that there are no NAs.


BUG FIXES

    o .onLoad() no longer calls installed.packages() which substantially 
      improves startup time (thanks to Brian Ripley)



    CHANGES IN bit VERSION 1.1-2


USER VISIBLE CHANGES

    o The package now has a namespace




    CHANGES IN bit VERSION 1.1-1


USER VISIBLE CHANGES

    o Function 'chunk' has been made generic, the default method
      provides the previous behavior.

    o New method to increase length of bitwhich objects.

    o Added further coercion methods.
      provides the previous behavior.


BUG FIXES

    o as.bitwhich.ri now generates correct negative subscripts.




    CHANGES IN bit VERSION 1.1-0


NEW FEATURES

    o New class 'bitwhich' stores subscript positions in most efficient way:
      TRUE for all()==TRUE, FALSE for !any()==TRUE. otherwise positive or
      negative subscripts, whatever needs less RAM. Coercion functions and 
      logical operators are available, the latter being efficient for very
      asymetric (skewed) distributions: selecting or exlcuding small factions
      of the data.
    
    o New class 'ri' (range index) allows to select ranges of positions for 
      chunked processing: all three classes 'bit', 'bitwhich' and 'ri' can be 
      used for subsetting 'ff' objects (ff-2.1.0 and higher).
    
    o New c() method for 'bit' and 'bitwhich' objects which behaves like 
      c(logical).

    o The bit methods sum(), any(), all(), min(), max(), range(), summary() 
      and which() now support a range argument that allows to restrict the 
      range of evaluation for chunked processing.

    o New utilities for chunked processing: bbatch, repfromto, chunk, vecseq.


USER VISIBLE CHANGES

    o reducing length of bit objects will now set hidden bits to FALSE, 
      such that subsequent length increase behaves consistent with bit
      objects that had never been reduced in length: new bits are FALSE

    o 'which' is no longer turned into a generic. Use 'bitwhich' instead, 
      or, 'as.which' if you need strictly positive subscripts. 
      
    o 'which.bit' has been renamed to 'as.which.bit'. It no longer has 
      parameter 'negative' and always returns positive subscripts (wish of 
      Stavros Macrakis). It now has second parameter 'range' in order to return
      subscripts for chunked processing (note that the bitwhich representation 
      is not suitable for chunked processing). In order to facilitate coercion, 
      the return vector of 'as.which' now has class 'which'.
      
    o the internal structure of a bit object has been changed to align with ff 
      ram objects: the bitlength of a bit object is no longer stored in 
      attr(bit, "n"), instead in attr(attr(bit, "physical"), "Length"),
      which is accessible via physical(bit)$Length, but should be accessed
      usually via length(bit). 

    o the semantics of 'min', 'max' and 'range' have been changed. They now 
      refer to the positions of TRUE in the bit vector (and thus are consistent
      with bitwhich rather than with logical. The 'summary' method now returns 
      four elements c("FALSE"=, "TRUE"=, "Min."=, "Max."=).


BUG FIXES

    o which.bit no longer returns integer() for a bit vector that has all TRUE


KNOWN PROBLEMS / TODOs

    o NAs are mapped to TRUE in 'bit' and to FALSE in 'ff' booleans. Might be aligned 
      in a future release. Don't use bit if you have NAs - or map NAs explicitely.