⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 histogramdataset.html

📁 jfreechart1。0。2的api。
💻 HTML
📖 第 1 页 / 共 3 页
字号:
<HTML><BODY BGCOLOR="white"><PRE><FONT color="green">001</FONT>    /* ===========================================================<a name="line.1"></a><FONT color="green">002</FONT>     * JFreeChart : a free chart library for the Java(tm) platform<a name="line.2"></a><FONT color="green">003</FONT>     * ===========================================================<a name="line.3"></a><FONT color="green">004</FONT>     *<a name="line.4"></a><FONT color="green">005</FONT>     * (C) Copyright 2000-2006, by Object Refinery Limited and Contributors.<a name="line.5"></a><FONT color="green">006</FONT>     *<a name="line.6"></a><FONT color="green">007</FONT>     * Project Info:  http://www.jfree.org/jfreechart/index.html<a name="line.7"></a><FONT color="green">008</FONT>     *<a name="line.8"></a><FONT color="green">009</FONT>     * This library is free software; you can redistribute it and/or modify it <a name="line.9"></a><FONT color="green">010</FONT>     * under the terms of the GNU Lesser General Public License as published by <a name="line.10"></a><FONT color="green">011</FONT>     * the Free Software Foundation; either version 2.1 of the License, or <a name="line.11"></a><FONT color="green">012</FONT>     * (at your option) any later version.<a name="line.12"></a><FONT color="green">013</FONT>     *<a name="line.13"></a><FONT color="green">014</FONT>     * This library is distributed in the hope that it will be useful, but <a name="line.14"></a><FONT color="green">015</FONT>     * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY <a name="line.15"></a><FONT color="green">016</FONT>     * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public <a name="line.16"></a><FONT color="green">017</FONT>     * License for more details.<a name="line.17"></a><FONT color="green">018</FONT>     *<a name="line.18"></a><FONT color="green">019</FONT>     * You should have received a copy of the GNU Lesser General Public<a name="line.19"></a><FONT color="green">020</FONT>     * License along with this library; if not, write to the Free Software<a name="line.20"></a><FONT color="green">021</FONT>     * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, <a name="line.21"></a><FONT color="green">022</FONT>     * USA.  <a name="line.22"></a><FONT color="green">023</FONT>     *<a name="line.23"></a><FONT color="green">024</FONT>     * [Java is a trademark or registered trademark of Sun Microsystems, Inc. <a name="line.24"></a><FONT color="green">025</FONT>     * in the United States and other countries.]<a name="line.25"></a><FONT color="green">026</FONT>     *<a name="line.26"></a><FONT color="green">027</FONT>     * ---------------------<a name="line.27"></a><FONT color="green">028</FONT>     * HistogramDataset.java<a name="line.28"></a><FONT color="green">029</FONT>     * ---------------------<a name="line.29"></a><FONT color="green">030</FONT>     * (C) Copyright 2003-2006, by Jelai Wang and Contributors.<a name="line.30"></a><FONT color="green">031</FONT>     *<a name="line.31"></a><FONT color="green">032</FONT>     * Original Author:  Jelai Wang (jelaiw AT mindspring.com);<a name="line.32"></a><FONT color="green">033</FONT>     * Contributor(s):   David Gilbert (for Object Refinery Limited);<a name="line.33"></a><FONT color="green">034</FONT>     *                   Cameron Hayne;<a name="line.34"></a><FONT color="green">035</FONT>     *                   Rikard Bj?rklind;<a name="line.35"></a><FONT color="green">036</FONT>     *<a name="line.36"></a><FONT color="green">037</FONT>     * $Id: HistogramDataset.java,v 1.9.2.6 2006/08/03 10:37:53 mungady Exp $<a name="line.37"></a><FONT color="green">038</FONT>     *<a name="line.38"></a><FONT color="green">039</FONT>     * Changes<a name="line.39"></a><FONT color="green">040</FONT>     * -------<a name="line.40"></a><FONT color="green">041</FONT>     * 06-Jul-2003 : Version 1, contributed by Jelai Wang (DG);<a name="line.41"></a><FONT color="green">042</FONT>     * 07-Jul-2003 : Changed package and added Javadocs (DG);<a name="line.42"></a><FONT color="green">043</FONT>     * 15-Oct-2003 : Updated Javadocs and removed array sorting (JW);<a name="line.43"></a><FONT color="green">044</FONT>     * 09-Jan-2004 : Added fix by "Z." posted in the JFreeChart forum (DG);<a name="line.44"></a><FONT color="green">045</FONT>     * 01-Mar-2004 : Added equals() and clone() methods and implemented <a name="line.45"></a><FONT color="green">046</FONT>     *               Serializable.  Also added new addSeries() method (DG);<a name="line.46"></a><FONT color="green">047</FONT>     * 06-May-2004 : Now extends AbstractIntervalXYDataset (DG);<a name="line.47"></a><FONT color="green">048</FONT>     * 15-Jul-2004 : Switched getX() with getXValue() and getY() with <a name="line.48"></a><FONT color="green">049</FONT>     *               getYValue() (DG);<a name="line.49"></a><FONT color="green">050</FONT>     * 20-May-2005 : Speed up binning - see patch 1026151 contributed by Cameron<a name="line.50"></a><FONT color="green">051</FONT>     *               Hayne (DG);<a name="line.51"></a><FONT color="green">052</FONT>     * 08-Jun-2005 : Fixed bug in getSeriesKey() method (DG);<a name="line.52"></a><FONT color="green">053</FONT>     * 22-Nov-2005 : Fixed cast in getSeriesKey() method - see patch 1329287 (DG);<a name="line.53"></a><FONT color="green">054</FONT>     * ------------- JFREECHART 1.0.0 ---------------------------------------------<a name="line.54"></a><FONT color="green">055</FONT>     * 03-Aug-2006 : Improved precision of bin boundary calculation (DG);<a name="line.55"></a><FONT color="green">056</FONT>     * <a name="line.56"></a><FONT color="green">057</FONT>     */<a name="line.57"></a><FONT color="green">058</FONT>    <a name="line.58"></a><FONT color="green">059</FONT>    package org.jfree.data.statistics;<a name="line.59"></a><FONT color="green">060</FONT>    <a name="line.60"></a><FONT color="green">061</FONT>    import java.io.Serializable;<a name="line.61"></a><FONT color="green">062</FONT>    import java.util.ArrayList;<a name="line.62"></a><FONT color="green">063</FONT>    import java.util.HashMap;<a name="line.63"></a><FONT color="green">064</FONT>    import java.util.List;<a name="line.64"></a><FONT color="green">065</FONT>    import java.util.Map;<a name="line.65"></a><FONT color="green">066</FONT>    <a name="line.66"></a><FONT color="green">067</FONT>    import org.jfree.data.general.DatasetChangeEvent;<a name="line.67"></a><FONT color="green">068</FONT>    import org.jfree.data.xy.AbstractIntervalXYDataset;<a name="line.68"></a><FONT color="green">069</FONT>    import org.jfree.data.xy.IntervalXYDataset;<a name="line.69"></a><FONT color="green">070</FONT>    import org.jfree.util.ObjectUtilities;<a name="line.70"></a><FONT color="green">071</FONT>    import org.jfree.util.PublicCloneable;<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>     * A dataset that can be used for creating histograms.<a name="line.74"></a><FONT color="green">075</FONT>     * <a name="line.75"></a><FONT color="green">076</FONT>     * @see SimpleHistogramDataset<a name="line.76"></a><FONT color="green">077</FONT>     */<a name="line.77"></a><FONT color="green">078</FONT>    public class HistogramDataset extends AbstractIntervalXYDataset <a name="line.78"></a><FONT color="green">079</FONT>                                  implements IntervalXYDataset, <a name="line.79"></a><FONT color="green">080</FONT>                                             Cloneable, PublicCloneable, <a name="line.80"></a><FONT color="green">081</FONT>                                             Serializable {<a name="line.81"></a><FONT color="green">082</FONT>    <a name="line.82"></a><FONT color="green">083</FONT>        /** For serialization. */<a name="line.83"></a><FONT color="green">084</FONT>        private static final long serialVersionUID = -6341668077370231153L;<a name="line.84"></a><FONT color="green">085</FONT>        <a name="line.85"></a><FONT color="green">086</FONT>        /** A list of maps. */<a name="line.86"></a><FONT color="green">087</FONT>        private List list;<a name="line.87"></a><FONT color="green">088</FONT>        <a name="line.88"></a><FONT color="green">089</FONT>        /** The histogram type. */<a name="line.89"></a><FONT color="green">090</FONT>        private HistogramType type;<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><FONT color="green">093</FONT>         * Creates a new (empty) dataset with a default type of <a name="line.93"></a><FONT color="green">094</FONT>         * {@link HistogramType}.FREQUENCY.<a name="line.94"></a><FONT color="green">095</FONT>         */<a name="line.95"></a><FONT color="green">096</FONT>        public HistogramDataset() {<a name="line.96"></a><FONT color="green">097</FONT>            this.list = new ArrayList();<a name="line.97"></a><FONT color="green">098</FONT>            this.type = HistogramType.FREQUENCY;<a name="line.98"></a><FONT color="green">099</FONT>        }<a name="line.99"></a><FONT color="green">100</FONT>        <a name="line.100"></a><FONT color="green">101</FONT>        /**<a name="line.101"></a><FONT color="green">102</FONT>         * Returns the histogram type. <a name="line.102"></a><FONT color="green">103</FONT>         * <a name="line.103"></a><FONT color="green">104</FONT>         * @return The type (never &lt;code&gt;null&lt;/code&gt;).<a name="line.104"></a><FONT color="green">105</FONT>         */<a name="line.105"></a><FONT color="green">106</FONT>        public HistogramType getType() { <a name="line.106"></a><FONT color="green">107</FONT>            return this.type; <a name="line.107"></a><FONT color="green">108</FONT>        }<a name="line.108"></a><FONT color="green">109</FONT>    <a name="line.109"></a><FONT color="green">110</FONT>        /**<a name="line.110"></a><FONT color="green">111</FONT>         * Sets the histogram type and sends a {@link DatasetChangeEvent} to all <a name="line.111"></a><FONT color="green">112</FONT>         * registered listeners.<a name="line.112"></a><FONT color="green">113</FONT>         * <a name="line.113"></a><FONT color="green">114</FONT>         * @param type  the type (&lt;code&gt;null&lt;/code&gt; not permitted).<a name="line.114"></a><FONT color="green">115</FONT>         */<a name="line.115"></a><FONT color="green">116</FONT>        public void setType(HistogramType type) {<a name="line.116"></a><FONT color="green">117</FONT>            if (type == null) {<a name="line.117"></a><FONT color="green">118</FONT>                throw new IllegalArgumentException("Null 'type' argument");<a name="line.118"></a><FONT color="green">119</FONT>            }<a name="line.119"></a><FONT color="green">120</FONT>            this.type = type;   <a name="line.120"></a><FONT color="green">121</FONT>            notifyListeners(new DatasetChangeEvent(this, this));<a name="line.121"></a><FONT color="green">122</FONT>        }<a name="line.122"></a><FONT color="green">123</FONT>    <a name="line.123"></a><FONT color="green">124</FONT>        /**<a name="line.124"></a><FONT color="green">125</FONT>         * Adds a series to the dataset, using the specified number of bins.<a name="line.125"></a><FONT color="green">126</FONT>         * <a name="line.126"></a><FONT color="green">127</FONT>         * @param key  the series key (&lt;code&gt;null&lt;/code&gt; not permitted).<a name="line.127"></a><FONT color="green">128</FONT>         * @param values the values (&lt;code&gt;null&lt;/code&gt; not permitted).<a name="line.128"></a><FONT color="green">129</FONT>         * @param bins  the number of bins (must be at least 1).<a name="line.129"></a><FONT color="green">130</FONT>         */<a name="line.130"></a><FONT color="green">131</FONT>        public void addSeries(Comparable key, double[] values, int bins) {<a name="line.131"></a><FONT color="green">132</FONT>            // defer argument checking...<a name="line.132"></a><FONT color="green">133</FONT>            double minimum = getMinimum(values);<a name="line.133"></a><FONT color="green">134</FONT>            double maximum = getMaximum(values);<a name="line.134"></a><FONT color="green">135</FONT>            addSeries(key, values, bins, minimum, maximum);<a name="line.135"></a><FONT color="green">136</FONT>        }<a name="line.136"></a><FONT color="green">137</FONT>    <a name="line.137"></a><FONT color="green">138</FONT>        /**<a name="line.138"></a><FONT color="green">139</FONT>         * Adds a series to the dataset. Any data value less than minimum will be<a name="line.139"></a><FONT color="green">140</FONT>         * assigned to the first bin, and any data value greater than maximum will<a name="line.140"></a><FONT color="green">141</FONT>         * be assigned to the last bin.  Values falling on the boundary of <a name="line.141"></a><FONT color="green">142</FONT>         * adjacent bins will be assigned to the higher indexed bin.<a name="line.142"></a><FONT color="green">143</FONT>         * <a name="line.143"></a><FONT color="green">144</FONT>         * @param key  the series key (&lt;code&gt;null&lt;/code&gt; not permitted).<a name="line.144"></a><FONT color="green">145</FONT>         * @param values  the raw observations.<a name="line.145"></a><FONT color="green">146</FONT>         * @param bins  the number of bins (must be at least 1).<a name="line.146"></a><FONT color="green">147</FONT>         * @param minimum  the lower bound of the bin range.<a name="line.147"></a><FONT color="green">148</FONT>         * @param maximum  the upper bound of the bin range.<a name="line.148"></a><FONT color="green">149</FONT>         */<a name="line.149"></a><FONT color="green">150</FONT>        public void addSeries(Comparable key, <a name="line.150"></a><FONT color="green">151</FONT>                              double[] values, <a name="line.151"></a><FONT color="green">152</FONT>                              int bins, <a name="line.152"></a><FONT color="green">153</FONT>                              double minimum, <a name="line.153"></a><FONT color="green">154</FONT>                              double maximum) {<a name="line.154"></a><FONT color="green">155</FONT>            <a name="line.155"></a><FONT color="green">156</FONT>            if (key == null) {<a name="line.156"></a><FONT color="green">157</FONT>                throw new IllegalArgumentException("Null 'key' argument.");   <a name="line.157"></a><FONT color="green">158</FONT>            }<a name="line.158"></a><FONT color="green">159</FONT>            if (values == null) {<a name="line.159"></a><FONT color="green">160</FONT>                throw new IllegalArgumentException("Null 'values' argument.");<a name="line.160"></a><FONT color="green">161</FONT>            }<a name="line.161"></a><FONT color="green">162</FONT>            else if (bins &lt; 1) {<a name="line.162"></a><FONT color="green">163</FONT>                throw new IllegalArgumentException(<a name="line.163"></a><FONT color="green">164</FONT>                        "The 'bins' value must be at least 1.");<a name="line.164"></a><FONT color="green">165</FONT>            }<a name="line.165"></a><FONT color="green">166</FONT>            double binWidth = (maximum - minimum) / bins;<a name="line.166"></a><FONT color="green">167</FONT>    <a name="line.167"></a><FONT color="green">168</FONT>            double lower = minimum;<a name="line.168"></a><FONT color="green">169</FONT>            double upper;<a name="line.169"></a><FONT color="green">170</FONT>            List binList = new ArrayList(bins);<a name="line.170"></a><FONT color="green">171</FONT>            for (int i = 0; i &lt; bins; i++) {<a name="line.171"></a><FONT color="green">172</FONT>                HistogramBin bin;<a name="line.172"></a><FONT color="green">173</FONT>                // make sure bins[bins.length]'s upper boundary ends at maximum<a name="line.173"></a><FONT color="green">174</FONT>                // to avoid the rounding issue. the bins[0] lower boundary is<a name="line.174"></a><FONT color="green">175</FONT>                // guaranteed start from min<a name="line.175"></a><FONT color="green">176</FONT>                if (i == bins - 1) {<a name="line.176"></a><FONT color="green">177</FONT>                    bin = new HistogramBin(lower, maximum);<a name="line.177"></a><FONT color="green">178</FONT>                }<a name="line.178"></a><FONT color="green">179</FONT>                else {<a name="line.179"></a><FONT color="green">180</FONT>                    upper = minimum + (i + 1) * binWidth;<a name="line.180"></a><FONT color="green">181</FONT>                    bin = new HistogramBin(lower, upper);<a name="line.181"></a><FONT color="green">182</FONT>                    lower = upper;<a name="line.182"></a><FONT color="green">183</FONT>                }<a name="line.183"></a><FONT color="green">184</FONT>                binList.add(bin);<a name="line.184"></a>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -