This file is indexed.

/usr/share/doc/libcobertura-java/api/src-html/net/sourceforge/cobertura/coveragedata/countermaps/AtomicCounterMap.html is in libcobertura-java-doc 1.9.4.1+dfsg-3.

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
<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Cobertura - http://cobertura.sourceforge.net/<a name="line.2"></a>
<FONT color="green">003</FONT>     *<a name="line.3"></a>
<FONT color="green">004</FONT>     * Copyright (C) 2010 Piotr Tabor<a name="line.4"></a>
<FONT color="green">005</FONT>     *<a name="line.5"></a>
<FONT color="green">006</FONT>     * Note: This file is dual licensed under the GPL and the Apache<a name="line.6"></a>
<FONT color="green">007</FONT>     * Source License (so that it can be used from both the main<a name="line.7"></a>
<FONT color="green">008</FONT>     * Cobertura classes and the ant tasks).<a name="line.8"></a>
<FONT color="green">009</FONT>     *<a name="line.9"></a>
<FONT color="green">010</FONT>     * Cobertura is free software; you can redistribute it and/or modify<a name="line.10"></a>
<FONT color="green">011</FONT>     * it under the terms of the GNU General Public License as published<a name="line.11"></a>
<FONT color="green">012</FONT>     * by the Free Software Foundation; either version 2 of the License,<a name="line.12"></a>
<FONT color="green">013</FONT>     * or (at your option) any later version.<a name="line.13"></a>
<FONT color="green">014</FONT>     *<a name="line.14"></a>
<FONT color="green">015</FONT>     * Cobertura is distributed in the hope that it will be useful, but<a name="line.15"></a>
<FONT color="green">016</FONT>     * WITHOUT ANY WARRANTY; without even the implied warranty of<a name="line.16"></a>
<FONT color="green">017</FONT>     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU<a name="line.17"></a>
<FONT color="green">018</FONT>     * General Public License for more details.<a name="line.18"></a>
<FONT color="green">019</FONT>     *<a name="line.19"></a>
<FONT color="green">020</FONT>     * You should have received a copy of the GNU General Public License<a name="line.20"></a>
<FONT color="green">021</FONT>     * along with Cobertura; if not, write to the Free Software<a name="line.21"></a>
<FONT color="green">022</FONT>     * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307<a name="line.22"></a>
<FONT color="green">023</FONT>     * USA<a name="line.23"></a>
<FONT color="green">024</FONT>     */<a name="line.24"></a>
<FONT color="green">025</FONT>    <a name="line.25"></a>
<FONT color="green">026</FONT>    package net.sourceforge.cobertura.coveragedata.countermaps;<a name="line.26"></a>
<FONT color="green">027</FONT>    <a name="line.27"></a>
<FONT color="green">028</FONT>    import java.util.Iterator;<a name="line.28"></a>
<FONT color="green">029</FONT>    import java.util.LinkedHashMap;<a name="line.29"></a>
<FONT color="green">030</FONT>    import java.util.Map;<a name="line.30"></a>
<FONT color="green">031</FONT>    import java.util.concurrent.ConcurrentHashMap;<a name="line.31"></a>
<FONT color="green">032</FONT>    import java.util.concurrent.ConcurrentMap;<a name="line.32"></a>
<FONT color="green">033</FONT>    import java.util.concurrent.atomic.AtomicInteger;<a name="line.33"></a>
<FONT color="green">034</FONT>    <a name="line.34"></a>
<FONT color="green">035</FONT>    import net.sourceforge.cobertura.coveragedata.HasBeenInstrumented;<a name="line.35"></a>
<FONT color="green">036</FONT>    <a name="line.36"></a>
<FONT color="green">037</FONT>    /**<a name="line.37"></a>
<FONT color="green">038</FONT>     * Thread-safe implementation of map that counts number of keys (like multi-set)<a name="line.38"></a>
<FONT color="green">039</FONT>     * @author ptab<a name="line.39"></a>
<FONT color="green">040</FONT>     *<a name="line.40"></a>
<FONT color="green">041</FONT>     * @param &lt;T&gt;<a name="line.41"></a>
<FONT color="green">042</FONT>     */<a name="line.42"></a>
<FONT color="green">043</FONT>    public class AtomicCounterMap&lt;T&gt; implements CounterMap&lt;T&gt;,HasBeenInstrumented{<a name="line.43"></a>
<FONT color="green">044</FONT>            private final ConcurrentMap&lt;T, AtomicInteger&gt; counters=new ConcurrentHashMap&lt;T, AtomicInteger&gt;();<a name="line.44"></a>
<FONT color="green">045</FONT>            <a name="line.45"></a>
<FONT color="green">046</FONT>            public final void incrementValue(T key, int inc){<a name="line.46"></a>
<FONT color="green">047</FONT>                    AtomicInteger v=counters.get(key);<a name="line.47"></a>
<FONT color="green">048</FONT>                    if(v!=null){<a name="line.48"></a>
<FONT color="green">049</FONT>                            v.addAndGet(inc);<a name="line.49"></a>
<FONT color="green">050</FONT>                    }else{<a name="line.50"></a>
<FONT color="green">051</FONT>                            v=counters.putIfAbsent(key, new AtomicInteger(inc));<a name="line.51"></a>
<FONT color="green">052</FONT>                            if(v!=null)v.addAndGet(inc);                    <a name="line.52"></a>
<FONT color="green">053</FONT>                    }<a name="line.53"></a>
<FONT color="green">054</FONT>            }<a name="line.54"></a>
<FONT color="green">055</FONT>            <a name="line.55"></a>
<FONT color="green">056</FONT>            public final void incrementValue(T key){<a name="line.56"></a>
<FONT color="green">057</FONT>                    //AtomicInteger v=counters.putIfAbsent(key, new AtomicInteger(1));<a name="line.57"></a>
<FONT color="green">058</FONT>                    //return (v!=null)?v.incrementAndGet():1;<a name="line.58"></a>
<FONT color="green">059</FONT>                    AtomicInteger v=counters.get(key);<a name="line.59"></a>
<FONT color="green">060</FONT>                    if(v!=null){<a name="line.60"></a>
<FONT color="green">061</FONT>                            v.incrementAndGet();                    <a name="line.61"></a>
<FONT color="green">062</FONT>                    }else{<a name="line.62"></a>
<FONT color="green">063</FONT>                            v=counters.putIfAbsent(key, new AtomicInteger(1));<a name="line.63"></a>
<FONT color="green">064</FONT>                            if(v!=null)v.incrementAndGet();<a name="line.64"></a>
<FONT color="green">065</FONT>                    }<a name="line.65"></a>
<FONT color="green">066</FONT>            }       <a name="line.66"></a>
<FONT color="green">067</FONT>            <a name="line.67"></a>
<FONT color="green">068</FONT>            public final int getValue(T key){<a name="line.68"></a>
<FONT color="green">069</FONT>                    AtomicInteger v=counters.get(key);<a name="line.69"></a>
<FONT color="green">070</FONT>                    return v==null?0:v.get();<a name="line.70"></a>
<FONT color="green">071</FONT>            }<a name="line.71"></a>
<FONT color="green">072</FONT>            <a name="line.72"></a>
<FONT color="green">073</FONT>            <a name="line.73"></a>
<FONT color="green">074</FONT>            public synchronized  Map&lt;T,Integer&gt; getFinalStateAndCleanIt(){            <a name="line.74"></a>
<FONT color="green">075</FONT>                    Map&lt;T,Integer&gt; res=new LinkedHashMap&lt;T, Integer&gt;();<a name="line.75"></a>
<FONT color="green">076</FONT>                    Iterator&lt;Map.Entry&lt;T, AtomicInteger&gt;&gt; iterator=counters.entrySet().iterator();<a name="line.76"></a>
<FONT color="green">077</FONT>                    while (iterator.hasNext()) {<a name="line.77"></a>
<FONT color="green">078</FONT>                            Map.Entry&lt;T, AtomicInteger&gt; entry=iterator.next();<a name="line.78"></a>
<FONT color="green">079</FONT>                            T key=entry.getKey();<a name="line.79"></a>
<FONT color="green">080</FONT>                            int old=entry.getValue().get();<a name="line.80"></a>
<FONT color="green">081</FONT>                            iterator.remove();<a name="line.81"></a>
<FONT color="green">082</FONT>                            if(old&gt;0){<a name="line.82"></a>
<FONT color="green">083</FONT>                                    res.put(key, old);<a name="line.83"></a>
<FONT color="green">084</FONT>                            }<a name="line.84"></a>
<FONT color="green">085</FONT>                    }               <a name="line.85"></a>
<FONT color="green">086</FONT>                    return res;             <a name="line.86"></a>
<FONT color="green">087</FONT>            }<a name="line.87"></a>
<FONT color="green">088</FONT>            <a name="line.88"></a>
<FONT color="green">089</FONT>            public int getSize(){<a name="line.89"></a>
<FONT color="green">090</FONT>                    return counters.size();<a name="line.90"></a>
<FONT color="green">091</FONT>            }<a name="line.91"></a>
<FONT color="green">092</FONT>    }<a name="line.92"></a>




























































</PRE>
</BODY>
</HTML>