/*
 * jcdctmgr.c
 *
 * Copyright (C) 1994-1998, Thomas G. Lane.
 * This file is part of the Independent JPEG Group's software.
 * For conditions of distribution and use, see the accompanying README file.
 *
 * This file contains the forward-DCT management logic.
 * This code selects a particular DCT implementation to be used,
 * and it performs related housekeeping chores including coefficient
 * quantization.
 */

#define JPEG_INTERNALS
#include "jinclude16.h"
#include "jpeglib16.h"
#include "jlossy16.h"		/* Private declarations for lossy codec */
#include "jdct16.h"		/* Private declarations for DCT subsystem */

/* Private subobject for this module */

typedef struct {
  /* Pointer to the DCT routine actually in use */
  forward_DCT_method_ptr do_dct;

  /* The actual post-DCT divisors --- not identical to the quant table
   * entries, because of scaling (especially for an unnormalized DCT).
   * Each table is given in normal array order.
   */
  DCTELEM * divisors[NUM_QUANT_TBLS];

#ifdef DCT_FLOAT_SUPPORTED
  /* Same as above for the floating-point case. */
  float_DCT_method_ptr do_float_dct;
  FAST_FLOAT * float_divisors[NUM_QUANT_TBLS];
#endif
} fdct_controller;

typedef fdct_controller * fdct_ptr;

/*
 * Initialize for a processing pass.
 * Verify that all referenced Q-tables are present, and set up
 * the divisor table for each one.
 * In the current implementation, DCT of all components is done during
 * the first pass, even if only some components will be output in the
 * first scan.  Hence all components should be examined here.
 */

METHODDEF(void)
start_pass_fdctmgr (j_compress_ptr cinfo)
{
  j_lossy_c_ptr lossyc = (j_lossy_c_ptr) cinfo->codec;
  fdct_ptr fdct = (fdct_ptr) lossyc->fdct_private;
  int ci, qtblno, i;
  jpeg_component_info *compptr;
  JQUANT_TBL * qtbl;
  DCTELEM * dtbl;

  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
       ci++, compptr++) {
    qtblno = compptr->quant_tbl_no;
    /* Make sure specified quantization table is present */
    if (qtblno < 0 || qtblno >= NUM_QUANT_TBLS ||
	cinfo->quant_tbl_ptrs[qtblno] == NULL)
      ERREXIT1(cinfo, JERR_NO_QUANT_TABLE, qtblno);
    qtbl = cinfo->quant_tbl_ptrs[qtblno];
    /* Compute divisors for this quant table */
    /* We may do this more than once for same table, but it's not a big deal */
    switch (cinfo->dct_method) {
#ifdef DCT_ISLOW_SUPPORTED
    case JDCT_ISLOW:
      /* For LL&M IDCT method, divisors are equal to raw quantization
       * coefficients multiplied by 8 (to counteract scaling).
       */
      if (fdct->divisors[qtblno] == NULL) {
	fdct->divisors[qtblno] = (DCTELEM *)
	  (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
				      DCTSIZE2 * SIZEOF(DCTELEM));
      }
      dtbl = fdct->divisors[qtblno];
      for (i = 0; i < DCTSIZE2; i++) {
	dtbl[i] = ((DCTELEM) qtbl->quantval[i]) << 3;
      }
      break;
#endif
#ifdef DCT_IFAST_SUPPORTED
    case JDCT_IFAST:
      {
	/* For AA&N IDCT method, divisors are equal to quantization
	 * coefficients scaled by scalefactor[row]*scalefactor[col], where
	 *   scalefactor[0] = 1
	 *   scalefactor[k] = cos(k*PI/16) * sqrt(2)    for k=1..7
	 * We apply a further scale factor of 8.
	 */
#define CONST_BITS 14
	static const INT16 aanscales[DCTSIZE2] = {
	  /* precomputed values scaled up by 14 bits */
	  16384, 22725, 21407, 19266, 16384, 12873,  8867,  4520,
	  22725, 31521, 29692, 26722, 22725, 17855, 12299,  6270,
	  21407, 29692, 27969, 25172, 21407, 16819, 11585,  5906,
	  19266, 26722, 25172, 22654, 19266, 15137, 10426,  5315,
	  16384, 22725, 21407, 19266, 16384, 12873,  8867,  4520,
	  12873, 17855, 16819, 15137, 12873, 10114,  6967,  3552,
	   8867, 12299, 11585, 10426,  8867,  6967,  4799,  2446,
	   4520,  6270,  5906,  5315,  4520,  3552,  2446,  1247
	};
	SHIFT_TEMPS

	if (fdct->divisors[qtblno] == NULL) {
	  fdct->divisors[qtblno] = (DCTELEM *)
	    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
					DCTSIZE2 * SIZEOF(DCTELEM));
	}
	dtbl = fdct->divisors[qtblno];
	for (i = 0; i < DCTSIZE2; i++) {
	  dtbl[i] = (DCTELEM)
	    DESCALE(MULTIPLY16V16((IJG_INT32) qtbl->quantval[i],
				  (IJG_INT32) aanscales[i]),
		    CONST_BITS-3);
	}
      }
      break;
#endif
#ifdef DCT_FLOAT_SUPPORTED
    case JDCT_FLOAT:
      {
	/* For float AA&N IDCT method, divisors are equal to quantization
	 * coefficients scaled by scalefactor[row]*scalefactor[col], where
	 *   scalefactor[0] = 1
	 *   scalefactor[k] = cos(k*PI/16) * sqrt(2)    for k=1..7
	 * We apply a further scale factor of 8.
	 * What's actually stored is 1/divisor so that the inner loop can
	 * use a multiplication rather than a division.
	 */
	FAST_FLOAT * fdtbl;
	int row, col;
	static const double aanscalefactor[DCTSIZE] = {
	  1.0, 1.387039845, 1.306562965, 1.175875602,
	  1.0, 0.785694958, 0.541196100, 0.275899379
	};

	if (fdct->float_divisors[qtblno] == NULL) {
	  fdct->float_divisors[qtblno] = (FAST_FLOAT *)
	    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
					DCTSIZE2 * SIZEOF(FAST_FLOAT));
	}
	fdtbl = fdct->float_divisors[qtblno];
	i = 0;
	for (row = 0; row < DCTSIZE; row++) {
	  for (col = 0; col < DCTSIZE; col++) {
	    fdtbl[i] = (FAST_FLOAT)
	      (1.0 / (((double) qtbl->quantval[i] *
		       aanscalefactor[row] * aanscalefactor[col] * 8.0)));
	    i++;
	  }
	}
      }
      break;
#endif
    default:
      ERREXIT(cinfo, JERR_NOT_COMPILED);
      break;
    }
  }
}

/*
 * Perform forward DCT on one or more blocks of a component.
 *
 * The input samples are taken from the sample_data[] array starting at
 * position start_row/start_col, and moving to the right for any additional
 * blocks. The quantized coefficients are returned in coef_blocks[].
 */

METHODDEF(void)
forward_DCT (j_compress_ptr cinfo, jpeg_component_info * compptr,
	     JSAMPARRAY sample_data, JBLOCKROW coef_blocks,
	     JDIMENSION start_row, JDIMENSION start_col,
	     JDIMENSION num_blocks)
/* This version is used for integer DCT implementations. */
{
  /* This routine is heavily used, so it's worth coding it tightly. */
  j_lossy_c_ptr lossyc = (j_lossy_c_ptr) cinfo->codec;
  fdct_ptr fdct = (fdct_ptr) lossyc->fdct_private;
  forward_DCT_method_ptr do_dct = fdct->do_dct;
  DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no];
  DCTELEM workspace[DCTSIZE2];	/* work area for FDCT subroutine */
  JDIMENSION bi;

  sample_data += start_row;	/* fold in the vertical offset once */

  for (bi = 0; bi < num_blocks; bi++, start_col += DCTSIZE) {
    /* Load data into workspace, applying unsigned->signed conversion */
    { register DCTELEM *workspaceptr;
      register JSAMPROW elemptr;
      register int elemr;

      workspaceptr = workspace;
      for (elemr = 0; elemr < DCTSIZE; elemr++) {
	elemptr = sample_data[elemr] + start_col;
#if DCTSIZE == 8		/* unroll the inner loop */
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	*workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
#else
	{ register int elemc;
	  for (elemc = DCTSIZE; elemc > 0; elemc--) {
	    *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE;
	  }
	}
#endif
      }
    }

    /* Perform the DCT */
    (*do_dct) (workspace);

    /* Quantize/descale the coefficients, and store into coef_blocks[] */
    { register DCTELEM temp, qval;
      register int i;
      register JCOEFPTR output_ptr = coef_blocks[bi];

      for (i = 0; i < DCTSIZE2; i++) {
	qval = divisors[i];
	temp = workspace[i];
	/* Divide the coefficient value by qval, ensuring proper rounding.
	 * Since C does not specify the direction of rounding for negative
	 * quotients, we have to force the dividend positive for portability.
	 *
	 * In most files, at least half of the output values will be zero
	 * (at default quantization settings, more like three-quarters...)
	 * so we should ensure that this case is fast.  On many machines,
	 * a comparison is enough cheaper than a divide to make a special test
	 * a win.  Since both inputs will be nonnegative, we need only test
	 * for a < b to discover whether a/b is 0.
	 * If your machine's division is fast enough, define FAST_DIVIDE.
	 */
#ifdef FAST_DIVIDE
#define DIVIDE_BY(a,b)	a /= b
#else
#define DIVIDE_BY(a,b)	if (a >= b) a /= b; else a = 0
#endif
	if (temp < 0) {
	  temp = -temp;
	  temp += qval>>1;	/* for rounding */
	  DIVIDE_BY(temp, qval);
	  temp = -temp;
	} else {
	  temp += qval>>1;	/* for rounding */
	  DIVIDE_BY(temp, qval);
	}
	output_ptr[i] = (JCOEF) temp;
      }
    }
  }
}

#ifdef DCT_FLOAT_SUPPORTED

METHODDEF(void)
forward_DCT_float (j_compress_ptr cinfo, jpeg_component_info * compptr,
		   JSAMPARRAY sample_data, JBLOCKROW coef_blocks,
		   JDIMENSION start_row, JDIMENSION start_col,
		   JDIMENSION num_blocks)
/* This version is used for floating-point DCT implementations. */
{
  /* This routine is heavily used, so it's worth coding it tightly. */
  j_lossy_c_ptr lossyc = (j_lossy_c_ptr) cinfo->codec;
  fdct_ptr fdct = (fdct_ptr) lossyc->fdct_private;
  float_DCT_method_ptr do_dct = fdct->do_float_dct;
  FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no];
  FAST_FLOAT workspace[DCTSIZE2]; /* work area for FDCT subroutine */
  JDIMENSION bi;

  sample_data += start_row;	/* fold in the vertical offset once */

  for (bi = 0; bi < num_blocks; bi++, start_col += DCTSIZE) {
    /* Load data into workspace, applying unsigned->signed conversion */
    { register FAST_FLOAT *workspaceptr;
      register JSAMPROW elemptr;
      register int elemr;

      workspaceptr = workspace;
      for (elemr = 0; elemr < DCTSIZE; elemr++) {
	elemptr = sample_data[elemr] + start_col;
#if DCTSIZE == 8		/* unroll the inner loop */
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	*workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
#else
	{ register int elemc;
	  for (elemc = DCTSIZE; elemc > 0; elemc--) {
	    *workspaceptr++ = (FAST_FLOAT)
	      (GETJSAMPLE(*elemptr++) - CENTERJSAMPLE);
	  }
	}
#endif
      }
    }

    /* Perform the DCT */
    (*do_dct) (workspace);

    /* Quantize/descale the coefficients, and store into coef_blocks[] */
    { register FAST_FLOAT temp;
      register int i;
      register JCOEFPTR output_ptr = coef_blocks[bi];

      for (i = 0; i < DCTSIZE2; i++) {
	/* Apply the quantization and scaling factor */
	temp = workspace[i] * divisors[i];
	/* Round to nearest integer.
	 * Since C does not specify the direction of rounding for negative
	 * quotients, we have to force the dividend positive for portability.
	 * The maximum coefficient size is +-16K (for 12-bit data), so this
	 * code should work for either 16-bit or 32-bit ints.
	 */
	output_ptr[i] = (JCOEF) ((int) (temp + (FAST_FLOAT) 16384.5) - 16384);
      }
    }
  }
}

#endif /* DCT_FLOAT_SUPPORTED */

/*
 * Initialize FDCT manager.
 */

