C++从 Java 角度设置和映射内存管理



我来自Java背景。(哈希-)地图和集合是我在工作过程中每天处理的内容。当涉及到C++(或一般的手动管理内存)时,我想知道如何正确使用它们。

根据定义,将对象添加到集合/映射时,仅当其中尚不存在标识符时,才会添加该对象。因此,调用Add()/Put()的函数在添加对象后不得销毁对象(否则损坏的指针将保留在集合中),如果未添加它,则必须销毁它,因为在集合中找到了相等的对象(或者将存在内存泄漏),如果在集合中找到恰好是尝试的对象的相等对象,则不得销毁它来补充。创建深层副本实际上是不可能的(或者我不清楚如何),因为在我的情况下,数据对象可能会递归地相互依赖。

当从集合中获取子集(假设包含 foos 和柱线的集合中的所有柱线)并且原始集合被解除分配时,必须释放所有 foos,而子集中包含的柱线不得释放。如果集合被释放,则必须释放它们,但前提是它们不再在任何其他集合中使用。如果一组长柱线也从原始集合派生而来,而这组柱线不知道,甚至可能在不同的线程中,该怎么办?

为了说明这个问题,下面是 Java 中的一个最小示例,用于管理内存中链接数据的小记录。下面的main()方法显示了它的一些用例可能性。

interface IObject { }
interface INode extends IObject { }
interface IIdentifiable extends IObject {
String m_csSubject();
}
class CLiteral implements IObject {
private String m_csValue;
CLiteral(String csValue) { m_csValue = csValue; }
String m_csValue() { return m_csValue; }
public int hashCode() {
return 31 * 1 + ((m_csValue == null) ? 0 : m_csValue.hashCode());
}
public boolean equals(Object cObject) {
if (this == cObject) return true;
if (cObject == null) return false;
if (getClass() != cObject.getClass()) return false;
CLiteral cOther = (CLiteral) cObject;
if (m_csValue == null) {
if (cOther.m_csValue != null) return false;
} else if (!m_csValue.equals(cOther.m_csValue)) return false;
return true;
}
}
class CLangString extends CLiteral {
private final String m_csLanguage;
CLangString(String csValue, String csLanguage) {
super(csValue);
m_csLanguage = csLanguage;
}
public int hashCode() {
return 31 * super.hashCode() + ((m_csLanguage == null) ? 0 : m_csLanguage.hashCode());
}
public boolean equals(Object cObject) {
if (this == cObject) return true;
if (!super.equals(cObject)) return false;
if (getClass() != cObject.getClass()) return false;
CLangString cOther = (CLangString) cObject;
if (m_csLanguage == null) {
if (cOther.m_csLanguage != null) return false;
} else if (!m_csLanguage.equals(cOther.m_csLanguage)) return false;
return true;
}
}
class CLink implements IIdentifiable, INode {
private String m_csSubject;
CLink(String csSubject) { m_csSubject = csSubject; }
public String m_csSubject() { return m_csSubject; }
public int hashCode() {
return 31 * 1 + ((m_csSubject == null) ? 0 : m_csSubject.hashCode());
}
public boolean equals(Object cObject) {
if (this == cObject) return true;
if (cObject == null) return false;
if (getClass() != cObject.getClass()) return false;
CLink cOther = (CLink) cObject;
if (m_csSubject == null) {
if (cOther.m_csSubject != null) return false;
} else if (!m_csSubject.equals(cOther.m_csSubject)) return false;
return true;
}
}
import java.util.*;
import java.util.Map.Entry;
class CNode implements INode {
static final String m_csTYPE = "http://www.w3.org/1999/02/22-rdf-syntax-ns#type";
final Map<String, Collection<IObject>> m_cEdges = new HashMap<>();
CNode() { }
CNode(CLink cType) { put(m_csTYPE, cType); }
CNode(String csType) { this(new CLink(csType)); }
CResult get(String csPredicate) {
CResult cResult = new CResult();
cResult.addAll(m_cEdges.get(csPredicate));
return cResult;
}
CResult getById(String csPredicate, String csIdPredicate, String csIdValue) {
CResult cResult = new CResult();
for (Entry<String, Collection<IObject>> cEntry : m_cEdges.entrySet())
for (IObject cValue : cEntry.getValue())
if (cValue instanceof CNode) {
CNode cNode = (CNode) cValue;
if (cNode.hasType(csPredicate) && cNode.get(csIdPredicate).Strings().contains(csIdValue))
cResult.add(cNode);
}
return cResult;
}
boolean hasType(String csType) {
for (IIdentifiable cIdentifiable : get(m_csTYPE).iIdentifiables())
if (csType.equals(cIdentifiable.m_csSubject())) return true;
return false;
}
<T extends CNode> T put(String csPredicate, IObject cObject) {
Collection<IObject> cObjects = m_cEdges.get(csPredicate);
if (cObjects == null) m_cEdges.put(csPredicate, cObjects = new HashSet<>());
cObjects.add(cObject);
return (T) this;
}
}
class CNamedNode extends CNode implements IIdentifiable {
private String m_csSubject;
CNamedNode(String csSubject, CLink cType) {
super(cType);
m_csSubject = csSubject;
}
public String m_csSubject() { return m_csSubject; }
public int hashCode() {
return 31 * 1 + ((m_csSubject == null) ? 0 : m_csSubject.hashCode());
}
public boolean equals(Object cObject) {
if (this == cObject) return true;
if (cObject == null) return false;
if (getClass() != cObject.getClass()) return false;
CNamedNode cOther = (CNamedNode) cObject;
if (m_csSubject == null) {
if (cOther.m_csSubject != null) return false;
} else if (!m_csSubject.equals(cOther.m_csSubject)) return false;
return true;
}
}
import java.util.*;
class CResult extends HashSet<IObject> {
Set<CNamedNode> CNamedNodes() {
Set<CNamedNode> cResult = new HashSet<>();
for (IObject cMember : this)
if (cMember instanceof CNamedNode) cResult.add((CNamedNode) cMember);
return cResult;
}
Set<CNode> CNodes() {
Set<CNode> cResult = new HashSet<>();
for (IObject cMember : this)
if (cMember instanceof CNode) cResult.add((CNode) cMember);
return cResult;
}
Set<IIdentifiable> iIdentifiables() {
Set<IIdentifiable> cResult = new HashSet<>();
for (IObject cMember : this)
if (cMember instanceof IIdentifiable) cResult.add((IIdentifiable) cMember);
return cResult;
}
boolean IsAnyIdentifiable() {
boolean bResult = false;
for (IObject cMember : this) if (cMember instanceof IIdentifiable) return true;
return bResult;
}
String String() {
StringBuilder cResult = new StringBuilder();
boolean bFirst = true;
for (String csString : Strings()) {
if(bFirst) bFirst = false; else cResult.append(", ");
cResult.append(csString);
}
return cResult.toString();
}
Set<String> Strings() {
Set<String> cResult = new HashSet<>();
for (IObject cMember : this)
if (cMember instanceof CLiteral) cResult.add(((CLiteral) cMember).m_csValue());
return cResult;
}
}
public static void main(String[] args) {
final String m_csNS = "http://animalShelter.example/";
CResult cDogs;
CResult cFidos;
{
CNode cShelter = new CNode(m_csNS + "AnimalShelter");
cShelter.put(
m_csNS + "hasDog",
new CNode(new CLink(m_csNS + "Dog"))
.put(m_csNS + "hasName", new CLangString("Fido", "en"))
.put(m_csNS + "residence", cShelter)
);
cShelter.put(
m_csNS + "hasDog",
new CNamedNode(
"http://en.wikipedia.org/wiki/Scooby-Doo_(character)", new CLink(m_csNS + "Dog")
)
.put(m_csNS + "hasName", new CLangString("Scoobert "Scooby" Doo", "en"))
.put(m_csNS + "residence", cShelter)
);
cDogs = cShelter.get(m_csNS + "hasDog");
cFidos = cShelter.getById(m_csNS + "Dog", m_csNS + "hasName", "Fido");
}
if(!cDogs.isEmpty()){
System.out.println("No. of dogs: " + cDogs.size());
}
if (cDogs.IsAnyIdentifiable()) {
System.out.println("Famous dogs:");
for (CNamedNode cWellKnownDog : cDogs.CNamedNodes()) {
System.out.println("- " + cWellKnownDog.get(m_csNS + "hasName").String() + " ("
+ cWellKnownDog.m_csSubject() + ')');
}
}
if(!cFidos.isEmpty()){
System.out.println(cFidos.CNodes().size() + " dog(s) called Fido.");
}
}

如何执行此操作C++?如何在数据模型类中实现对象销毁,以使使用它的函数(在这种情况下main())不(或至少可能)关心模型的内部

插入到C++哈希映射/集合(std::unordered_mapstd::unordered_set)是通过制作副本来完成的。这应该是您的默认选择。不要试图像写Java那样写C++。

如果要避免深度复制,则地图/集可能包含指向对象的原始指针,但对象的生存期是单独维护的(例如,在std::vector中)。

但是,可能有理由想要更多类似Java的语义。例如,也许您希望映射/集拥有多态类型。在这种情况下,您可能需要智能指针。最好拥有唯一的所有权(只有一个智能指针拥有每个对象),在这种情况下,您可以使用std::unique_ptr或者如果您必须拥有共享所有权,请使用std::shared_ptr。这两种智能指针都可以存储在std::unordered_mapstd::unordered_set中,并且应该具有大致预期的语义。

最新更新