SimpleMapCounter.java
/*
** Module : SimpleMapCounter.java
** Abstract : MBean supporting counting
**
** Copyright (c) 2020-2024, Golden Code Development Corporation.
**
** -#- -I- --Date-- ---------------------------------Description----------------------------------
** 001 HC 20201010 Created initial version.
** 002 HC 20240103 Added map counts. The map counter now accumulates counts and the provided values.
*/
/*
** This program is free software: you can redistribute it and/or modify
** it under the terms of the GNU Affero General Public License as
** published by the Free Software Foundation, either version 3 of the
** License, or (at your option) any later version.
**
** This program is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
** GNU Affero General Public License for more details.
**
** You may find a copy of the GNU Affero GPL version 3 at the following
** location: https://www.gnu.org/licenses/agpl-3.0.en.html
**
** Additional terms under GNU Affero GPL version 3 section 7:
**
** Under Section 7 of the GNU Affero GPL version 3, the following additional
** terms apply to the works covered under the License. These additional terms
** are non-permissive additional terms allowed under Section 7 of the GNU
** Affero GPL version 3 and may not be removed by you.
**
** 0. Attribution Requirement.
**
** You must preserve all legal notices or author attributions in the covered
** work or Appropriate Legal Notices displayed by works containing the covered
** work. You may not remove from the covered work any author or developer
** credit already included within the covered work.
**
** 1. No License To Use Trademarks.
**
** This license does not grant any license or rights to use the trademarks
** Golden Code, FWD, any Golden Code or FWD logo, or any other trademarks
** of Golden Code Development Corporation. You are not authorized to use the
** name Golden Code, FWD, or the names of any author or contributor, for
** publicity purposes without written authorization.
**
** 2. No Misrepresentation of Affiliation.
**
** You may not represent yourself as Golden Code Development Corporation or FWD.
**
** You may not represent yourself for publicity purposes as associated with
** Golden Code Development Corporation, FWD, or any author or contributor to
** the covered work, without written authorization.
**
** 3. No Misrepresentation of Source or Origin.
**
** You may not represent the covered work as solely your work. All modified
** versions of the covered work must be marked in a reasonable way to make it
** clear that the modified work is not originating from Golden Code Development
** Corporation or FWD. All modified versions must contain the notices of
** attribution required in this license.
*/
package com.goldencode.p2j.jmx;
import java.util.*;
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
/** MBean supporting counting */
public class SimpleMapCounter
extends SimpleLongCounter
implements SimpleMapCounterMBean,
MapCounter
{
/** Accumulated counts */
private Map<String, AtomicLong> mapCounts = new ConcurrentHashMap<>();
/** Accumulated values */
private Map<String, AtomicLong> mapValues = new ConcurrentHashMap<>();
/**
* {@inheritDoc}
*/
@Override
public void update(String valueName, long value)
{
mapCounts.computeIfAbsent(valueName, k -> new AtomicLong(0)).incrementAndGet();
mapValues.computeIfAbsent(valueName, k -> new AtomicLong(0)).addAndGet(value);
super.update(value);
}
/**
* Returns accumulated counts.
*
* @return See above.
*/
@Override
public Map<String, Long> getMapCounts()
{
return getValues(mapCounts);
}
/**
* Returns accumulated values.
*
* @return See above.
*/
@Override
public Map<String, Long> getMapValues()
{
return getValues(mapValues);
}
/**
* Returns accumulated values.
*
* @param inValues
* The values to process.
*
* @return See above.
*/
private Map<String, Long> getValues(Map<String, AtomicLong> inValues)
{
Map<Long, List<String>> sortedMap = new TreeMap<>();
for (Map.Entry<String, AtomicLong> e : inValues.entrySet())
{
List<String> values = sortedMap.get(e.getValue().get());
if (values == null)
{
values = new ArrayList<>();
sortedMap.put(e.getValue().get(), values);
}
values.add(e.getKey());
}
Map<String, Long> result = new LinkedHashMap<>();
for (Map.Entry<Long, List<String>> e : sortedMap.entrySet())
{
for (String name : e.getValue())
{
result.put(name, e.getKey());
}
}
return result;
}
@Override
/**
* Reset counters
*/
public void reset()
{
mapCounts.clear();
mapValues.clear();
super.reset();
}
}