| # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
| # |
| # Copyright 1997-2010 Oracle and/or its affiliates. All rights reserved. |
| # |
| # Oracle and Java are registered trademarks of Oracle and/or its affiliates. |
| # Other names may be trademarks of their respective owners. |
| # |
| # The contents of this file are subject to the terms of either the GNU |
| # General Public License Version 2 only ("GPL") or the Common |
| # Development and Distribution License("CDDL") (collectively, the |
| # "License"). You may not use this file except in compliance with the |
| # License. You can obtain a copy of the License at |
| # http://www.netbeans.org/cddl-gplv2.html |
| # or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the |
| # specific language governing permissions and limitations under the |
| # License. When distributing the software, include this License Header |
| # Notice in each file and include the License file at |
| # nbbuild/licenses/CDDL-GPL-2-CP. Oracle designates this |
| # particular file as subject to the "Classpath" exception as provided |
| # by Oracle in the GPL Version 2 section of the License file that |
| # accompanied this code. If applicable, add the following below the |
| # License Header, with the fields enclosed by brackets [] replaced by |
| # your own identifying information: |
| # "Portions Copyrighted [year] [name of copyright owner]" |
| # |
| # Contributor(s): |
| # |
| # The Original Software is NetBeans. The Initial Developer of the Original |
| # Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun |
| # Microsystems, Inc. All Rights Reserved. |
| # |
| # If you wish your version of this file to be governed by only the CDDL |
| # or only the GPL Version 2, indicate your decision by adding |
| # "[Contributor] elects to include this software in this distribution |
| # under the [CDDL or GPL Version 2] license." If you do not indicate a |
| # single choice of license, a recipient has the option to distribute |
| # your version of this file under either the CDDL, the GPL Version 2 or |
| # to extend the choice of license to its licensees as provided above. |
| # However, if you add GPL Version 2 code and therefore, elected the GPL |
| # Version 2 license, then the option applies only if the new code is |
| # made subject to such option by the copyright holder. |
| |
| FMT_CHM_Record={0}: {1} {2,number} entradas s\u00e3o alocadas para {3,choice,1#'<b>um bucket</b>'|2#{3,number,integer} buckets} |
| LBL_CHM_Desc=HashMaps populados com entradas com hashcode mal distribu\u00eddo |
| LBL_CHM_LongDesc=<html><body>Essa regra verifica <code>HashMap</code>s (<code>Fracos</code>) que foram mal distribu\u00eddos entre os buckets alocados, conforme a ilustra\u00e7\u00e3o: <br><img src='res/wrongmap.png'><br> Isso pode ser causado por uma m\u00e1 implementa\u00e7\u00e3o de m\u00e9todos <code>hashcode()</code> ou <code>equals()</code> dos objetos usados como teclas mapeadas</body></html> |
| LBL_CHM_Name=HashMaps Contra\u00eddos (Fracos) |
| # Shared entry |
| LBL_ClassName=Nome da classe: |
| |
| |
| LBL_DS_Name=Tamanho do alcance |
| LBL_DS_Desc=Calcula o tamanho da profundidade de todas as inst\u00e2ncias de determinada classe. |
| LBL_DS_LongDesc=<html><body>Calcula o tamanho do alcance (profundo) de todas as inst\u00e2ncias de determinada classe.</body></html> |
| LBL_DS_ResHeader=<h2>Tamanho ating\u00edvel (todas as inst\u00e2ncias de {0})</h2> |
| |
| LBL_DupStr_Name=Strings Duplicadas |
| LBL_DupStr_Desc=Localizar duplicatas de Strings e medir seu custo |
| LBL_DupStr_LongDesc=<html><body>Calcula a mem\u00f3ria total gasta pelas <code>String</code>s duplicadas e tenta identificar seus referenciais.</body></html> |
| FMT_DupStr_Result=<b>Desperd\u00edcio total: {0}B</b>, distribu\u00eddo pela fonte do dom\u00ednio:<br> |
| |
| LBL_HMH_Name=Histogramas HashMap |
| LBL_HMH_Desc=Examina todas as inst\u00e2ncias HashMap e imprime as estat\u00edsticas de uso. |
| LBL_HMH_LongDesc=<html><body>Calcula a mem\u00f3ria usada pelas estruturas <code>HashMap</code> e <code>String</code>s referenciadas a partir dos <code>HashMap</code>s.</body></html> |
| |
| LBL_OverStr_Name=Strings Superalocadas |
| LBL_OverStr_Desc=Cobre os resultados de longa vida da String.substring(), calcula a quantidade de mem\u00f3ria desperdi\u00e7ada |
| LBL_OverStr_LongDesc=<html><body>Calcula a sobrecarga das <code>String</code>s que t\u00eam backing <code>char[]</code> maior que o necess\u00e1rio (por exemplo, resultado de <code>String.substring()</code>).</body></html> |
| FMT_OverStr_Result=<b>Desperdi\u00e7ado {0}B</b> nas Strings superalocadas<br> |
| |
| LBL_RSBC_Name=Conjuntos retidos por histogramas de classe |
| LBL_RSBC_Desc=Imprime o histograma do conjunto retido mantido por cada classe |
| LBL_RSBC_LongDesc=<html><body><b>Advert\u00eancia!</b><br><br>Essa regra leva muito tempo para ser calculada e pode usar uma grande quantidade de mem\u00f3ria em grandes heaps!</body></html> |
| |
| LBL_RSBI_Name=Histogramas de conjuntos retidos |
| LBL_RSBI_Desc=Imprime o histograma do conjunto retido mantido por inst\u00e2ncias da classe |
| LBL_RSBI_LongDesc=<html><body>Calcula o conjunto retido para cada inst\u00e2ncia de determinada classe.</body></html> |
| |
| LBL_TMB_Name=Muitos Boolianos |
| LBL_TMB_Desc=Verifica inst\u00e2ncias de Boolianos apenas para Boolean.TRUE e Boolean.FALSE |
| LBL_TMB_LongDesc=<html><body>Verifica se h\u00e1 mais de duas inst\u00e2ncias de <code>Booliano</code> no heap (somente <code>Boolean.TRUE</code> e <code>Boolean.FALSE</code> s\u00e3o necess\u00e1rios).</body></html> |
| FMT_TMB_Result=Existem {0} inst\u00e2ncias Boolianas desperdi\u00e7ando {1}B<br> |
| FMT_TMB_ResultOK=N\u00e3o existem mais de duas inst\u00e2ncias Boolianas: OK |
| |
| |
| LBL_WWHM_Name=Vazando WeakHashMap |
| LBL_WWHM_Desc=WeakHashMap com valores referenciando totalmente as chaves |
| LBL_WWHM_LongDesc=<html><body>Identifica os <code>WeakHashMap</code>s usados inapropriadamente onde um valor referencia consistentemente sua chave.</body></html> |
| FMT_WWHM_Entry={0}: {1} est\u00e1 incorreto: a chave {2} est\u00e1 ao alcance do valor {3}<br> |
| |
