search for: erase

...kages Altered: Updated firefox-45.7.0-1.el6.centos.x86_64 @updates Update 45.7.0-2.el6.centos.x86_64 @updates Updated gnome-settings-daemon-2.28.2-35.el6.x86_64 @base Update 2.28.2-35.el6_8.2.x86_64 @updates Erase initscripts-9.03.53-1.el6.centos.1.x86_64 @updates Erase kernel-2.6.32-642.4.2.el6.x86_64 @updates Erase kernel-firmware-2.6.32-642.13.1.el6.noarch @updates Updated kernel-headers-2.6.32-642.13.1.el6.x86_64 @updates Update...

Hi all, I updated from 2.2 to the latest SVN head and I now get a debug assert in BranchFolder::RemoveBlocksWithHash: "vector iterators incompatible". I'm using Visual C++ 2005. I think this is the culprit code: MergePotentials.erase(CurMPIter); if (CurMPIter==B) break; The erase clears the _Mycont field (i.e. the iterator's container), while the == expects CurMPIter and B to have the same container. I'm no STL guru but it seems wrong to first erase an element and then try to compare it. I traced it bac...

...n take days. The disk in question might even have been corrupted. This would make using 'zpool destroy' to clear out a ZFS disk, or I've tried erasing the first megabyte of the disk, but there are ZFS or LVM structures that get in the way. So, does anyone have an efficient way to erase structures from a disk such that it can be reused? Something like -erase first N blocks (block defined as 4096) - Erase <number> blocks starting at block <number> - erase last <number> blocks At least such an algorithm would be quicker than erasing 8 TB of data. David

...icolas Capens wrote: > Hi all, > > I updated from 2.2 to the latest SVN head and I now get a debug > assert in BranchFolder::RemoveBlocksWithHash: “vector iterators > incompatible”. I’m using Visual C++ 2005. I think this is the > culprit code: > > MergePotentials.erase(CurMPIter); > if (CurMPIter==B) > break; > > The erase clears the _Mycont field (i.e. the iterator’s container), > while the == expects CurMPIter and B to have the same container. I’m > no STL guru but it seems wrong to first erase an element and then > try to c...

DBAN is obsolete. NIST 800-88 for some time now says to use secure erase or enhanced security erase or crypto erase if supported. Other options do not erase data in remapped sectors. Chris Murphy

...th the Map and the Vector indeed contained (Key,Value) pairs. To save space, Map entries do not contain Value but instead an unsigned index into the Vector: /// The values are kept in a std::vector and the /// mapping is done with DenseMap from Keys to indexes in that vector. After an element is erased from the Vector all indices greater than the removed index are one too large. That's probably the reason why Mapvector did not have erase before. See http://llvm.org/docs/ProgrammersManual.html#llvm-adt-mapvector-h ...and it doesn't support removing elements. To correct this erase ne...

> On 2014-Jul-15, at 08:29, David Blaikie <dblaikie at gmail.com> wrote: > > Sounds pretty clearly buggy, and against the original design of the > ADT (as pointed out by the documentation quotation). When was erase > functionality added to MapVector? Can/should it be removed (and the > use case changed to use some other container) > > Making erase linear time sounds... not ideal, but possibly its > sufficient for some/current use cases. Or we could consider other > solutions to the use case...

...ens wrote: > >> I updated from 2.2 to the latest SVN head and I now get a debug >> assert in BranchFolder::RemoveBlocksWithHash: “vector iterators >> incompatible”. I’m using Visual C++ 2005. I think this is the >> culprit code: >> >> MergePotentials.erase(CurMPIter); >> if (CurMPIter==B) >> break; >> >> The erase clears the _Mycont field (i.e. the iterator’s container), >> while the == expects CurMPIter and B to have the same container. >> I’m no STL guru but it seems wrong to first erase an element...

On May 27, 2008, at 2:01 PM, Dale Johannesen wrote: > On May 27, 2008, at 1:40 PM, Mike Stump wrote: >> >> From n2461: >> >>> 8 The insert members shall not affect the validity of iterators and >>> references to the container, and the erase members shall invalidate >>> only iterators and references to the erased elements. >> >> Pretty clear. > > > In the current standard that language appears under "associative > containers", but this is a vector. Ah, and from vector: 23.2.5.4 vector modifie...

Hello list, I've been working on this problem for a while and I haven't been able to come up with a solution. I have a couple of functions that plot a bunch of data, then a single point on top of it. What I want is to be able to change the plot of the point without replotting all the data. Consider the following example: x = rnorm(100,1,0.5) y = rnorm(100,1,0.5) plot(x,y,pch=16)

