📄 weakreference.java
字号:
/* java.lang.ref.WeakReference Copyright (C) 1999 Free Software Foundation, Inc.This file is part of GNU Classpath.GNU Classpath is free software; you can redistribute it and/or modifyit under the terms of the GNU General Public License as published bythe Free Software Foundation; either version 2, or (at your option)any later version. GNU Classpath is distributed in the hope that it will be useful, butWITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNUGeneral Public License for more details.You should have received a copy of the GNU General Public Licensealong with GNU Classpath; see the file COPYING. If not, write to theFree Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA02111-1307 USA.Linking this library statically or dynamically with other modules ismaking a combined work based on this library. Thus, the terms andconditions of the GNU General Public License cover the wholecombination.As a special exception, the copyright holders of this library give youpermission to link this library with independent modules to produce anexecutable, regardless of the license terms of these independentmodules, and to copy and distribute the resulting executable underterms of your choice, provided that you also meet, for each linkedindependent module, the terms and conditions of the license of thatmodule. An independent module is a module which is not derived fromor based on this library. If you modify this library, you may extendthis exception to your version of the library, but you are notobligated to do so. If you do not wish to do so, delete thisexception statement from your version. */package java.lang.ref;/** * A weak reference will be cleared, if the object is only weakly * reachable. It is useful for lookup tables, where you aren't * interested in an entry, if the key isn't reachable anymore. * <code>WeakHashtable</code> is a complete implementation of such a * table. <br> * * It is also useful to make objects unique: You create a set of weak * references to those objects, and when you create a new object you * look in this set, if the object already exists and return it. If * an object is not referenced anymore, the reference will * automatically cleared, and you may remove it from the set. <br> * * @author Jochen Hoenicke * @see java.util.WeakHashtable */public class WeakReference extends Reference{ /** * Create a new weak reference, that is not registered to any queue. * @param referent the object we refer to. */ public WeakReference(Object referent) { super(referent); } /** * Create a new weak reference. * @param referent the object we refer to. * @param q the reference queue to register on. * @exception NullPointerException if q is null. */ public WeakReference(Object referent, ReferenceQueue q) { super(referent, q); }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -