search for: erases

I have a KVM vm running CentOS-6.8 on a host also running CentOS-6.8. This instance is used for occasional development projects which require segregation. Thus it is seldom accessed. At some point in the recent past this guest developed an issue with starting. Specifically these messages were found in the system log files: /var/log/messages-20170312:Mar 10 16:31:06 vhost04 kernel: dracut:

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 ==

Folks I've encountered situations where I want to reuse a hard-drive. I do not want to preserve anything on the drive, and I'm not concerned about 'securely erasing' old content. I just want to be able to define it as an Physical Volume (in a logical volume set), or make it a ZFS disk, or sometimes make it a simple EXT3, ExFAT or NTFS disk. However, old

On May 23, 2008, at 4:10 AM, Nicolas 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; >

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

Hi Oliver, There would be no problem if both 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

...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 cases. Heh -- it's already linear. It erases from the middle of a vector. At the least, if erasing is kept (and fixed), someone needs to update the docs and add a unit test. One way of speeding this up would be to erase a set of values in bulk. I think we could easily add a `remove_if()` function that deleted a set of matching items in lin...

On May 23, 2008, at 10:19 AM, Dale Johannesen wrote: > On May 23, 2008, at 4:10 AM, Nicolas Capens 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: >> >>

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

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)

# polygon ignores requests to have 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 =

I''ve got two recent examples of SSDs. Their pristine state from the manufacturer shows: Device Model: OCZ-VERTEX3 # hexdump -C /dev/sdd 00000000 00 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 |................| *

...anged 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 cases. >> >> Heh -- it's already linear. It erases from the middle of a vector. >> >> At the least, if erasing is kept (and fixed), someone needs to update the >> docs and add a unit test. >> >> One way of speeding this up would be to erase a set of values in bulk. I >> think we could easily add a `remove_if()...

> 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

At Mon, 14 Sep 2020 13:14:44 -0700 CentOS mailing list <centos at centos.org> wrote: > > Folks > > I've encountered situations where I want to reuse a hard-drive. I do > not want to preserve anything on the drive, and I'm not concerned > about 'securely erasing' old content. I just want to be able to > define it as an Physical Volume (in a logical

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

...eases wear (minor negative) but also doesn't actually set the cells to the state required to accept a new write, so you've just added a lot more work for the SSD's garbage collector and wear leveling, so it's going to be slower than before you did the zeroing. Secure erase on an SSD erases the cells so they're ready to accept writes. -- Chris Murphy

for (BasicBlock::reverse_iterator 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

On Tue, 12 Oct 2004 14:01:21 -0500 (CDT) Chris Lattner <sabre at nondot.org> wrote: > On Tue, 12 Oct 2004, Morten Ofstad wrote: > > > This is my first post on this mailing list, so bear with me... My name > > is Morten Ofstad and I work for Hue AS (www.hue.no), a company that > > makes 3D Visualization software. We are looking into using LLVM for JIT > >

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 ++++---------------