upstream/mercurial-mirror Files · contrib/python-zstandard/zstd/compress/zstd_lazy.h

automation: support building Windows wheels for Python 3.7 and 3.8...

automation: support building Windows wheels for Python 3.7 and 3.8 The time has come to support Python 3 on Windows. Let's teach our automation code to produce Windows wheels for Python 3.7 and 3.8. We could theoretically support 3.5 and 3.6. But I don't think it is worth it. People on Windows generally use the Mercurial installers, not wheels. And I'd prefer we limit variability and not have to worry about supporting earlier Python versions if it can be helped. As part of this, we change the invocation of pip to `python.exe -m pip`, as this is what is being recommended in Python docs these days. And it seemed to be required to avoid a weird build error. Why, I'm not sure. But it looks like pip was having trouble finding a Visual Studio files when invoked as `pip.exe` but not when using `python.exe -m pip`. Who knows. Differential Revision: https://phab.mercurial-scm.org/D8478

Gregory Szorc - - Load All Authors

File last commit:

r43207:69de49c4 default


                r45261:48096e26

default

Download file

             zstd_lazy.h
        
                    67 lines
            
             | 2.7 KiB
            
                | text/x-c
            
             |
                CLexer
            
             / contrib / python-zstandard / zstd / compress / zstd_lazy.h
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      /*

       * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.

       * All rights reserved.

       *

       * This source code is licensed under both the BSD-style license (found in the

       * LICENSE file in the root directory of this source tree) and the GPLv2 (found

       * in the COPYING file in the root directory of this source tree).

       * You may select, at your option, one of the above-listed licenses.

       */

      #ifndef ZSTD_LAZY_H

      #define ZSTD_LAZY_H

      #if defined (__cplusplus)

      extern "C" {

      #endif

      #include "zstd_compress_internal.h"

      U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip);

      void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue);  /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */

      size_t ZSTD_compressBlock_btlazy2(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_btlazy2_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_btlazy2_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      #if defined (__cplusplus)

      }

      #endif

      #endif /* ZSTD_LAZY_H */

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				/*
				* Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
				* All rights reserved.
				*
				* This source code is licensed under both the BSD-style license (found in the
				* LICENSE file in the root directory of this source tree) and the GPLv2 (found
				* in the COPYING file in the root directory of this source tree).
				* You may select, at your option, one of the above-listed licenses.
				*/

				#ifndef ZSTD_LAZY_H
				#define ZSTD_LAZY_H

				#if defined (__cplusplus)
				extern "C" {
				#endif

				#include "zstd_compress_internal.h"

				U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip);

				void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK /

				size_t ZSTD_compressBlock_btlazy2(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_greedy(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				size_t ZSTD_compressBlock_btlazy2_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_greedy_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				size_t ZSTD_compressBlock_greedy_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_btlazy2_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				#if defined (__cplusplus)
				}
				#endif

				#endif /* ZSTD_LAZY_H */