...ave its border transparent, look at par(bg="transparent") plot(c(0, 3), 0:1) polygon(c(0, 1, 1, 0), c(0, 0, 1, 1), border=NA, col = 0) polygon(c(1, 2, 2, 1), c(0, 0, 1, 1), border="transparent", col = 0) polygon(c(2, 3, 3, 2), c(0, 0, 1, 1), border=0, col = 0) # a quick fix for erase.screen() is the following erase.screen <- function (n = .split.cur.screen) { if (!exists(".split.screens", envir = .GlobalEnv)) return(FALSE) if (!(n %in% .split.valid.screens) && n != 0) stop("Invalid screen number\n") old <- par(usr =...

...0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 |................| * 1bf2976000 Device Model: OCZ VERTEX PLUS (OCZ VERTEX 2E) # hexdump -C /dev/sdd 00000000 ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff |................| * df99e6000 What''s a good way to test what state they get erased to from a TRIM operation? Can btrfs detect the erase state and pad unused space in filesystem writes with the same value so as to reduce SSD wear? Regards, Martin -- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majordomo@vger.kerne...

...smith at apple.com> wrote: >> >>> On 2014-Jul-15, at 08:29, David Blaikie <dblaikie at gmail.com> wrote: >>> >>> Sounds pretty clearly buggy, and against the original design of the >>> ADT (as pointed out by the documentation quotation). When was erase >>> functionality added to MapVector? Can/should it be removed (and the >>> use case changed to use some other container) >>> >>> Making erase linear time sounds... not ideal, but possibly its >>> sufficient for some/current use cases. Or we could consi...

> On 2014-Jul-15, at 11:07, Reid Kleckner <rnk at google.com> wrote: > > Can we explicitly delete the erase method or do something else to document the fact that it is unsupported? It was added incidentally in r211350, even though it was added and removed by Doug back in r175538 / r175449. > I'm happy with it deleted or fixed (see WIP patch that fixes it w/o tests). For now, I'll fix it, a...

...question might even have been corrupted. This would make > using 'zpool destroy' to clear out a ZFS disk, or > > I've tried erasing the first megabyte of the disk, but there are ZFS > or LVM structures that get in the way. So, does anyone have an > efficient way to erase structures from a disk such that it can be reused? > > Something like > -erase first N blocks (block defined as 4096) > - Erase <number> blocks starting at block <number> > - erase last <number> blocks Use dd in a script: #!/bin/bash # erase N 4K blocks...

what if you just dd the first 1GB of the disk and the last GB of the disk (the last because of RAID signatures of some controllers that write to the end of the disk) Look at this article and modify accordingly https://zedt.eu/tech/linux/using-dd-to-repeatedly-erase-a-specific-range-of-sectors-on-the-hard-disk/ Also, use wipefs -a (Gordon Messmer answered faster than me) On Mon, Sep 14, 2020 at 3:18 PM david <david at daku.org> wrote: > Folks > > I've encountered situations where I want to reuse a hard-drive. I do > not want to preser...

On Mon, Feb 8, 2016 at 3:18 PM, <m.roth at 5-cent.us> wrote: > Chris Murphy wrote: >> DBAN is obsolete. NIST 800-88 for some time now says to use secure erase >> or enhanced security erase or crypto erase if supported. >> >> Other options do not erase data in remapped sectors. > > dban doesn't? What F/OSS does "secure erase"? And does it do what dban's > DoD 5220.22-M does? http://dban.org/download That DoD...

...or I = BB.rbegin(), E = BB.rend(); I != E; ) { Instruction& inst = *I; ++I; <-- iterator should be advanced to the previous instruction // Happens to be an Instruction::SExt. // Works fine if I iterate forwards if (isInstructionTriviallyDead(&inst, TLI)) inst.eraseFromParent(); } Sorry for the inexperienced question, but I'm confused why this works when using a forward iterator, but fails in reverse. The iterator is moved off the current instruction so why would erasing the current instruction cause an error? -------------- next part -------------- An...

...> class S1Ty, class ETy, class S2Ty> > > void set_intersect(S1Ty<ETy> &S1, const S2Ty &S2) { > > for (typename S1Ty<ETy>::iterator I = S1.begin(); I != S1.end();) { > > const ETy &E = *I; > > ++I; > > if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 > > } > > } > > Okay, it's pretty simple. Given two sets (e.g. std::set), it walks > through one of them. For each element in the set it checks to see if the > other contains the element. if not it removes it. > > It'...

Hi Rich: This is a alternative patch, if you like the api name called wipefs ;-P Thanks -Wanlong Gao Wanlong Gao (2): NEW API: add a new api wipefs virt-format: erase the filesystem signatures before erase partitions TODO | 2 -- daemon/zero.c | 17 +++++++++++++++++ format/format.c | 19 ++++--------------- generator/generator_actions.ml | 14 ++++++++++++++ src/MAX_PROC_NR |...