GLOBAL(void)
jinit_forward_dct (j_compress_ptr cinfo)
{
  j_lossy_c_ptr lossyc = (j_lossy_c_ptr) cinfo->codec;
  fdct_ptr fdct;
  int i;

  fdct = (fdct_ptr)
    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
				SIZEOF(fdct_controller));
  lossyc->fdct_private = (struct jpeg_forward_dct *) fdct;
  lossyc->fdct_start_pass = start_pass_fdctmgr;

  switch (cinfo->dct_method) {
#ifdef DCT_ISLOW_SUPPORTED
  case JDCT_ISLOW:
    lossyc->fdct_forward_DCT = forward_DCT;
    fdct->do_dct = jpeg_fdct_islow;
    break;
#endif
#ifdef DCT_IFAST_SUPPORTED
  case JDCT_IFAST:
    lossyc->fdct_forward_DCT = forward_DCT;
    fdct->do_dct = jpeg_fdct_ifast;
    break;
#endif
#ifdef DCT_FLOAT_SUPPORTED
  case JDCT_FLOAT:
    lossyc->fdct_forward_DCT = forward_DCT_float;
    fdct->do_float_dct = jpeg_fdct_float;
    break;
#endif
  default:
    ERREXIT(cinfo, JERR_NOT_COMPILED);
    break;
  }

  /* Mark divisor tables unallocated */
  for (i = 0; i < NUM_QUANT_TBLS; i++) {
    fdct->divisors[i] = NULL;
#ifdef DCT_FLOAT_SUPPORTED
    fdct->float_divisors[i] = NULL;
#endif
  }
}

{'repo_name': 'fo-dicom/fo-dicom', 'stars': '597', 'repo_language': 'C#', 'file_name': 'fo-dicom.Universal.targets', 'mime_type': 'text/xml', 'hash': -5932165147944360688, 'source_dataset': 'data'}


var Script = function () {

    //morris chart

    $(function () {
      // data stolen from http://howmanyleft.co.uk/vehicle/jaguar_'e'_type
      var tax_data = [
           {"period": "2011 Q3", "licensed": 3407, "sorned": 660},
           {"period": "2011 Q2", "licensed": 3351, "sorned": 629},
           {"period": "2011 Q1", "licensed": 3269, "sorned": 618},
           {"period": "2010 Q4", "licensed": 3246, "sorned": 661},
           {"period": "2009 Q4", "licensed": 3171, "sorned": 676},
           {"period": "2008 Q4", "licensed": 3155, "sorned": 681},
           {"period": "2007 Q4", "licensed": 3226, "sorned": 620},
           {"period": "2006 Q4", "licensed": 3245, "sorned": null},
           {"period": "2005 Q4", "licensed": 3289, "sorned": null}
      ];
      Morris.Line({
        element: 'hero-graph',
        data: tax_data,
        xkey: 'period',
        ykeys: ['licensed', 'sorned'],
        labels: ['Licensed', 'Off the road'],
        lineColors:['#8075c4','#6883a3']
      });

      Morris.Donut({
        element: 'hero-donut',
        data: [
          {label: 'Jam', value: 25 },
          {label: 'Frosted', value: 40 },
          {label: 'Custard', value: 25 },
          {label: 'Sugar', value: 10 }
        ],
          colors: ['#41cac0', '#49e2d7', '#34a39b'],
        formatter: function (y) { return y + "%" }
      });

      Morris.Area({
        element: 'hero-area',
        data: [
          {period: '2010 Q1', iphone: 2666, ipad: null, itouch: 2647},
          {period: '2010 Q2', iphone: 2778, ipad: 2294, itouch: 2441},
          {period: '2010 Q3', iphone: 4912, ipad: 1969, itouch: 2501},
          {period: '2010 Q4', iphone: 3767, ipad: 3597, itouch: 5689},
          {period: '2011 Q1', iphone: 6810, ipad: 1914, itouch: 2293},
          {period: '2011 Q2', iphone: 5670, ipad: 4293, itouch: 1881},
          {period: '2011 Q3', iphone: 4820, ipad: 3795, itouch: 1588},
          {period: '2011 Q4', iphone: 15073, ipad: 5967, itouch: 5175},
          {period: '2012 Q1', iphone: 10687, ipad: 4460, itouch: 2028},
          {period: '2012 Q2', iphone: 8432, ipad: 5713, itouch: 1791}
        ],

          xkey: 'period',
          ykeys: ['iphone', 'ipad', 'itouch'],
          labels: ['iPhone', 'iPad', 'iPod Touch'],
          hideHover: 'auto',
          lineWidth: 1,
          pointSize: 5,
          lineColors: ['#4a8bc2', '#ff6c60', '#a9d86e'],
          fillOpacity: 0.5,
          smooth: true
      });

      Morris.Bar({
        element: 'hero-bar',
        data: [
          {device: 'iPhone', geekbench: 136},
          {device: 'iPhone 3G', geekbench: 137},
          {device: 'iPhone 3GS', geekbench: 275},
          {device: 'iPhone 4', geekbench: 380},
          {device: 'iPhone 4S', geekbench: 655},
          {device: 'iPhone 5', geekbench: 1571}
        ],
        xkey: 'device',
        ykeys: ['geekbench'],
        labels: ['Geekbench'],
        barRatio: 0.4,
        xLabelAngle: 35,
        hideHover: 'auto',
        barColors: ['#6883a3']
      });

      new Morris.Line({
        element: 'examplefirst',
        xkey: 'year',
        ykeys: ['value'],
        labels: ['Value'],
        data: [
          {year: '2008', value: 20},
          {year: '2009', value: 10},
          {year: '2010', value: 5},
          {year: '2011', value: 5},
          {year: '2012', value: 20}
        ]
      });

      $('.code-example').each(function (index, el) {
        eval($(el).text());
      });
    });

}();

{'repo_name': 'liulipeng/yii2-app-advanced', 'stars': '133', 'repo_language': 'HTML', 'file_name': 'once-as-root.sh', 'mime_type': 'text/x-shellscript', 'hash': 3689993076417476715, 'source_dataset': 'data'}


====== inet-4.x ======

2020-01-08  ------ inet-4.2.0 released ------

2019-09-23  Levente Mészáros

	Renamed carrierFrequency to centerFrequency.

	This confusion was spread all around the code. In most places we don't
	know what kind of modulation is used (e.g. OFDM has several subcarriers),
	so it doesn't really make sense.

2019-09-20  Levente Mészáros

	Added missing cases for erroneous packets in decapsulate.

2019-08-27  Levente Mészáros

	Replaced simtime_t type with simsec in multidimensional analog domain signal representations.

2019-08-02  Zoltan Bojthe

	Set bit error on Packet in decapsulate() when needed.

2019-07-26  Zoltan Bojthe

	Added model error checks
	Fixed headerLength usage - fingerprints changed.

2019-07-25  Zoltan Bojthe

	Changed ApskPhyHeader: added headerLengthField and lengthField, and change
	payloadLengthField type to b.

2019-06-17  Levente Mészáros

	Implemented new syntax and added expressions to timeGains and frequencyGains parameters.

2019-06-07  Levente Mészáros

	Replaced old multidimensional mappings (MiXiM) with new multidimensional functions.
	This patch affects member variables, arguments and returns values.

2019-01-28  ------ inet-4.1.0 released ------

2018-09-26  Levente Mészáros

	Added sensible default values for transmitter/receiver submodule types in radio modules.

2018-09-26  Levente Mészáros

	Moved sensible default for antenna submodule type to Radio.

2018-09-26  Levente Mészáros

	Moved sensible default values for propagation and path loss submodules of the radio medium.

2018-06-27  ------ inet-4.0.0 released ------

2018-06-05  Levente Mészáros

	Replaced fooType NED parameters with foo.typename parameters.

2018-05-04  Levente Mészáros

	Changed chunk processing to allow for incorrect chunks.

	Physical layers generally don't check whether the data is erroneous or
	not. This change allows chunk level packet corruption.

2018-04-13  ------ inet-3.99.3 released ------

2018-02-27  Zoltan Bojthe

	Added ApskProtocolDissector, with kludges for header padding and trailer.

2018-02-23  Zoltan Bojthe

	Added apskPhy protocol, added payloadProtocol field to ApskPhyHeader.

2018-01-16  Levente Mészáros

	Completed remaining APSK -> Apsk renames.

2017-12-22  ------ inet-3.99.2 released ------

2017-12-20  Zoltan Bojthe

	Renaming:
	    APSKDimensionalRadio -> ApskDimensionalRadio
	    APSKDimensionalRadioMedium -> ApskDimensionalRadioMedium
	    APSKDimensionalReceiver -> ApskDimensionalReceiver
	    APSKDimensionalTransmission -> ApskDimensionalTransmission
	    APSKDimensionalTransmitter -> ApskDimensionalTransmitter
	    APSKEncoder -> ApskEncoder
	    APSKErrorModel -> ApskErrorModel
	    APSKLayeredTransmitter -> ApskLayeredTransmitter
	    APSKModulationBase -> ApskModulationBase
	    APSKPhyHeader -> ApskPhyHeader
	    APSKRadio -> ApskRadio
	    APSKScalarRadio -> ApskScalarRadio
	    APSKScalarRadioMedium -> ApskScalarRadioMedium
	    APSKScalarReceiver -> ApskScalarReceiver
	    APSKScalarTransmission -> ApskScalarTransmission
	    APSKScalarTransmitter -> ApskScalarTransmitter
	    DimensionalSNIR -> DimensionalSnir
	    ScalarSNIR -> ScalarSnir

2017-11-14  Zoltan Bojthe

	Replace "int foo @enum(FooEnum)" to FooEnum foo.

2017-11-17  Zoltan Bojthe

	Added required import statements to MSG files according to new syntax.

2017-11-16  ------ inet-3.99.1 released ------

2017-11-10  Levente Mészáros

	Updated dimensional transmitters/transmissions to be similar to scalar ones.
	Fixed APSKScalarReceiver signal power check against sensitivity.

2017-10-18  Levente Mészáros

	Fixed padding in APSKRadio, especially when its not byte aligned.

2017-07-27  Levente Mészáros

	Resurrected APSKPhyHeaderSerialier to do the bare minimum.

2017-07-27  Levente Mészáros

	Removed superfluous APSKPhyHeaderSerializer dependency.

2017-03-16  Zoltan Bojthe

	Added more precise KLUDGE to APSKRadio.

2017-01-30  Levente Mészáros

	Fixed APSKPhyHeader length in APSKRadio.

2017-01-26  Levente Mészáros

	Switched to bit type where appropriate.

2017-01-24  Levente Mészáros

	Changed to use bit/byte where appropriate.

2017-01-18  Levente Mészáros

	Changed APSK bitlevel radio to use Packet/Chunk properly.

2017-01-16  Levente Mészáros

	Switched to use APSKPhyHeader and encapsulate/decapsulate in APSKRadio.

2017-01-25  Zoltan Bojthe

	Renamed macFrame to packet where appropriate.

2017-01-25  Zoltan Bojthe

	Replaced cPacket* with Packet* where appropriate.

====== inet-3.x ======

2018-03-21  ------ inet-3.6.4 released ------

2017-12-22  ------ inet-3.6.3 released ------

2017-11-28  Levente Mészáros

	Fixed sensitivity bug in APSKScalarReceiver found by Tobias Thiel
	<tobias011@gmail.com>.

2017-10-02  ------ inet-3.6.2 released ------

2017-09-29  Levente Mészáros

	APSK: Added APSKScalarTransmission to transmitter & receiver.

2017-07-06  ------ inet-3.6.1 released ------

2017-06-09  ------ inet-3.6.0 released ------

2017-02-20  ------ inet-3.5.0 released ------

2016-06-15  ------ inet-3.4.0 released ------

2016-06-01  ------ inet-3.3.0 released ------

2016-04-06  ------ inet-3.2.4 released ------

2016-03-16  ------ inet-3.2.3 released ------

2016-03-11  ------ inet-3.2.2 released ------

2016-01-21  ------ inet-3.2.1 released ------

2015-12-16  ------ inet-3.2.0 released ------

2015-11-12  Levente Meszaros

	Radio: Added support for the simulation of separate signal parts.

	The preamble, header and data parts can be optionally simulated
	separately. This is results in more accurate simulation, because a
	reception may be aborted before the data part is received.

2015-10-26  ------ inet-3.1.1 released ------

2015-10-15  ------ inet-3.1.0 released ------

2015-06-22  ------ inet-3.0.0 released ------

2015-05-13  ------ inet-2.99.1 released ------

2015-04-03  Levente Meszaros

	Added level parameter to printToStream functions.

2015-03-17  Levente Meszaros

	Added missing headerBitLength and control info handling to
	APSKDimensionalTransmitter.

2015-03-16  Levente Meszaros

	Extracted DimensionalTransmitterBase class. This change fixes compilation
	with individual radio features turned off.

2015-03-16  Levente Meszaros

	Consistently renamed packet level and bit level implementations into
	separate subdirectories. Renamed apsk/layered to apskradio/bitlevel. Moved
	remaining apsk contents to apsk/packetlevel.

2015-01-21  Zoltan Bojthe

	Applied C++ source code modernizer.

2014-11-07  ------ inet-2.99.0 released ------

2014-10-31  Levente Meszaros

	Added initial implementation:
	APSKScalarReceiver, APSKScalarTransmitter, APSKScalarRadio,
	APSKScalarRadioMedium, APSKDimensionalReceiver, APSKDimensionalTransmitter,
	APSKDimensionalRadio, APSKDimensionalRadioMedium

====== inet-2.x ======

{'repo_name': 'inet-framework/inet', 'stars': '238', 'repo_language': 'C++', 'file_name': 'tag-changelogs', 'mime_type': 'text/x-shellscript', 'hash': -1782399762652572263, 'source_dataset': 'data'}


--
-- a pulldown terminal that lives outside the normal window manager
-- down/upside is that input handling and other features behave differently
--
--
-- MISSING:
-- mouse/scroll-lock control, mouse injection, cut/paste(?), option to swap
-- in other windows
--

local dstate = {
	dir_x = 0,
	dir_y = 1,
	pos = "top",
	ofs = 0,
	width = 0.5,
	height = 0.3,
	shadow_color = {0xff, 0xff, 0xff}
};

gconfig_register("dt_width", 0.5);
gconfig_register("dt_height", 0.4);
gconfig_register("dt_opa", 0.8);
gconfig_register("dt_shadow", 0);
gconfig_register("dt_shadow_ofs_x", 0);
gconfig_register("dt_shadow_ofs_y", 0);
gconfig_register("dt_shadow_opa", 0.3);

-- synch main font and fallback font with the registry
local function set_font()
	local tbl = {gconfig_get("term_font")};
	local fbf = gconfig_get("font_fb");
	if (not resource(tbl[1], SYS_FONT_RESOURCE)) then
		return;
	end

	if (resource(fbf, SYS_FONT_RESOURCE)) then
		tbl[2] = fbf;
	end

	if (valid_vid(dstate.term, TYPE_FRAMESERVER)) then
		target_fonthint(dstate.term, tbl, gconfig_get("term_font_sz") * FONT_PT_SZ, -1);
	end
end

local function set_sz()
	if (valid_vid(dstate.term, TYPE_FRAMESERVER)) then
		target_fonthint(dstate.term,
			gconfig_get("term_font_sz") * FONT_PT_SZ, -1);
	end
end

local function set_hint()
	if (valid_vid(dstate.term, TYPE_FRAMESERVER)) then
		target_fonthint(dstate.term, -1, gconfig_get("term_font_hint"));
	end
end

local function update_shadow()
	if (not valid_vid(dstate.term)) then
		return;
	end

	if (valid_vid(dstate.shadow_vid)) then
		delete_image(dstate.shadow_vid);
	end

	if (gconfig_get("dt_shadow") < 1) then
		return;
	end

	local props = image_surface_resolve(dstate.term);
	local shadow_sz = gconfig_get("dt_shadow");
	dstate.shadow_vid = fill_surface(32, 32, unpack(dstate.shadow_color));
	link_image(dstate.shadow_vid, dstate.term);
	blend_image(dstate.shadow_vid, gconfig_get("dt_shadow_opa"));
	order_image(dstate.shadow_vid, 65531);
	resize_image(dstate.shadow_vid, props.width + shadow_sz, props.height + shadow_sz);
	move_image(dstate.shadow_vid,
		gconfig_get("dt_shadow_ofs_x"), gconfig_get("dt_shadow_ofs_y"));
end

gconfig_listen("term_font", "pdterm", set_font);
gconfig_listen("term_font_sz", "pdterm_sz", set_sz);
gconfig_listen("term_font_hint", "pdterm_hint", set_hint);

-- it's so cheap so just rebuild etc. on everything
gconfig_listen("dt_shadow", "pdterm_shadow", update_shadow);
gconfig_listen("dt_shadow_opa", "pdterm_shadow_opa", update_shadow);
gconfig_listen("dt_shadow_ofs_x", "pdterm_shadow_ofs_x", update_shadow);
gconfig_listen("dt_shadow_ofs_y", "pdterm_shadow_ofs_y", update_shadow);

local function update_size()
	if (valid_vid(dstate.term, TYPE_FRAMESERVER)) then
		local disp = active_display();
		local neww = disp.width * gconfig_get("dt_width");
		local newh = disp.height * gconfig_get("dt_height");
		target_displayhint(dstate.term, neww, newh, 0, active_display().disptbl);
		update_shadow();
	end
end

local dterm_cfg = {
{
	label = "Width",
	name = "width",
	kind = "value",
	hint = "(100 * val)%",
	description = "Change the display relative window width",
	validator = gen_valid_float(0.1, 1.0),
	initial = function() return gconfig_get("dt_width"); end,
	handler = function(ctx, val)
		gconfig_set("dt_weight", tonumber(val));
		update_size();
	end
},
{
	label = "Height",
	name = "height",
	kind = "value",
	hint = "(100 * val)%",
	description = "Change the display relative window height",
	validator = gen_valid_float(0.1, 1.0),
	initial = function() return gconfig_get("dt_width"); end,
	handler = function(ctx, val)
		gconfig_set("dt_height", tonumber(val));
		update_size();
	end
},
{
	label = "Background Alpha",
	name = "alpha",
	kind = "value",
	hint = "(0..1, 1=opaque)",
	description = "Change the terminal background opacity",
	validator = gen_valid_float(0.0, 1.0),
	initial = function() return gconfig_get("dt_opa"); end,
	handler = function(ctx, val)
		gconfig_set("dt_opa", tonumber(val));
		if (valid_vid(dstate.term, TYPE_FRAMESERVER)) then
			target_graphmode(dstate.term, gconfig_get("dt_opa"));
		end
	end
},
{
	name = "shadow",
	label = "Shadow Size (px)",
	kind = "value",
	hint = "(0..100, 0 = disabled)",
	description = "Set the size of the window hard-shadow box",
	validator = gen_valid_float(0.0, 100.0),
	initial = function() return gconfig_get("dt_shadow"); end,
	handler = function(ctx, val)
		gconfig_set("dt_shadow", tonumber(val));
		gconfig_set("dt_shadow_ofs_x", -0.5 * val);
		gconfig_set("dt_shadow_ofs_y", -0.5 * val);
	end
},
{
	name = "shadow_opa",
	label = "Shadow Opacity",
	kind = "value",
	description = "Set the opacity of the window hard-shadow",
	hint = "(0..1, 1=opaque)",
	validator = gen_valid_float(0.0, 1.0),
	initial = function() return gconfig_get("dt_shadow_opa"); end,
	handler = function(ctx, val)
		gconfig_set("dt_shadow_opa", tonumber(val));
	end
},
{
	name = "shadow_ofset_x",
	label = "Shadow Ofset (X)",
	kind = "value",
	hint = "-50..50",
	description = "Set the window pixel- X offset for the shadow",
	validator = gen_valid_float(-50, 50),
	initial = function() return gconfig_get("dt_shadow_ofs_x"); end,
	handler = function(ctx, val)
		gconfig_set("dt_shadow_ofs_x", tonumber(val));
	end
},
{
	name = "shadow_ofset_y",
	label = "Shadow Ofset (Y)",
	kind = "value",
	hint = "-50..50",
	description = "Set the window pixel- Y offset for the shadow",
	validator = gen_valid_float(-50, 50),
	initial = function() return gconfig_get("dt_shadow_ofs_y"); end,
	handler = function(ctx, val)
		gconfig_set("dt_shadow_ofs_y", tonumber(val));
	end
}
};

local atype = extevh_archetype("terminal");

local function drop()
	reset_image_transform(dstate.term);
	local props = image_surface_properties(dstate.term);
	nudge_image(dstate.term,
		-1 * dstate.dir_x * props.width,
		-1 * dstate.dir_y * props.height,
		gconfig_get("animation")
	);
	blend_image(dstate.term, 0.0, gconfig_get("animation"));
	dstate.active = false;
	dispatch_toggle(false);
	mouse_lockto(unpack(dstate.lock));

	target_displayhint(dstate.term, 0, 0,
		bit.bor(TD_HINT_UNFOCUSED, TD_HINT_INVISIBLE));
end

-- we intercept symbol- handling so our trigger path can be re-used
-- but forward the rest to the new window
local function ldisp(sym, iotbl, path)
	if (not sym and not iotbl) then
		drop();
		return;
	end

-- label translation
	if (iotbl.label and atype.labels[iotbl.label]) then
		iotbl.label = atype.labels[iotbl.label];
	end

-- don't consume mouse here as we want to translate to the specific surface
	if (iotbl.mouse) then
		return false, sym, iotbl, path;
	end

	target_input(dstate.term, iotbl);

-- run through the terminal archetype label binding
	return true, sym, iotbl, path;
end

-- different rules apply to input and event response compared to normal windows
-- we actually trust the terminal to be compliant here as it is launched
-- authoritatively
local function termh(source, status)
	if (status.kind == "resized") then
		resize_image(source, status.width, status.height);
		update_shadow();
	elseif (status.kind == "terminated") then
		if (dstate.active) then
			drop();
		end
		delete_image(source);
		dstate.term = nil;
		dstate.disp.lock_override = false;
	end
end

local function dterm()
-- if we're already toggled, then disable
	if (dstate.active) then
		drop();
		return;
	end

-- if we got a terminal running, prefer that
-- or spawn a new one.. create anchor, attach, order, ...
	local disp = active_display();
	local neww = disp.width * gconfig_get("dt_width");
	local newh = disp.height * gconfig_get("dt_height");

-- the spawn_terminal() function from global/open takes care of initial
-- font setup, it's only for dynamic changes the rest is needed
	if (not valid_vid(dstate.term)) then
		local targ = terminal_build_argenv();
		dstate.term = launch_avfeed(targ, "terminal",
		function(source, status)
			if (status.kind == "preroll") then
				update_size();
				set_font();
				target_graphmode(dstate.term, gconfig_get("dt_opa"));
				target_updatehandler(source, termh);
			end
		end
		);
		if (not valid_vid(dstate.term)) then
			return;
		end
		dstate.disp = disp;
		dstate.disp.lock_override = true;
	end

-- reattach to different output on switch or resize
	if (dstate.disp ~= active_display()) then
		dstate.disp.lock_override = false;
		dstate.disp = active_display();
		dstate.disp.lock_override = true;
		target_displayhint(dstate.term, neww, newh, 0, dstate.disp.disptbl);
		rendertarget_attach(active_display(true), dstate.term, RENDERTARGET_DETACH);
		update_size();
	end

-- put us in the "special" overlay order range
	order_image(dstate.term, 65532);

-- center at hidden state non-dominant axis, account for user- padding
-- do this the safe "all options rather than math" way due to the possible
-- switching of user- config between spawns
	if (dstate.dir_x ~= 0) then
		neww = neww + dstate.ofs;
		if (dstate.dir_x > 0) then
			move_image(dstate.term, -neww, 0.5 * (disp.height - newh));
			nudge_image(dstate.term, neww, 0, gconfig_get("animation"));
		else
			move_image(dstate.term, disp.width, 0.5 * (disp.height - newh));
			nudge_image(dstate.term, -neww, 0, gconfig_get("animation"));
		end
	elseif (dstate.dir_y ~= 0) then
		newh = newh + dstate.ofs;
-- top
		if (dstate.dir_y > 0) then
			move_image(dstate.term, 0.5 * (disp.width - neww), -newh);
			nudge_image(dstate.term, 0, newh, gconfig_get("animation"));
 -- bottom
		else
			move_image(dstate.term, 0.5 * (disp.width - neww), disp.height);
			nudge_image(dstate.term, 0, -newh, gconfig_get("animation"));
		end
	end

	blend_image(dstate.term, 1.0, gconfig_get("animation"));
	dstate.active = true;
	dispatch_toggle(ldisp);

-- since we don't have clipboard etc. mapping available we just toggle
-- mouse input mode
	target_input(dstate.term, {
		kind = "digital", label = "MOUSE_FORWARD",
		translated = true,
		active = true,
		devid = 8, subid = 8
	});

	local v, f, w, s = mouse_lockto(dstate.term,
		function(rx, ry, x, y, state, ind, act)
			local props = image_surface_properties(dstate.term);
			x = x - props.x;
			y = y - props.y;
			if (ind) then
				target_input(dstate.term, {
					kind = "digital", mouse = true,
					active = act, devid = 0, subid = ind
				});
			else
				local iotbl = {
				kind = "analog", mouse = true,
				relative = false, devid = 0, subid = 0,
				samples = {x}
				};
				target_input(dstate.term, iotbl);
				iotbl.subid = 1;
				iotbl.samples[1] = y;
				target_input(dstate.term, iotbl);
			end
		end, nil
	);
	dstate.lock = {v, f, w, s};
	target_displayhint(dstate.term, 0, 0, 0);
end

menus_register("global", "tools",
{
	name = "dterm",
	label = "Drop-down Terminal",
	kind = "action",
	description = "A locked-input 'quake-style' terminal window",
	handler = dterm
});

menus_register("global", "settings/tools",
{
	name = "dterm",
	label = "Dropdown Terminal",
	kind = "action",
	submenu = true,
	description = "Change how the dropdown terminal behaves",
	handler = dterm_cfg
});

{'repo_name': 'letoram/durden', 'stars': '115', 'repo_language': 'Lua', 'file_name': 'README.md', 'mime_type': 'text/plain', 'hash': -7843444683587993708, 'source_dataset': 'data'}


require 'markaby'

module Markaby
  module Rails
    class TemplateHandler
      class << self
        def register!(options={})
          self.options = options
          ActionView::Template.register_template_handler(:mab, new)
        end

        # TODO: Do we need this?
        # Default format used by Markaby
        # class_attribute :default_format
        # self.default_format = :html

        def options
          @options ||= {}
        end

        def options=(val)
          self.options.merge!(val)
          self.options
        end
      end

      def call(template)
        <<-CODE
          Markaby::Builder.new(Markaby::Rails::TemplateHandler.options, self) do
            #{template.source}
          end.to_s
        CODE
      end
    end
  end
end

{'repo_name': 'markaby/markaby', 'stars': '127', 'repo_language': 'Ruby', 'file_name': 'builder.rb', 'mime_type': 'text/x-ruby', 'hash': -1262880735801639213, 'source_dataset': 'data'}


/*
Description: Magula style for highligh.js
Author: Ruslan Keba <rukeba@gmail.com>
Website: http://rukeba.com/
Version: 1.0
Date: 2009-01-03
Music: Aphex Twin / Xtal
*/

.hljs {
  display: block;
  overflow-x: auto;
  padding: 0.5em;
  background-color: #f4f4f4;
}

.hljs,
.hljs-subst {
  color: black;
}

.hljs-string,
.hljs-title,
.hljs-symbol,
.hljs-bullet,
.hljs-attribute,
.hljs-addition,
.hljs-variable,
.hljs-template-tag,
.hljs-template-variable {
  color: #050;
}

.hljs-comment,
.hljs-quote {
  color: #777;
}

.hljs-number,
.hljs-regexp,
.hljs-literal,
.hljs-type,
.hljs-link {
  color: #800;
}

.hljs-deletion,
.hljs-meta {
  color: #00e;
}

.hljs-keyword,
.hljs-selector-tag,
.hljs-doctag,
.hljs-title,
.hljs-section,
.hljs-built_in,
.hljs-tag,
.hljs-name {
  font-weight: bold;
  color: navy;
}

.hljs-emphasis {
  font-style: italic;
}

.hljs-strong {
  font-weight: bold;
}

{'repo_name': 'gitpitch/gitpitch', 'stars': '5144', 'repo_language': 'Java', 'file_name': 'reveal.orig.js', 'mime_type': 'text/plain', 'hash': 3775309763249595629, 'source_dataset': 'data'}


namespace PcapDotNet.Packets.IpV4
{
    /// <summary>
    /// A Transport layer under an IP layer.
    /// Must supply information about the Transport layer checksum.
    /// </summary>
    public interface IIpNextTransportLayer : IIpNextLayer
    {
        /// <summary>
        /// Checksum is the 16-bit one's complement of the one's complement sum of a pseudo header of information from the IP header,
        /// the Transport header, and the data, padded with zero octets at the end (if necessary) to make a multiple of two octets.
        /// If null is given, the Checksum will be calculated to be correct according to the data.
        /// </summary>
        ushort? Checksum { get; set; }

        /// <summary>
        /// Whether the checksum should be calculated.
        /// Can be false in UDP because the checksum is optional. false means that the checksum will be left zero.
        /// </summary>
        bool CalculateChecksum { get; }

        /// <summary>
        /// The offset in the layer where the checksum should be written.
        /// </summary>
        int ChecksumOffset { get; }

        /// <summary>
        /// Whether the checksum is optional in the layer.
        /// </summary>
        bool IsChecksumOptional { get; }
    }
}

{'repo_name': 'PcapDotNet/Pcap.Net', 'stars': '407', 'repo_language': 'C#', 'file_name': 'PcapDotNet.shfbproj', 'mime_type': 'text/xml', 'hash': -3470332095659997648, 'source_dataset': 'data'}


<?xml version='1.0' encoding='UTF-8'?>
<!DOCTYPE map
  PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp Map Version 1.0//EN"
         "http://java.sun.com/products/javahelp/map_1_0.dtd">

<map version="1.0">
	<mapID target="pscanalpha-icon" url="contents/images/pscan-alpha.png" />
    <mapID target="pscanalpha" url="contents/pscanalpha.html" />
</map>

{'repo_name': 'zaproxy/zap-extensions', 'stars': '429', 'repo_language': 'Java', 'file_name': 'PassiveScanTestHelper.java', 'mime_type': 'text/x-java', 'hash': 2262683061713982745, 'source_dataset': 'data'}


var isObjectLike = require('../internal/isObjectLike'),
    isPlainObject = require('./isPlainObject');

/**
 * Checks if `value` is a DOM element.
 *
 * @static
 * @memberOf _
 * @category Lang
 * @param {*} value The value to check.
 * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
 * @example
 *
 * _.isElement(document.body);
 * // => true
 *
 * _.isElement('<body>');
 * // => false
 */
function isElement(value) {
  return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
}

module.exports = isElement;

{'repo_name': 'liyuechun/JavaScript30-liyuechun', 'stars': '210', 'repo_language': 'HTML', 'file_name': 'README.md', 'mime_type': 'text/html', 'hash': 6007606486622520142, 'source_dataset': 'data'}


<!doctype html>

<title>CodeMirror: Sublime Text bindings demo</title>
<meta charset="utf-8"/>
<link rel=stylesheet href="../doc/docs.css">

<link rel="stylesheet" href="../lib/codemirror.css">
<link rel="stylesheet" href="../addon/fold/foldgutter.css">
<link rel="stylesheet" href="../addon/dialog/dialog.css">
<link rel="stylesheet" href="../theme/monokai.css">

CodeMirror

Home

Manual

Code

Sublime bindings

Sublime Text bindings demo

The sublime keymap defines many Sublime Text-specific
bindings for CodeMirror. See the code below for an overview.

Enable the keymap by
loading keymap/sublime.js
and setting
the keyMap
option to "sublime".

(A lot of the search functionality is still missing.)

{'repo_name': 'crmeb/CRMEB', 'stars': '2615', 'repo_language': 'JavaScript', 'file_name': '前端下载地址.md', 'mime_type': 'text/plain', 'hash': 3689019060046222221, 'source_dataset': 'data'}


/*
  ==============================================================================

    MadMapperModule.cpp
    Created: 28 Feb 2019 10:33:28pm
    Author:  bkupe

  ==============================================================================
*/

#include "MadMapperModule.h"

MadMapperModule::MadMapperModule() :
	GenericOSCQueryModule("MadMapper",8010)
{
}

MadMapperModule::~MadMapperModule()
{
}

{'repo_name': 'benkuper/Chataigne', 'stars': '183', 'repo_language': 'C++', 'file_name': 'hidapi.h', 'mime_type': 'text/x-c', 'hash': 94993072714267899, 'source_dataset': 'data'}


---
Title: Verordnung über die quantitative Analyse von ternären Textilfasergemischen
jurabk: AnalyseV 2
layout: default
origslug: analysev_2
slug: analysev_2

---

# Verordnung über die quantitative Analyse von ternären Textilfasergemischen (AnalyseV 2)

Ausfertigungsdatum
:   1974-07-29

Fundstelle
:   BGBl I: 1974, 1609

## Eingangsformel

Auf Grund des § 13 Nr. 1 des Textilkennzeichnungsgesetzes in der
Fassung der Bekanntmachung vom 25. August 1972 (Bundesgesetzbl. I S.
1545) wird mit Zustimmung des Bundesrates verordnet:

## § 1

Bei der amtlichen Prüfung einer Rohstoffgehaltsangabe (§ 1 Abs. 1 des
Textilkennzeichnungsgesetzes) sind zur Feststellung der
Rohstoffzusammensetzung von Textilerzeugnissen bei ternären
Textilfasergemischen

1.  die in Anhang I der Richtlinie des Rates vom 17. Juli 1972 zur
    Angleichung der Rechtsvorschriften der Mitgliedstaaten über bestimmte
    Methoden der quantitativen Analyse von binären Textilfasergemischen
    (Amtsblatt der Europäischen Gemeinschaften Nr. L 173 S. 1)
    niedergelegten Bestimmungen zur Vorbereitung der Vorproben und der
    Analysenproben und

2.  die in Anhang I der Richtlinie des Rates vom 26. Februar 1973 zur
    Angleichung der Rechtsvorschriften der Mitgliedstaaten über die
    quantitative Analyse von ternären Textilfasergemischen (Amtsblatt der
    Europäischen Gemeinschaften Nr. L 83 S. 1) festgelegten Vorschriften
    über die quantitative Analyse von ternären Textilfasergemischen

anzuwenden. Hierbei tritt in Anhang I Nr. 7 der Richtlinie vom 17.
Juli 1972 an die Stelle des Artikels 9 der Richtlinie des Rates vom
26\. Juli 1971 über die Angleichung der Rechtsvorschriften der
Mitgliedstaaten für die Bezeichnung von Textilerzeugnissen (Amtsblatt
der Europäischen Gemeinschaften Nr. L 185 S. 16) der § 8 Abs. 1 des
Textilkennzeichnungsgesetzes; in Anhang I der Richtlinie vom 26.
Februar 1973 tritt im zwölften Absatz der Einleitung an die Stelle des
Anhangs II der Richtlinie vom 26. Juli 1971 die Anlage 2 des
Textilkennzeichnungsgesetzes und in Nummer I. 6. an die Stelle des
Artikels 12 (2 d) der gleichen Richtlinie der § 6 Abs. 1
Nr. 5              des Textilkennzeichnungsgesetzes.

## § 2

Zur quantitativen Analyse von ternären Textilfasergemischen hat die
Prüfstelle eine geeignete Methode der quantitativen Analyse
anzuwenden; dabei sind die in den Anhängen II und III der Richtlinie
vom 26. Februar 1973 gegebenen Beispiele für die Berechnung der
prozentualen Anteile bestimmter ternärer Fasergemische sowie für
ternäre Fasergemischtypen, die mit Hilfe der in Anhang II der
Richtlinie vom 17. Juli 1972 festgelegten Methoden für binäre
Fasergemische analysiert werden können, zu beachten.

## § 3

Die Prüfstelle hat in ihrem Bericht über die Analyse alle in Anhang I
der Richtlinie vom 26. Februar 1973 unter Nummer V aufgezählten
Angaben aufzuführen.

## § 4

Diese Verordnung gilt nach § 14 des Dritten Überleitungsgesetzes vom
4\. Januar 1952 (Bundesgesetzbl. I S. 1) in Verbindung mit § 16 des
Textilkennzeichnungsgesetzes auch im Land Berlin.

## § 5

Diese Verordnung tritt am Tage nach ihrer Verkündung in Kraft.

## Schlußformel

Der Bundesminister für Wirtschaft

{'repo_name': 'bundestag/gesetze', 'stars': '1470', 'repo_language': 'None', 'file_name': 'index.md', 'mime_type': 'text/plain', 'hash': -371270895111542199, 'source_dataset': 'data'}


<template>
	<view class="segmented-control" :class="styleType" :style="wrapStyle">
		<view v-for="(item, index) in values" class="segmented-control-item" :class="[{ unactive: index !== current }, styleType]" :key="index" :style="index === current ? activeStyle : itemStyle"
		    @click="onClick(index)">
			<text style="color: #fff;font-size: 30upx;">{{item}}</text>
		</view>
	</view>
</template>

<script>
	export default {
		name: 'segmented-control',
		props: {
			current: {
				type: Number,
				default: 0
			},
			values: {
				type: Array,
				default () {
					return [];
				}
			},
			activeColor: {
				type: String,
				default: '#3495e7'
			},
			styleType: {
				type: String,
				default: 'text'
			},
			isDisabled: {
				type: Boolean,
				default: false
			}
		},
		computed: {
			wrapStyle() {
				let styleString = '';
				switch (this.styleType) {
					case 'text':
						styleString = `border:0;`;
						break;
					default:
						styleString = `border-color: ${this.activeColor}`;
						break;
				}
				return styleString;
			},
			itemStyle() {
				let styleString = '';
				switch (this.styleType) {
					case 'text':
						styleString = `color:#494949;border-left:0;`;
						break;
					default:
						styleString = `color:${this.activeColor};border-color:${this.activeColor};`;
						break;
				}
				return styleString;
			},
			activeStyle() {
				let styleString = '';
				switch (this.styleType) {
					case 'text':
						styleString = `color:${this.activeColor};border-left:0;border-bottom-style:solid;`;
						break;
					default:
						styleString = `color:#fff;border-color:${this.activeColor};background-color:${this.activeColor}`;
						break;
				}
				return styleString;
			}
		},
		methods: {
			onClick(index) {
				if(this.isDisabled) {
					return
				}
				if (this.current !== index) {
					this.current = index;
					this.$emit('clickItem', index);
				}
			}
		},
	}
</script>

<style>
	.segmented-control {
		display: flex;
		flex-direction: row;
		justify-content: center;
		width: 100%;
		font-size: 30upx;
		border-radius: 12upx;
		box-sizing: border-box;
		margin: 0 auto;
		overflow: hidden;
		background: #1b1624;
	}

	.segmented-control.button {
		border: 1upx solid;
	}

	.segmented-control.text {
		border: 0;
        border-radius: 0;
	}

	.segmented-control-item {
		flex: 1;
		text-align: center;
		line-height: 70upx;
		box-sizing: border-box;
	}

	.segmented-control-item.button {
		border-left: 1upx solid;
	}

	.segmented-control-item.text {
		border-left: 0;
	}

	.segmented-control-item.unactive {
		border-bottom: 1upx solid;
	}

	.segmented-control-item:first-child {
		border-left-width: 0;
	}
</style>

{'repo_name': 'klren0312/ironInfoWeapp', 'stars': '207', 'repo_language': 'JavaScript', 'file_name': 'request.js', 'mime_type': 'text/plain', 'hash': -7211317823729895229, 'source_dataset': 'data'}


#include "stdafx.h"
#include "AgoraAudInputManager.h"

CAgoraAudInputManager::CAgoraAudInputManager()
	: m_ptrDeviceManager(NULL)
	, m_lpCollection(NULL)
	, m_bTestingOn(FALSE)
{
}

CAgoraAudInputManager::~CAgoraAudInputManager()
{
	Close();
}

BOOL CAgoraAudInputManager::Create(IRtcEngine *lpRtcEngine)
{
	m_ptrDeviceManager = new AAudioDeviceManager(lpRtcEngine);
	if (!m_ptrDeviceManager)
		return FALSE;

	if (m_ptrDeviceManager->get() == NULL) {
		delete m_ptrDeviceManager;
		m_ptrDeviceManager = NULL;
		return FALSE;
	}

	m_lpCollection = (*m_ptrDeviceManager)->enumerateRecordingDevices();
	if (m_lpCollection == NULL) {
		delete m_ptrDeviceManager;
		m_ptrDeviceManager = NULL;
	}

	return m_lpCollection != NULL ? TRUE : FALSE;
}

void CAgoraAudInputManager::Close()
{
	if (m_lpCollection != NULL){
		m_lpCollection->release();
		m_lpCollection = NULL;
	}

	if (m_ptrDeviceManager) {
		if (m_ptrDeviceManager != NULL) {
			if (m_ptrDeviceManager->get())
				m_ptrDeviceManager->release();
			delete m_ptrDeviceManager;
			m_ptrDeviceManager = NULL;
		}
	}
}

UINT CAgoraAudInputManager::GetVolume()
{
	int nVol = 0;

	if (m_ptrDeviceManager && *m_ptrDeviceManager != NULL)
		(*m_ptrDeviceManager)->getRecordingDeviceVolume(&nVol);

	return (UINT)nVol;
}

BOOL CAgoraAudInputManager::SetVolume(UINT nVol)
{
	int nRet = -1;

	if (m_ptrDeviceManager && *m_ptrDeviceManager != NULL)
		nRet = (*m_ptrDeviceManager)->setRecordingDeviceVolume((int)nVol);

	return nRet == 0 ? TRUE : FALSE;
}

UINT CAgoraAudInputManager::GetDeviceCount()
{
	if (m_lpCollection != NULL)
		return (UINT)m_lpCollection->getCount();

	return 0;
}

BOOL CAgoraAudInputManager::GetDevice(UINT nIndex, CString &rDeviceName, CString &rDeviceID)
{
	CHAR szDeviceName[MAX_DEVICE_ID_LENGTH];
	CHAR szDeviceID[MAX_DEVICE_ID_LENGTH];

	ASSERT(nIndex < GetDeviceCount());

	if (nIndex >= GetDeviceCount())
		return FALSE;

	if (m_lpCollection == NULL)
		return FALSE;

	int nRet = m_lpCollection->getDevice(nIndex, szDeviceName, szDeviceID);
	if (nRet != 0)
		return FALSE;

#ifdef UNICODE
	::MultiByteToWideChar(CP_UTF8, 0, szDeviceName, -1, rDeviceName.GetBuffer(MAX_DEVICE_ID_LENGTH), MAX_DEVICE_ID_LENGTH);
	::MultiByteToWideChar(CP_UTF8, 0, szDeviceID, -1, rDeviceID.GetBuffer(MAX_DEVICE_ID_LENGTH), MAX_DEVICE_ID_LENGTH);

	rDeviceName.ReleaseBuffer();
	rDeviceID.ReleaseBuffer();
#else
	strDeviceName = szDeviceName;
	strDeviceID = szDeviceID;
#endif

	return TRUE;
}

CString CAgoraAudInputManager::GetCurDeviceID()
{
	CString		str;
	CHAR		szDeviceID[MAX_DEVICE_ID_LENGTH];
	if (!m_ptrDeviceManager || *m_ptrDeviceManager == NULL)
		return _T("");

	(*m_ptrDeviceManager)->getRecordingDevice(szDeviceID);

#ifdef UNICODE
	::MultiByteToWideChar(CP_UTF8, 0, szDeviceID, -1, str.GetBuffer(MAX_DEVICE_ID_LENGTH), MAX_DEVICE_ID_LENGTH);
	str.ReleaseBuffer();
#else
	strDeviceName = szDeviceID;
#endif

	return str;
}

BOOL CAgoraAudInputManager::SetCurDevice(LPCTSTR lpDeviceID)
{
	if (*m_ptrDeviceManager == NULL)
		return FALSE;

#ifdef UNICODE
	CHAR szDeviceID[128];
	::WideCharToMultiByte(CP_ACP, 0, lpDeviceID, -1, szDeviceID, 128, NULL, NULL);
	int nRet = (*m_ptrDeviceManager)->setRecordingDevice(szDeviceID);
#else
	int nRet = (*m_ptrDeviceManager)->setRecordingDevice(lpDeviceID);
#endif

	return nRet == 0 ? TRUE : FALSE;
}

void CAgoraAudInputManager::TestAudInputDevice(HWND hMsgWnd, BOOL bTestOn)
{
	if (m_ptrDeviceManager == NULL)
		return;

	if (bTestOn && !m_bTestingOn) {

		if (!CAgoraObject::GetAgoraObject()->IsJoinChannel()){
			m_hOldMsgWnd = CAgoraObject::GetAgoraObject()->GetMsgHandlerWnd();
			CAgoraObject::GetAgoraObject()->SetMsgHandlerWnd(hMsgWnd);
		}

		IRtcEngine *lpRtcEngine = CAgoraObject::GetEngine();
		RtcEngineParameters rep(*lpRtcEngine);
		rep.enableAudioVolumeIndication(1000, 10, true);
		(*m_ptrDeviceManager)->startRecordingDeviceTest(1000);
	}
	else if (!bTestOn && m_bTestingOn){
		if (!CAgoraObject::GetAgoraObject()->IsJoinChannel())
			CAgoraObject::GetAgoraObject()->SetMsgHandlerWnd(m_hOldMsgWnd);

		(*m_ptrDeviceManager)->stopRecordingDeviceTest();
	}

	m_bTestingOn = bTestOn;

}

{'repo_name': 'AgoraIO/Basic-Video-Broadcasting', 'stars': '128', 'repo_language': 'C++', 'file_name': 'index.html', 'mime_type': 'text/html', 'hash': 809631347256111977, 'source_dataset': 'data'}


@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix dc: <http://purl.org/dc/elements/1.1/> .
@prefix oa: <http://www.w3.org/ns/oa#> .
@prefix dctypes: <http://purl.org/dc/dcmitype/> .
@prefix as: <http://www.w3.org/ns/activitystreams#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix schema: <http://schema.org/> .

<http://example.org/anno42> a oa:Annotation ;
    oa:hasBody <http://example.org/note1> ;
    oa:hasTarget [
        oa:hasSource <http://example.org/page1> ;
        oa:hasState [
            a oa:TimeState ;
            oa:sourceDateStart "2015-07-20T13:30:00Z" ;
            oa:sourceDateEnd   "2015-07-21T19:45:00Z" ] ] .

{'repo_name': 'w3c/web-annotation', 'stars': '103', 'repo_language': 'HTML', 'file_name': 'Overview.html', 'mime_type': 'text/html', 'hash': 9081605353931838394, 'source_dataset': 'data'}


// evalWithBindings code can assign to the bindings.
var g = newGlobal();
var dbg = new Debugger(g);
var hits = 0;
dbg.onDebuggerStatement = function (frame) {
    assertEq(frame.evalWithBindings("for (i = 0; i < 5; i++) {}  i;", {i: 10}).return, 5);
    hits++;
};

g.eval("debugger;");
assertEq("i" in g, false);
assertEq(hits, 1);

{'repo_name': 'jxcore/jxcore', 'stars': '2265', 'repo_language': 'JavaScript', 'file_name': 'testencce.bat', 'mime_type': 'text/x-msdos-batch', 'hash': -9053477669759524513, 'source_dataset': 'data'}


Qt 5.9 introduces many new features and improvements as well as bugfixes
over the 5.8.x series. For more details, refer to the online documentation
included in this distribution. The documentation is also available online:

http://doc.qt.io/qt-5/index.html

The Qt version 5.9 series is binary compatible with the 5.8.x series.
Applications compiled for 5.8 will continue to run with 5.9.

Some of the changes listed in this file include issue tracking numbers
corresponding to tasks in the Qt Bug Tracker:

https://bugreports.qt.io/

Each of these identifiers can be entered in the bug tracker to obtain more
information about a particular change.

Third-Party Code
----------------

- Updated assimp 3rdparty library to version 3.3.1

Important Changes
-----------------

 - Added zooming with the mouse scroll wheel to
   QFirstPersonCameraController and QOrbitCameraController.
 - Updated assimp scene importer to load simple keyframe and morphing animations.
 - New Animation module supporting key framed animations.
 - New Scene2D module supporting rendering Qt Quick within Qt 3D scenes and
   interacting with them.
 - Level of details support.
 - 2D distance field and 3D geometric text support.
 - Physics Based Rendering support.

Render
------

 - Added new QBufferCapture frame graph node to support QBuffer readback.
 - Added new QMemoryBarrier frame graph node.
 - Added EnvironmentLight type for environment mapping. Works well with PBR materials
   in Qt3DExtras to give realistic lighting and specular reflections.
 - Added support for level of detail with the QLevelOfDetail component and helpers.
   Allows switching based upon distance from camera or projected screen size.
 - Lots of performance and stability fixes.

Scene2D
-------

 - Added new Scene2D module, which allows rendering Qt Quick content to Qt 3D
   texture and using it as part of a 3D scene.

Animation
---------

 - Added technology preview of new Animation module.
 - Added new animation classes to support loading animations using assimp scene loader.
 - Added support for defining key framed animations or loading them from file.
 - Added an animation export script for Blender
 - Added classes to play back simple key frame animations and apply the animation to
   arbitrary QObjects or QNodes.
 - Added classes to support play back and blending of key frame animations. This allows
   dynamically combining libraries of animation clips at runtime.

Extras
------

 - Added support for Physically Based Rendering with QMetalRough and QTexturedMetalRough
   materials.
 - Added new QText2Entity for distance field based 2D planar text in 3D scenes.
 - Added QExtrudedTextMesh and QExtrudedTextGeometry classes to support 3D text rendering.
 - Added new QMorphPhongMaterial to support mesh morphing and phong lighting model.
 - Added new QTextureMaterial to support simple unlit textured geometry.
 - Improved API consistency between QML and C++

Examples
--------

 - Added new simple custom material and advanced custom material examples.
 - Modified multiviewport example rendered content.
 - Added new Scene2D example to showcase the new feature.

{'repo_name': 'qt/qt3d', 'stars': '127', 'repo_language': 'C++', 'file_name': 'FindWrapAssimp.cmake', 'mime_type': 'text/plain', 'hash': -5353887645557823132, 'source_dataset': 'data'}


version: 1
task_definition:
  task_execution_role: ecsTaskExecutionRole
  ecs_network_mode: awsvpc
  task_size:
    mem_limit: 0.5GB
    cpu_limit: 256
  services:
    threeleaf-backend:
      secrets:
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/node_env
          name: NODE_ENV
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_uuid
          name: APP_UUID
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_salt
          name: APP_SALT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_mail_from
          name: APP_MAIL_FROM
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_domain
          name: APP_SESSION_DOMAIN
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_secret
          name: APP_SESSION_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_timeout
          name: APP_SESSION_TIMEOUT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_refresh_secret
          name: APP_SESSION_REFRESH_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_refresh_timeout
          name: APP_SESSION_REFRESH_TIMEOUT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_password_reset_secret
          name: APP_SESSION_PASSWORD_RESET_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_password_reset_timeout
          name: APP_SESSION_PASSWORD_RESET_TIMEOUT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_verify_secret
          name: APP_SESSION_VERIFY_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_session_verify_timeout
          name: APP_SESSION_VERIFY_TIMEOUT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_facebook_app_id
          name: APP_FACEBOOK_APP_ID
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_facebook_app_secret
          name: APP_FACEBOOK_APP_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_api_key
          name: APP_AWS_API_KEY
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_secret_key
          name: APP_AWS_SECRET_KEY
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_region
          name: APP_AWS_REGION
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_s3_bucket_name
          name: APP_AWS_S3_BUCKET_NAME
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_pinpoint_smtp_host
          name: APP_AWS_PINPOINT_SMTP_HOST
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_pinpoint_smtp_port
          name: APP_AWS_PINPOINT_SMTP_PORT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_pinpoint_smtp_user
          name: APP_AWS_PINPOINT_SMTP_USER
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_aws_pinpoint_smtp_secret
          name: APP_AWS_PINPOINT_SMTP_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_port
          name: APP_PORT
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_host
          name: APP_HOST
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_logger_level
          name: APP_LOGGER_LEVEL
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_home_api_attom_data_api_key
          name: APP_HOME_API_ATTOM_DATA_API_KEY
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_google_api_secret
          name: APP_GOOGLE_API_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_api2pdf_secret
          name: APP_API2PDF_SECRET
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_database_secret_url
          name: APP_DATABASE_SECRET_URL
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_home_api_foxyai_api_key
          name: APP_HOME_API_FOXYAI_API_KEY
        - value_from: arn:aws:ssm:us-east-2:180122916419:parameter/dev/threeleaf/app_firebase_secret
          name: APP_FIREBASE_SECRET
run_params:
  network_configuration:
    awsvpc_configuration:
      subnets:
        - "subnet-003ca58b53fce6ff1"
        - "subnet-0b33d7fcc07d0e794"
      security_groups:
        - "sg-03b4344e485235887"
      assign_public_ip: ENABLED

{'repo_name': 'neoteric-eu/nestjs-auth', 'stars': '106', 'repo_language': 'TypeScript', 'file_name': 'index.html', 'mime_type': 'text/html', 'hash': -6246383663882659382, 'source_dataset': 'data'}


<?xml version="1.0"?>
<!--
/**
 * Copyright © Magento, Inc. All rights reserved.
 * See COPYING.txt for license details.
 */
-->
<routes xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:noNamespaceSchemaLocation="urn:magento:module:Magento_Webapi:etc/webapi.xsd">
    <route url="/V1/taxRates" method="POST">
        <service class="Magento\Tax\Api\TaxRateRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRates/:rateId" method="GET">
        <service class="Magento\Tax\Api\TaxRateRepositoryInterface" method="get"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRates" method="PUT">
        <service class="Magento\Tax\Api\TaxRateRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRates/:rateId" method="DELETE">
        <service class="Magento\Tax\Api\TaxRateRepositoryInterface" method="deleteById"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRates/search" method="GET">
        <service class="Magento\Tax\Api\TaxRateRepositoryInterface" method="getList"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRules" method="POST">
        <service class="Magento\Tax\Api\TaxRuleRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRules" method="PUT">
        <service class="Magento\Tax\Api\TaxRuleRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRules/:ruleId" method="DELETE">
        <service class="Magento\Tax\Api\TaxRuleRepositoryInterface" method="deleteById"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRules/:ruleId" method="GET">
        <service class="Magento\Tax\Api\TaxRuleRepositoryInterface" method="get"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxRules/search" method="GET">
        <service class="Magento\Tax\Api\TaxRuleRepositoryInterface" method="getList"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxClasses" method="POST">
        <service class="Magento\Tax\Api\TaxClassRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxClasses/:taxClassId" method="GET">
        <service class="Magento\Tax\Api\TaxClassRepositoryInterface" method="get"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxClasses/:classId" method="PUT">
        <service class="Magento\Tax\Api\TaxClassRepositoryInterface" method="save"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxClasses/:taxClassId" method="DELETE">
        <service class="Magento\Tax\Api\TaxClassRepositoryInterface" method="deleteById"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
    <route url="/V1/taxClasses/search" method="GET">
        <service class="Magento\Tax\Api\TaxClassRepositoryInterface" method="getList"/>
        <resources>
            <resource ref="Magento_Tax::manage_tax"/>
        </resources>
    </route>
</routes>

{'repo_name': 'magento/graphql-ce', 'stars': '136', 'repo_language': 'PHP', 'file_name': 'report.phtml', 'mime_type': 'text/x-php', 'hash': 184014329094193943, 'source_dataset': 'data'}


<?php

declare(strict_types=1);

namespace PHPHtmlParser\Exceptions\Tag;

/**
 * Class AttributeNotFoundException.
 */
class AttributeNotFoundException extends \Exception
{
}

{'repo_name': 'paquettg/php-html-parser', 'stars': '1766', 'repo_language': 'PHP', 'file_name': 'big.html', 'mime_type': 'text/html', 'hash': -8514647176955555749, 'source_dataset': 'data'}


define( [ "qunit", "jquery" ], function( QUnit, $ ) {

var originalBase,
	originalBaseSupport,
	phonyDirectory = "/foo/bar/baz/";

QUnit.module( "Tabs extension", {
	setup: function() {
		originalBaseSupport = $.support.dynamicBaseTag;
		$.support.dynamicBaseTag = true;
		originalBase = $.mobile.base.element().attr( "href" );
		$.mobile.base.set( phonyDirectory );
	},
	teardown: function() {
		$.support.dynamicBaseTag = originalBaseSupport;
		$.mobile.base.set( originalBase );
	}
} );

QUnit.test( "_isLocal() correctly identifies URLs as local/non-local", function( assert ) {

	var _isLocal = $.ui.tabs.prototype._isLocal;

	assert.deepEqual( _isLocal( $( "" )[ 0 ] ), true,
		"'#some-id' identified as local" );

	assert.deepEqual( _isLocal( $( "" )[ 0 ] ), true,
		"'" + phonyDirectory + "#some-other-id' defined as local" );

} );

} );

{'repo_name': 'jquery/jquery-mobile', 'stars': '9898', 'repo_language': 'JavaScript', 'file_name': 'path.js', 'mime_type': 'text/x-c', 'hash': -5227550648304740252, 'source_dataset': 'data'}


// This file is part of meshoptimizer library; see meshoptimizer.h for version/license details
#include "meshoptimizer.h"

#include <assert.h>
#include <math.h>
#include <string.h>

// This work is based on:
// Pedro Sander, Diego Nehab and Joshua Barczak. Fast Triangle Reordering for Vertex Locality and Reduced Overdraw. 2007
namespace meshopt
{

static void calculateSortData(float* sort_data, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_positions_stride, const unsigned int* clusters, size_t cluster_count)
{
	size_t vertex_stride_float = vertex_positions_stride / sizeof(float);

	float mesh_centroid[3] = {};

	for (size_t i = 0; i < index_count; ++i)
	{
		const float* p = vertex_positions + vertex_stride_float * indices[i];

		mesh_centroid[0] += p[0];
		mesh_centroid[1] += p[1];
		mesh_centroid[2] += p[2];
	}

	mesh_centroid[0] /= index_count;
	mesh_centroid[1] /= index_count;
	mesh_centroid[2] /= index_count;

	for (size_t cluster = 0; cluster < cluster_count; ++cluster)
	{
		size_t cluster_begin = clusters[cluster] * 3;
		size_t cluster_end = (cluster + 1 < cluster_count) ? clusters[cluster + 1] * 3 : index_count;
		assert(cluster_begin < cluster_end);

		float cluster_area = 0;
		float cluster_centroid[3] = {};
		float cluster_normal[3] = {};

		for (size_t i = cluster_begin; i < cluster_end; i += 3)
		{
			const float* p0 = vertex_positions + vertex_stride_float * indices[i + 0];
			const float* p1 = vertex_positions + vertex_stride_float * indices[i + 1];
			const float* p2 = vertex_positions + vertex_stride_float * indices[i + 2];

			float p10[3] = {p1[0] - p0[0], p1[1] - p0[1], p1[2] - p0[2]};
			float p20[3] = {p2[0] - p0[0], p2[1] - p0[1], p2[2] - p0[2]};

			float normalx = p10[1] * p20[2] - p10[2] * p20[1];
			float normaly = p10[2] * p20[0] - p10[0] * p20[2];
			float normalz = p10[0] * p20[1] - p10[1] * p20[0];

			float area = sqrtf(normalx * normalx + normaly * normaly + normalz * normalz);

			cluster_centroid[0] += (p0[0] + p1[0] + p2[0]) * (area / 3);
			cluster_centroid[1] += (p0[1] + p1[1] + p2[1]) * (area / 3);
			cluster_centroid[2] += (p0[2] + p1[2] + p2[2]) * (area / 3);
			cluster_normal[0] += normalx;
			cluster_normal[1] += normaly;
			cluster_normal[2] += normalz;
			cluster_area += area;
		}

		float inv_cluster_area = cluster_area == 0 ? 0 : 1 / cluster_area;

		cluster_centroid[0] *= inv_cluster_area;
		cluster_centroid[1] *= inv_cluster_area;
		cluster_centroid[2] *= inv_cluster_area;

		float cluster_normal_length = sqrtf(cluster_normal[0] * cluster_normal[0] + cluster_normal[1] * cluster_normal[1] + cluster_normal[2] * cluster_normal[2]);
		float inv_cluster_normal_length = cluster_normal_length == 0 ? 0 : 1 / cluster_normal_length;

		cluster_normal[0] *= inv_cluster_normal_length;
		cluster_normal[1] *= inv_cluster_normal_length;
		cluster_normal[2] *= inv_cluster_normal_length;

		float centroid_vector[3] = {cluster_centroid[0] - mesh_centroid[0], cluster_centroid[1] - mesh_centroid[1], cluster_centroid[2] - mesh_centroid[2]};

		sort_data[cluster] = centroid_vector[0] * cluster_normal[0] + centroid_vector[1] * cluster_normal[1] + centroid_vector[2] * cluster_normal[2];
	}
}

static void calculateSortOrderRadix(unsigned int* sort_order, const float* sort_data, unsigned short* sort_keys, size_t cluster_count)
{
	// compute sort data bounds and renormalize, using fixed point snorm
	float sort_data_max = 1e-3f;

	for (size_t i = 0; i < cluster_count; ++i)
	{
		float dpa = fabsf(sort_data[i]);

		sort_data_max = (sort_data_max < dpa) ? dpa : sort_data_max;
	}

	const int sort_bits = 11;

	for (size_t i = 0; i < cluster_count; ++i)
	{
		// note that we flip distribution since high dot product should come first
		float sort_key = 0.5f - 0.5f * (sort_data[i] / sort_data_max);

		sort_keys[i] = meshopt_quantizeUnorm(sort_key, sort_bits) & ((1 << sort_bits) - 1);
	}

	// fill histogram for counting sort
	unsigned int histogram[1 << sort_bits];
	memset(histogram, 0, sizeof(histogram));

	for (size_t i = 0; i < cluster_count; ++i)
	{
		histogram[sort_keys[i]]++;
	}

	// compute offsets based on histogram data
	size_t histogram_sum = 0;

	for (size_t i = 0; i < 1 << sort_bits; ++i)
	{
		size_t count = histogram[i];
		histogram[i] = unsigned(histogram_sum);
		histogram_sum += count;
	}

	assert(histogram_sum == cluster_count);

	// compute sort order based on offsets
	for (size_t i = 0; i < cluster_count; ++i)
	{
		sort_order[histogram[sort_keys[i]]++] = unsigned(i);
	}
}

static unsigned int updateCache(unsigned int a, unsigned int b, unsigned int c, unsigned int cache_size, unsigned int* cache_timestamps, unsigned int& timestamp)
{
	unsigned int cache_misses = 0;

	// if vertex is not in cache, put it in cache
	if (timestamp - cache_timestamps[a] > cache_size)
	{
		cache_timestamps[a] = timestamp++;
		cache_misses++;
	}

	if (timestamp - cache_timestamps[b] > cache_size)
	{
		cache_timestamps[b] = timestamp++;
		cache_misses++;
	}

	if (timestamp - cache_timestamps[c] > cache_size)
	{
		cache_timestamps[c] = timestamp++;
		cache_misses++;
	}

	return cache_misses;
}

static size_t generateHardBoundaries(unsigned int* destination, const unsigned int* indices, size_t index_count, size_t vertex_count, unsigned int cache_size, unsigned int* cache_timestamps)
{
	memset(cache_timestamps, 0, vertex_count * sizeof(unsigned int));

	unsigned int timestamp = cache_size + 1;

	size_t face_count = index_count / 3;

	size_t result = 0;

	for (size_t i = 0; i < face_count; ++i)
	{
		unsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, &cache_timestamps[0], timestamp);

		// when all three vertices are not in the cache it's usually relatively safe to assume that this is a new patch in the mesh
		// that is disjoint from previous vertices; sometimes it might come back to reference existing vertices but that frequently
		// suggests an inefficiency in the vertex cache optimization algorithm
		// usually the first triangle has 3 misses unless it's degenerate - thus we make sure the first cluster always starts with 0
		if (i == 0 || m == 3)
		{
			destination[result++] = unsigned(i);
		}
	}

	assert(result <= index_count / 3);

	return result;
}

static size_t generateSoftBoundaries(unsigned int* destination, const unsigned int* indices, size_t index_count, size_t vertex_count, const unsigned int* clusters, size_t cluster_count, unsigned int cache_size, float threshold, unsigned int* cache_timestamps)
{
	memset(cache_timestamps, 0, vertex_count * sizeof(unsigned int));

	unsigned int timestamp = 0;

	size_t result = 0;

	for (size_t it = 0; it < cluster_count; ++it)
	{
		size_t start = clusters[it];
		size_t end = (it + 1 < cluster_count) ? clusters[it + 1] : index_count / 3;
		assert(start < end);

		// reset cache
		timestamp += cache_size + 1;

		// measure cluster ACMR
		unsigned int cluster_misses = 0;

		for (size_t i = start; i < end; ++i)
		{
			unsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, &cache_timestamps[0], timestamp);

			cluster_misses += m;
		}

		float cluster_threshold = threshold * (float(cluster_misses) / float(end - start));

		// first cluster always starts from the hard cluster boundary
		destination[result++] = unsigned(start);

		// reset cache
		timestamp += cache_size + 1;

		unsigned int running_misses = 0;
		unsigned int running_faces = 0;

		for (size_t i = start; i < end; ++i)
		{
			unsigned int m = updateCache(indices[i * 3 + 0], indices[i * 3 + 1], indices[i * 3 + 2], cache_size, &cache_timestamps[0], timestamp);

			running_misses += m;
			running_faces += 1;

			if (float(running_misses) / float(running_faces) <= cluster_threshold)
			{
				// we have reached the target ACMR with the current triangle so we need to start a new cluster on the next one
				// note that this may mean that we add 'end` to destination for the last triangle, which will imply that the last
				// cluster is empty; however, the 'pop_back' after the loop will clean it up
				destination[result++] = unsigned(i + 1);

				// reset cache
				timestamp += cache_size + 1;

				running_misses = 0;
				running_faces = 0;
			}
		}

		// each time we reach the target ACMR we flush the cluster
		// this means that the last cluster is by definition not very good - there are frequent cases where we are left with a few triangles
		// in the last cluster, producing a very bad ACMR and significantly penalizing the overall results
		// thus we remove the last cluster boundary, merging the last complete cluster with the last incomplete one
		// there are sometimes cases when the last cluster is actually good enough - in which case the code above would have added 'end'
		// to the cluster boundary array which we need to remove anyway - this code will do that automatically
		if (destination[result - 1] != start)
		{
			result--;
		}
	}

	assert(result >= cluster_count);
	assert(result <= index_count / 3);

	return result;
}

} // namespace meshopt

void meshopt_optimizeOverdraw(unsigned int* destination, const unsigned int* indices, size_t index_count, const float* vertex_positions, size_t vertex_count, size_t vertex_positions_stride, float threshold)
{
	using namespace meshopt;

	assert(index_count % 3 == 0);
	assert(vertex_positions_stride > 0 && vertex_positions_stride <= 256);
	assert(vertex_positions_stride % sizeof(float) == 0);

	meshopt_Allocator allocator;

	// guard for empty meshes
	if (index_count == 0 || vertex_count == 0)
		return;

	// support in-place optimization
	if (destination == indices)
	{
		unsigned int* indices_copy = allocator.allocate<unsigned int>(index_count);
		memcpy(indices_copy, indices, index_count * sizeof(unsigned int));
		indices = indices_copy;
	}

	unsigned int cache_size = 16;

	unsigned int* cache_timestamps = allocator.allocate<unsigned int>(vertex_count);

	// generate hard boundaries from full-triangle cache misses
	unsigned int* hard_clusters = allocator.allocate<unsigned int>(index_count / 3);
	size_t hard_cluster_count = generateHardBoundaries(hard_clusters, indices, index_count, vertex_count, cache_size, cache_timestamps);

	// generate soft boundaries
	unsigned int* soft_clusters = allocator.allocate<unsigned int>(index_count / 3 + 1);
	size_t soft_cluster_count = generateSoftBoundaries(soft_clusters, indices, index_count, vertex_count, hard_clusters, hard_cluster_count, cache_size, threshold, cache_timestamps);

	const unsigned int* clusters = soft_clusters;
	size_t cluster_count = soft_cluster_count;

	// fill sort data
	float* sort_data = allocator.allocate<float>(cluster_count);
	calculateSortData(sort_data, indices, index_count, vertex_positions, vertex_positions_stride, clusters, cluster_count);

	// sort clusters using sort data
	unsigned short* sort_keys = allocator.allocate<unsigned short>(cluster_count);
	unsigned int* sort_order = allocator.allocate<unsigned int>(cluster_count);
	calculateSortOrderRadix(sort_order, sort_data, sort_keys, cluster_count);

	// fill output buffer
	size_t offset = 0;

	for (size_t it = 0; it < cluster_count; ++it)
	{
		unsigned int cluster = sort_order[it];
		assert(cluster < cluster_count);

		size_t cluster_begin = clusters[cluster] * 3;
		size_t cluster_end = (cluster + 1 < cluster_count) ? clusters[cluster + 1] * 3 : index_count;
		assert(cluster_begin < cluster_end);

		memcpy(destination + offset, indices + cluster_begin, (cluster_end - cluster_begin) * sizeof(unsigned int));
		offset += cluster_end - cluster_begin;
	}

	assert(offset == index_count);
}

{'repo_name': 'fegennari/3DWorld', 'stars': '366', 'repo_language': 'C++', 'file_name': 'COLL_OBJS2.TXT', 'mime_type': 'text/plain', 'hash': -614012524615046606, 'source_dataset': 'data'}


using System;
using System.Collections.Generic;
using Rubberduck.Interaction.Navigation;
using Rubberduck.Navigation.CodeExplorer;
using Rubberduck.VBEditor.Events;

namespace Rubberduck.UI.CodeExplorer.Commands
{
    public class OpenCommand : CodeExplorerCommandBase
    {
        private static readonly Type[] ApplicableNodes =
        {
            typeof(CodeExplorerProjectViewModel),
            typeof(CodeExplorerCustomFolderViewModel),
            typeof(CodeExplorerComponentViewModel),
            typeof(CodeExplorerMemberViewModel)
        };

        private readonly INavigateCommand _openCommand;

        public OpenCommand(
            INavigateCommand openCommand,
            IVbeEvents vbeEvents)
            : base(vbeEvents)
        {
            _openCommand = openCommand;

            AddToCanExecuteEvaluation(SpecialEvaluateCanExecute);
        }

        public sealed override IEnumerable<Type> ApplicableNodeTypes => ApplicableNodes;

        private bool SpecialEvaluateCanExecute(object parameter)
        {
            return ((CodeExplorerItemViewModel)parameter).QualifiedSelection.HasValue;
        }

        protected override void OnExecute(object parameter)
        {
            if (!CanExecute(parameter))
            {
                return;
            }

            // ReSharper disable once PossibleInvalidOperationException - tested above.
            _openCommand.Execute(((CodeExplorerItemViewModel)parameter).QualifiedSelection.Value.GetNavitationArgs());
        }
    }
}

{'repo_name': 'rubberduck-vba/Rubberduck', 'stars': '1118', 'repo_language': 'C#', 'file_name': 'RewriteSessionTestBase.cs', 'mime_type': 'text/plain', 'hash': -7884704780457717051, 'source_dataset': 'data'}


	{{if .HasPrev}}
	    ← Newer Posts
	{{end}}
	Page {{ .PageNumber }} of {{.TotalPages}}
	{{if .HasNext}}
	    Older Posts →
	{{end}}

{'repo_name': 'vjeantet/hugo-theme-casper', 'stars': '367', 'repo_language': 'HTML', 'file_name': 'default.md', 'mime_type': 'text/plain', 'hash': -7651647717543959519, 'source_dataset': 'data'}


rm -f tests/root
ln -s root1 tests/root
LC_ALL=C TZ=GMT ./pidstat -dRrsuvw > tests/out.pidstat-A.tmp

{'repo_name': 'sysstat/sysstat', 'stars': '1502', 'repo_language': 'C', 'file_name': 'sysstat.cron.daily.in', 'mime_type': 'text/x-shellscript', 'hash': 2551848238098693533, 'source_dataset': 'data'}


<!DOCTYPE html>

    <title>jQuery WeUI</title>
    <meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">

<meta name="description" content="Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.
">

<link rel="stylesheet" href="../lib/weui.min.css">
<link rel="stylesheet" href="../css/jquery-weui.css">
<link rel="stylesheet" href="css/demos.css">

Progress

{'repo_name': 'helijun/documents', 'stars': '216', 'repo_language': 'JavaScript', 'file_name': 'axios.js', 'mime_type': 'text/plain', 'hash': 204723457087175013, 'source_dataset': 'data'}


{'repo_name': 'gitpod-io/gitpod', 'stars': '1256', 'repo_language': 'None', 'file_name': 'variables.tf', 'mime_type': 'text/plain', 'hash': 6862347863018242896, 'source_dataset': 'data'}


HTTP

Use the HTTP page to modify HTTP settings for a network protocol.

The HTTP page contains the following options.

Load Defaults

Button to restore settings that have default values to their default values. Settings that do not have default values are not changed.

Configuration Name

The name of the configuration to which the settings on this page apply. This field is read only.

Protocol Name

The name of the protocol. The Protocol Name field is a read-only field. You can only specify the name when you create a new protocol.

Server Name

The host name to be used in the URLs the server sends to the client. This name is the alias name if your server uses an alias. If your server does not use an alias, leave this field blank.

Default Virtual Server

The virtual server to be associated with the protocol. Use the Virtual Servers page to define virtual servers.

Redirect Port

Port value that redirects a request to another port. The Payara Server automatically redirects the request if these two conditions exist:

This protocol is supporting non-SSL requests.

A request is received for which a matching security constraint requires SSL transport.

If a redirect port is not specified, the Payara Server uses the port number specified in the original request.

Max Connections

The maximum number of persistent connections to be maintained in Keep-Alive mode. The Keep-Alive subsystem periodically polls idle connections. The default value is 256.

Timeout

The maximum time in seconds that a connection can be considered idle and kept in the keep-alive state. A value of 0 or less means that keep-alive connections are kept open indefinitely. The default value is 30 seconds.

A value of -1 disables this timeout.

Upload Timeout

If this option is selected, the connection for a servlet that reads bytes slowly is closed after the Connection Upload Timeout limit is reached. If this option is disabled, servlet connections do not time out. This option is disabled by default.

Connection Upload Timeout

The timeout for uploads, in milliseconds. This field is applicable only if the Upload Timeout Enabled checkbox is selected. The default value is 300000 milliseconds.

A value of -1 disables this timeout.

Request Timeout

The number of seconds before a request times out. If the request is not processed before the timeout value is reached, the request is ignored. The default value is 30 seconds.

A value of -1 disables this timeout.

Send Buffer Size

The size in bytes of the send buffer. The default value is 8192 bytes.

Header Buffer Length

The size in bytes of the buffer used by the request processing threads to read the request data. The default value is 8192 bytes.

Max Post Size

The maximum size in bytes of POST actions using application/x-www-form-urlencoded. The default value is 2097152 bytes.

URI Encoding

The name of the character set used to decode the request URIs received. The value must be a valid IANA character set name. The default value is UTF-8.

Version

The version of the HTTP protocol used. The default value is HTTP/1.1.

Compression

Specifies the use of HTTP/1.1 GZIP compression to save server bandwidth. Available choices are:

on

Compresses data.

off

Disables compression.

force

Forces data compression in all cases.

The default value is off.

Compressible Mime Type

A comma-separated list of MIME types for which HTTP compression is used. The default value is text/html,text/xml,text/plain.

Compression Minimum Size

The minimum size of a file when compression is applied. This value must be set if Compression is set to on or force. The default value is 2048 bytes.

No-Compression User Agents

A comma-separated list of regular expressions matching user agents of HTTP clients for which compression should not be used. By default, this value is an empty string.

