search for: max_depth

...ve" unless $node; - reg_export_node ($h, $node, @_); + reg_export_node ($h, $node, $fh, 0, @_); } =head2 reg_export_node @@ -510,8 +511,17 @@ sub reg_export_node my $h = shift; my $node = shift; my $fh = shift; + my $depth = shift; my %params = @_; + my $max_depth = $params{max_depth}; + if (defined $max_depth && $max_depth >= 0) { + # Check if we've gone deep enough + if ($depth >= $max_depth) { + return; + } + } + confess "reg_export_node: \$node parameter was undef" unless defined $nod...

This new option allows you to only export what you care about from a registry hive by specifying a max recursion depth. Michael Meyer (1): hivexregedit: add --max-depth option for exports perl/lib/Win/Hivex/Regedit.pm | 14 ++++++++++++-- regedit/hivexregedit | 18 +++++++++++++++++- 2 files changed, 29 insertions(+), 3 deletions(-) -- 2.14.3 (Apple Git-98)

...lac-1.2.1/src/libFLAC/metadata_iterators.c: ... 285 FLAC_API FLAC__bool FLAC__metadata_get_picture(const char *filename, FLAC__StreamMetadata **picture, FLAC__StreamMetadata_Picture_Type type, const char *mime_type, const FLAC__byte *description, unsigned max_width, unsigned max_height, unsigned max_depth, unsigned max_colors) 286 { 287 FLAC__Metadata_SimpleIterator *it; 288 FLAC__uint64 max_area_seen = 0; 289 FLAC__uint64 max_depth_seen = 0; 290 291 FLAC__ASSERT(0 != filename); 292 FLAC__ASSERT(0 != picture); 293 294 *picture = 0; 295 296 it = FLAC_...

...grid[, c(1:2)], sponge.grid, family = "poisson", n.cores=2) range(gbmpred1$Predictions) [1] 10.04643 31.39230 # the expected predictions # Here are results from xgboost # use count:poisson library(xgboost) xgbst2.1 <- xgboost(data = as.matrix(sponge[, -c(3)]), label = sponge[, 3], max_depth = 2, eta = 0.001, nthread = 6, nrounds = 3000, objective = "count:poisson") xgbstpred2 <- predict(xgbst2.1, as.matrix(sponge.grid)) head(xgbstpred2) range(xgbstpred2) [1] 1.109032 4.083049 # much lower than expected table(xgbstpred2) 1.10903215408325 1.265561819...

An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/flac-dev/attachments/20071202/e18cddb2/attachment.htm -------------- next part -------------- A non-text attachment was scrubbed... Name: metaflac.flac Type: audio/x-flac Size: 10983 bytes Desc: not available Url : http://lists.xiph.org/pipermail/flac-dev/attachments/20071202/e18cddb2/metaflac.bin

...@sdev: Virtscsi target whose queue depth to change + * @qdepth: New queue depth + * @reason: Reason for the queue depth change. + */ +static int virtscsi_change_queue_depth(struct scsi_device *sdev, + int qdepth, + int reason) +{ + struct Scsi_Host *shost = sdev->host; + int max_depth = shost->cmd_per_lun; + + switch (reason) { + case SCSI_QDEPTH_QFULL: /* Drop qdepth in response to BUSY state */ + scsi_track_queue_full(sdev, qdepth); + break; + case SCSI_QDEPTH_RAMP_UP: /* Raise qdepth after BUSY state resolved */ + case SCSI_QDEPTH_DEFAULT: /* Manual change via sysfs */ +...

...@sdev: Virtscsi target whose queue depth to change + * @qdepth: New queue depth + * @reason: Reason for the queue depth change. + */ +static int virtscsi_change_queue_depth(struct scsi_device *sdev, + int qdepth, + int reason) +{ + struct Scsi_Host *shost = sdev->host; + int max_depth = shost->cmd_per_lun; + + switch (reason) { + case SCSI_QDEPTH_QFULL: /* Drop qdepth in response to BUSY state */ + scsi_track_queue_full(sdev, qdepth); + break; + case SCSI_QDEPTH_RAMP_UP: /* Raise qdepth after BUSY state resolved */ + case SCSI_QDEPTH_DEFAULT: /* Manual change via sysfs */ +...

...y, I am analyzing plant communities with the function mvpart, using a dissimilarit matrix as input. The matrix is calculated with the funtion gdist. fit <- mvpart(gdist (ba12[,18:29], meth="maximum", full=TRUE, sq=F) ~ beers + slope_dem + elev_dem+ plc_dem + pr_curv+ +curv+max_depth+doc_rocks+ abandon+land_use+ca_old, data=ba12, xv="p") This works fine. Now I would like to use other dissimilarity measures as can be found in the function dist (STATS) or vegdist (VEGAN). De'Ath notes that gdist should be interchangeable with dist - but I receive following erro...

This series of patches makes Xen pass a (somewhat) valid device tree to dom0. The device tree for dom0 is the same as the one supplied to Xen except the memory and chosen nodes are adjusted appropriately. We don''t yet make use of the device tree to map MMIO regions or setup interrupts for the guest and we still include the UART used for Xen''s console. Note that loading Linux

Hi again, I was just looking around for ESFQ sources, and I see that the main site is down, and only has kernel 2.6.4 patches. Is ESFQ maintained? If so, where can I find patches for 2.6.10? Thanks, -justin _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/

Per my previous email: https://www.redhat.com/archives/libguestfs/2017-September/msg00203.html I'd like to talk about requiring a more modern version of the OCaml compiler. These commits show some of the code changes which would be possible with OCaml >= 3.12 [which it turns out we already require by accident] and also with OCaml >= 4.02. The latter is my favoured option. Rich.

Hola de nuevo. Se me olvidaba la principal razón para utilizar gbm.step del paquete dismo. Como sabéis, los boosted si sobreajustan (a diferencia de los random forest o cualquier otro bootstrap) pero gbm.step hace validación cruzada para determinar el nº óptimo de árboles y evitarlo. Es fundamental. La opción que me queda, Carlos, es hacerlo con gbm, pero muchas veces, y usar el

...NY uses the titanic data as an example of using caret to create xgbTree models. The caret train() function has a tuneGrid parameter which takes a list set up like so: tune.grid <- expand.grid(eta = c(0.05, 0.075, 0.1), nrounds = c(50, 75, 100), max_depth = 6:8, min_child_weight = c(2, 2.25, 2.5), colsample_bytree = (3:5)/10, gamma = 0, subsample = 1) That approach also worked with my data. By making the corresponding adjustments, I was also successful with gbm, bstTree and...

Hi Sanjoy, I'm having trouble finding caller-saved registers using the RegMask operand you've mentioned. As an example, I've got a C function that looks like this: double recurse(int depth, double val) { if(depth < max_depth) return recurse(depth + 1, val * 1.2) + val; else return outer_func(val); } As a quick refresher, all "xmm" registers are considered caller-saved on x86, hence values stored in these registers should be spilled to the stack before a function call. The generated assembly for branch c...

Keir, is there a particular reason you chose to use slightly different special mode numbers than Linux, ignoring VIDEO_CURRENT_MODE altogether? I think it wouldn''t be bad to be in sync with Linux here, and I independently think that having a way to avoid mode switching altogether is good to have in case of possible problems on exotic hardware. Jan

On Wed, Jul 13, 2016 at 04:48:51PM +0200, Sedat Dilek via llvm-dev wrote: > [ CCed all people who were involved in this thread ] > > Hi Tom, > > personally, I am interested to test the prebuilt-toolchains for > Ubuntu/xenial alias 16.04 LTS and Debian/Jessie v8.5.0 AMD64. > The available toolchains are incomplete and thus useless. > > Just as a fact: There is still no

Hi Rob, Rob Lyerly via llvm-dev wrote: > I'm looking for a way to get all the caller-saved registers (both the > register and the stack slot at which it was saved) for a given function > call site in the backend. What's the best way to grab this > information? Is it possible to get this information if I have the > MachineInstr of the function call? I'm currently

Hi everyone, I'm looking for a way to get all the caller-saved registers (both the register and the stack slot at which it was saved) for a given function call site in the backend. What's the best way to grab this information? Is it possible to get this information if I have the MachineInstr of the function call? I'm currently targeting the AArch64 & X86 backends. Thanks! --

...vt.edu> wrote: > Hi Sanjoy, > > I'm having trouble finding caller-saved registers using the RegMask > operand you've mentioned. As an example, I've got a C function that looks > like this: > > double recurse(int depth, double val) > { > if(depth < max_depth) return recurse(depth + 1, val * 1.2) + val; > else return outer_func(val); > } > > As a quick refresher, all "xmm" registers are considered caller-saved on > x86, hence values stored in these registers should be spilled to the stack > before a function call. The ge...

...dex 4af6f5c..8701a2a 100644 --- a/block/blk-tag.c +++ b/block/blk-tag.c @@ -347,19 +347,19 @@ int blk_queue_start_tag(struct request_queue *q, struct request *rq) * * We reserve a few tags just for sync IO, since we don't want * to starve sync IO on behalf of flooding async IO. */ max_depth = bqt->max_depth; if (!rq_is_sync(rq) && max_depth > 1) { max_depth -= 2; if (!max_depth) max_depth = 1; - if (q->in_flight[BLK_RW_ASYNC] > max_depth) + if (__queue_in_flight(q, BLK_RW_ASYNC) > max_depth) return 1; } do { tag = find_first_zero_bit(b...