Restricted User Agent

A list of restricted user agents on which HTTP compression is applied. If no user agents are specified, HTTP compression is applied to all user agents. By default, no user agents are specified.

Default Response Type

A string that specifies the default response type. The format is a semicolon-delimited string consisting of the content-type, encoding, language, and charset. The default value is text/html; charset=iso-8859-1.

Forced Response Type

A string that specifies the request type used if no MIME mapping is available that matches the file extension. The format is a semicolon-delimited string consisting of the content-type, encoding, language, and charset. The default value is text/html; charset=iso-8859-1.

Adapter

The class name of the static resources adapter. The default value is com.sun.grizzly.tcp.StaticResourcesAdapter.

Comet Support

If this option is selected, Comet support is enabled for the protocol. This option is disabled by default.

DNS Lookup

If this option is selected, Domain Name System (DNS) lookup is enabled. This option is disabled by default.

RCM Support

If this option is selected, Resource Configuration Management (RCM) is enabled. This option is disabled by default.

Trace

If this option is selected, the TRACE operation is enabled. If this option is disabled, the Payara Server is less susceptible to cross-site scripting attacks. This option is enabled by default.

Auth Pass Through

If this option is selected, it indicates that the network listener that uses this protocol receives traffic from an SSL-terminating proxy server. This option is disabled by default.

Chunking

If this option is selected, HTTP response chunking is enabled. This option is enabled by default.

XPowered By

If this option is selected, the Payara Server uses X-Powered-By headers according to the Java Servlet 3.0 and Java Server Pages 2.0 specifications. This option is enabled by default.

Encoded Slash

If this option is selected, URIs are permitted to contain encoded slashes. This option is disabled by default.

Websockets Support

If this option is selected, the WebSockets protocol is supported. This option is disabled by default.

Related Tasks

To Create a Protocol

To Edit a Protocol

To Edit SSL Settings for a Protocol

To Edit HTTP Settings for a Protocol

To Edit File Cache Settings for a Protocol

To Delete a Protocol

Related asadmin Commands

create-protocol(1)

list-protocols(1)

delete-protocol(1)

Copyright © 2005, 2017, Oracle and/or its affiliates. All rights reserved. Legal Notices
Portions Copyright © [2017-2020] Payara Foundation and/or affiliates.

{'repo_name': 'payara/Payara', 'stars': '745', 'repo_language': 'Java', 'file_name': 'pom.xml', 'mime_type': 'text/xml', 'hash': 3039901049159030100, 'source_dataset': 'data'}


/**
 * Copyright (c) 2014,2019 Contributors to the Eclipse Foundation
 *
 * See the NOTICE file(s) distributed with this work for additional
 * information regarding copyright ownership.
 *
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License 2.0 which is available at
 * http://www.eclipse.org/legal/epl-2.0
 *
 * SPDX-License-Identifier: EPL-2.0
 */
package org.eclipse.smarthome.binding.bluetooth.bluegiga.internal.command.system;

import org.eclipse.smarthome.binding.bluetooth.bluegiga.internal.BlueGigaCommand;

/**
 * Class to implement the BlueGiga command addressGet.
 *

 * This command reads the local device's public Bluetooth address.
 *

 * This class provides methods for processing BlueGiga API commands.
 *

 * Note that this code is autogenerated. Manual changes may be overwritten.
 *
 * @author Chris Jackson - Initial contribution of Java code generator
 */
public class BlueGigaAddressGetCommand extends BlueGigaCommand {
    public static int COMMAND_CLASS = 0x00;
    public static int COMMAND_METHOD = 0x02;

    @Override
    public int[] serialize() {
        // Serialize the header
        serializeHeader(COMMAND_CLASS, COMMAND_METHOD);

        return getPayload();
    }

    @Override
    public String toString() {
        return "BlueGigaAddressGetCommand []";
    }
}

{'repo_name': 'eclipse-archived/smarthome', 'stars': '865', 'repo_language': 'Java', 'file_name': 'MANIFEST.MF', 'mime_type': 'text/plain', 'hash': 5920287806582798200, 'source_dataset': 'data'}


<CsoundSynthesizer>
<CsOptions>
; Select audio/midi flags here according to platform
-odac     ;;;realtime audio out
;-iadc    ;;;uncomment -iadc if realtime audio input is needed too
; For Non-realtime ouput leave only the line below:
; -o oscil.wav -W ;;; for file output any platform
</CsOptions>
<CsInstruments>

sr = 44100
ksmps = 32
nchnls = 2
0dbfs  = 1

instr 1

kdens expon 2, p3, 20000
aout  dust 0.5, kdens
outs  aout, aout

endin
</CsInstruments>
<CsScore>
i1 0 10
e
</CsScore>
</CsoundSynthesizer>

{'repo_name': 'csound/csound', 'stars': '749', 'repo_language': 'C', 'file_name': 'insert.c', 'mime_type': 'text/x-c', 'hash': 7856737393331687787, 'source_dataset': 'data'}


// Licensed to Elasticsearch B.V. under one or more contributor
// license agreements. See the NOTICE file distributed with
// this work for additional information regarding copyright
// ownership. Elasticsearch B.V. licenses this file to you under
// the Apache License, Version 2.0 (the "License"); you may
// not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied.  See the License for the
// specific language governing permissions and limitations
// under the License.

package bus

import (
	"sync"

	"github.com/elastic/beats/v7/libbeat/common"
	"github.com/elastic/beats/v7/libbeat/logp"
)

// Event sent to the bus
type Event common.MapStr

// Bus provides a common channel to emit and listen for Events
type Bus interface {
	// Publish an event to the bus
	Publish(Event)

	// Subscribe to all events, filter them to the ones containing *all* the keys in filter
	Subscribe(filter ...string) Listener
}

// Listener retrieves Events from a Bus subscription until Stop is called
type Listener interface {
	// Events channel
	Events() <-chan Event

	// Stop listening and removes itself from the bus
	Stop()
}

type bus struct {
	sync.RWMutex
	log       *logp.Logger
	listeners []*listener
	store     chan Event
}

type listener struct {
	filter  []string
	channel chan Event
	bus     *bus
}

// New initializes a new bus with the given name and returns it
func New(log *logp.Logger, name string) Bus {
	return &bus{
		log:       createLogger(log, name),
		listeners: make([]*listener, 0),
	}
}

// NewBusWithStore allows to create a buffered bus when producers send data without
// listeners being subscribed to them. size determines the size of the buffer.
func NewBusWithStore(log *logp.Logger, name string, size int) Bus {
	return &bus{
		log:       createLogger(log, name),
		listeners: make([]*listener, 0),
		store:     make(chan Event, size),
	}
}

func createLogger(log *logp.Logger, name string) *logp.Logger {
	selector := "bus-" + name
	return log.Named(selector).With("libbeat.bus", name)
}

func (b *bus) Publish(e Event) {
	b.RLock()
	defer b.RUnlock()

	b.log.Debugf("%+v", e)
	if len(b.listeners) == 0 && b.store != nil {
		b.store <- e
		return
	}

	if b.store != nil && len(b.store) != 0 {
		doBreak := false
		for !doBreak {
			select {
			case eve := <-b.store:
				for _, listener := range b.listeners {
					if listener.interested(eve) {
						listener.channel <- eve
					}
				}
			default:
				doBreak = true
			}
		}
	}

	for _, listener := range b.listeners {
		if listener.interested(e) {
			listener.channel <- e
		}
	}
}

func (b *bus) Subscribe(filter ...string) Listener {
	listener := &listener{
		filter:  filter,
		bus:     b,
		channel: make(chan Event, 100),
	}

	b.Lock()
	defer b.Unlock()
	b.listeners = append(b.listeners, listener)

	return listener
}

func (l *listener) Events() <-chan Event {
	return l.channel
}

func (l *listener) Stop() {
	l.bus.Lock()
	defer l.bus.Unlock()

	for i, listener := range l.bus.listeners {
		if l == listener {
			l.bus.listeners = append(l.bus.listeners[:i], l.bus.listeners[i+1:]...)
		}
	}

	close(l.channel)
}

// Return true if listener is interested on the given event
func (l *listener) interested(e Event) bool {
	for _, key := range l.filter {
		if _, ok := e[key]; !ok {
			return false
		}
	}
	return true
}

{'repo_name': 'elastic/beats', 'stars': '9014', 'repo_language': 'Go', 'file_name': 'generate.go', 'mime_type': 'text/plain', 'hash': -2581023558295458357, 'source_dataset': 'data'}


class Asyncplusplus < Formula
  desc "Concurrency framework for C++11"
  homepage "https://github.com/Amanieu/asyncplusplus"
  url "https://github.com/Amanieu/asyncplusplus/archive/v1.1.tar.gz"
  sha256 "d160d3a433a1e08f51c785742843182c2b81a7bc872766f57bf5f3108377b858"
  license "MIT"

  bottle do
    cellar :any
    sha256 "8116d1e5d9aefd7de88cb70633fdc91181460f7f0279bcc356f8d020a590510b" => :catalina
    sha256 "805297c643ba0c1fe0d774ea606f6e0925112b1a364b74122c877d51f1e729fb" => :mojave
    sha256 "ac6212a38c5aa391ee1eb547879615437a830967444deb15674e748c63f0b5b1" => :high_sierra
  end

  depends_on "cmake" => :build

  def install
    system "cmake", ".", *std_cmake_args
    system "make", "install"
  end

  test do
    (testpath/"test.cpp").write <<~EOS
      #include <iostream>
      #include <async++.h>

      int main()
      {
          auto task1 = async::spawn([] {
              std::cout << "Task 1 executes asynchronously" << std::endl;
          });
          auto task2 = async::spawn([]() -> int {
              std::cout << "Task 2 executes in parallel with task 1" << std::endl;
              return 42;
          });
          auto task3 = task2.then([](int value) -> int {
              std::cout << "Task 3 executes after task 2, which returned "
                        << value << std::endl;
              return value * 3;
          });
          auto task4 = async::when_all(task1, task3);
          auto task5 = task4.then([](std::tuple<async::task<void>,
                                                async::task<int>> results) {
              std::cout << "Task 5 executes after tasks 1 and 3. Task 3 returned "
                        << std::get<1>(results).get() << std::endl;
          });

          task5.get();
          std::cout << "Task 5 has completed" << std::endl;

          async::parallel_invoke([] {
              std::cout << "This is executed in parallel..." << std::endl;
          }, [] {
              std::cout << "with this" << std::endl;
          });

          async::parallel_for(async::irange(0, 5), [](int x) {
              std::cout << x;
          });
          std::cout << std::endl;

          int r = async::parallel_reduce({1, 2, 3, 4}, 0, [](int x, int y) {
              return x + y;
          });
          std::cout << "The sum of {1, 2, 3, 4} is " << r << std::endl;
      }
    EOS
    system ENV.cxx, "-I#{include}", "-L#{lib}", "-lasync++", "--std=c++11", "test.cpp", "-o", "test"
    system "./test"
  end
end

{'repo_name': 'Homebrew/homebrew-core', 'stars': '7794', 'repo_language': 'Ruby', 'file_name': 'postgresql-upgrade-database.rb', 'mime_type': 'text/x-ruby', 'hash': -9153986810993575605, 'source_dataset': 'data'}


import MnemonicX86 from '../../x86/MnemonicX86';
import MnemonicVariationsX86 from '../../x86/MnemonicVariationsX86';
import * as a from '../atoms';

const mnemonic_add_0 = new MnemonicX86;
mnemonic_add_0.mnemonic                = "cmc";
mnemonic_add_0.operandSize             = 0;
mnemonic_add_0.opcode                  = 245;
mnemonic_add_0.operandTemplates        = [];
mnemonic_add_0.opreg                   = -1;
mnemonic_add_0.operandSizeDefault      = 32;
mnemonic_add_0.lock                    = false;
mnemonic_add_0.regInOp                 = false;
mnemonic_add_0.opcodeDirectionBit      = false;
mnemonic_add_0.useModrm                = true;
mnemonic_add_0.rep                     = false;
mnemonic_add_0.repne                   = false;
mnemonic_add_0.prefixes                = null;
mnemonic_add_0.opEncoding              = "rm";
mnemonic_add_0.rex                     = null;
mnemonic_add_0.vex                     = null;
mnemonic_add_0.evex                    = null;
mnemonic_add_0.mode                    = 63;
mnemonic_add_0.extensions              = null;

const x86_mnemonic_variations_cmc = new MnemonicVariationsX86([
    mnemonic_add_0,
]);
x86_mnemonic_variations_cmc.defaultOperandSize = 32;

export default x86_mnemonic_variations_cmc;

{'repo_name': 'streamich/ass-js', 'stars': '105', 'repo_language': 'TypeScript', 'file_name': 'int.js', 'mime_type': 'text/plain', 'hash': 5175489705358268594, 'source_dataset': 'data'}